Přístupnostní navigace
E-application
Search Search Close
Publication detail
ČÍŽEK, L. ŠŤASTNÝ, J.
Original Title
COMPARISON OF GENETIC ALGORITHM AND GRAPH-BASED ALGORITHM FOR THE TSP
Type
conference paper
Language
English
Original Abstract
This paper deals with the comparison of algorithms for Traveling Salesman Problem (TSP). Many different algorithms for optimization of logistic problems exist and the one of most known is Genetic algorithm. In this article we take look at Generalized Lifelong Planning A* algorithm, which is usually used for path planning problems, and we try to modify it so it can be used for other types of optimization as well. Then we test this modified algorithm and genetic algorithm on several Traveling Salesman Problems. The results of these tests are then compared according to time of optimization and distance of traveled path.
Keywords
Genetic algorithm, Graph-based algorithm, Traveling Salesman Problem, GLPA*, NP-Hard problem, logistics optimization, path planning problem.
Authors
ČÍŽEK, L.; ŠŤASTNÝ, J.
RIV year
2013
Released
26. 6. 2013
ISBN
978-80-214-4755-4
Book
MENDEL 2013
Pages from
433
Pages to
438
Pages count
6
BibTex
@inproceedings{BUT101084, author="Lubomír {Čížek} and Jiří {Šťastný}", title="COMPARISON OF GENETIC ALGORITHM AND GRAPH-BASED ALGORITHM FOR THE TSP", booktitle="MENDEL 2013", year="2013", pages="433--438", isbn="978-80-214-4755-4" }