Solution traveling salesman problem using heuristic algorithms

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21220%2F15%3A00235739" target="_blank" >RIV/68407700:21220/15:00235739 - isvavai.cz</a>
Result on the web
<a href="http://stc.fs.cvut.cz/" target="_blank" >http://stc.fs.cvut.cz/</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Solution traveling salesman problem using heuristic algorithms
Original language description
Orbital transportation problem is a combinatorial problem of searching for the shortest route connecting a set of points, with the requirement that the route ends at the point at which it started. The length of the route is determined by choosing the order in connecting individual points. Finding a procedure that would find the shortest route, without the need to measure all the routes that exist. Still not found such an algorithm that this would allow a number of steps, which, depending on the number of points increases linearly or as a power function. This paper describes a heuristic approach to solving this problem, where some laws are applied on the value of the probability of occurrence of each line of points in the shortest route. Implementation of these laws can accelerate the search for solutions. The ability to quickly address this problem has applications in the optimization of logistic routes in order scheduling order processing, programming movement trajectories of machine tools etc.
Czech name
—
Czech description
—

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)