vest_logo_eng.png

Vestnik of
Vitebsk State
Technological
University

ru gb

ISSN: 2306-1774 (Online)

ISSN: 2079-7958 (Print)

раб. тел.  +375 212 495338

 
 

 

Поиск по сайту

vakRB_sm.png

logo-eLibrary.jpg

DOAJ_logo.jpg

OAJI Vestnik of VSTU

plus2.png

kiberleninka_sm.png

readera.png

index_copernicus.jpg

Google_Scholar.png

issn_sm.jpg

 
 

Route optimization using graph theory in the application package


UDC 004.9 : 658

Authors


 
 

abstract


The analysis of methods for solving the using graph theory in application packages is represented in this article. For possibility of use of computer algebra system this problem was presented in the form of а mathematical model on the graph. Some versions of the solution of the problem by means of various CAS are in detail considered. Indisputable leaders in in this area are CAS Maple and CAS Mathematica. The solution of this problem by means of CAS Maple is realized by Dijkstra's algorithm, Simulated annealing and Ant colony optimization algorithms. CAS Mathematica has expanded support graphs necessary for solution of the shortest path problem.

Route optimization using graph theory in the application package

keywords


Publisher's imprint


Vardomatskaja, Alena. Route optimization using graph theory in the application package/ Vardomatskaja Alena, Sharstniou Uladzimir, Alekseeva Yanina // Vestnik of Vitebsk State Technological University . ─ 2016. ─ № 1(30). ─ P. 130.