Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikace
ŠŤASTNÝ, J. ŠKORPIL, V. ČÍŽEK, L.
Originální název
Traveling Salesman Problem Optimization by Means of Graph-based Algorithm
Typ
článek ve sborníku ve WoS nebo Scopus
Jazyk
angličtina
Originální abstrakt
There are many different algorithms for optimization of logistic and scheduling problems and one of the most known is Genetic algorithm. In this paper we take a deeper look at a draft of new graph-based algorithm for optimization of scheduling problems based on Generalized Lifelong Planning A* algorithm which is usually used for path planning of mobile robots. And then we test it on Traveling Salesman Problem (TSP) against classic implementation of genetic algorithm. The results of these tests are then compared according to the time of finding the best path, its travel distance, an average distance of travel paths found and average time of finding these paths. A comparison of the results shows that the proposed algorithm has very fast convergence rate towards an optimal solution. Thanks to this it reaches not only better solutions than genetic algorithm, but in many instances it also reaches them faster.
Klíčová slova
Genetic algorithm; Graph-based algorithm; Traveling Salesman Problem; GLPA*; NP-Hard problem; logistics optimization; task scheduling
Autoři
ŠŤASTNÝ, J.; ŠKORPIL, V.; ČÍŽEK, L.
Vydáno
27. 6. 2016
Místo
Vienna, Austria
ISBN
978-1-5090-1287-9
Kniha
Proceedings of the 39th International Conference on Telecommunications and Signal Processing (TSP)
Strany od
207
Strany do
210
Strany počet
4
URL
https://ieeexplore.ieee.org/document/7760861
BibTex
@inproceedings{BUT128496, author="Jiří {Šťastný} and Vladislav {Škorpil} and Lubomír {Čížek}", title="Traveling Salesman Problem Optimization by Means of Graph-based Algorithm", booktitle="Proceedings of the 39th International Conference on Telecommunications and Signal Processing (TSP)", year="2016", pages="207--210", address="Vienna, Austria", doi="10.1109/TSP.2016.7760861", isbn="978-1-5090-1287-9", url="https://ieeexplore.ieee.org/document/7760861" }