COMPARISON OF GENETIC ALGORITHM AND GRAPH-BASED ALGORITHM FOR THE TSP
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F13%3APU104704" target="_blank" >RIV/00216305:26210/13:PU104704 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
COMPARISON OF GENETIC ALGORITHM AND GRAPH-BASED ALGORITHM FOR THE TSP
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
MENDEL 2013
ISBN
978-80-214-4755-4
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
433-438
Publisher name
Neuveden
Place of publication
Neuveden
Event location
Brno University of Technology
Event date
Jun 26, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—