SOLVING TRAVELING SALESMAN PROBLEM BY HEURISTIC ALGORITHMS

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21220%2F19%3A00328255" target="_blank" >RIV/68407700:21220/19:00328255 - isvavai.cz</a>
Result on the web
<a href="http://evlm.stuba.sk/APLIMAT/indexe.htm" target="_blank" >http://evlm.stuba.sk/APLIMAT/indexe.htm</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
SOLVING TRAVELING SALESMAN PROBLEM BY HEURISTIC ALGORITHMS
Original language description
This paper describes real model solving the traveling salesman problem using heuristic algorithms. Heuristic algorithms select improbable solutions and therefore the optimal solution is found in a short time. The algorithm uses random search and also regularity in traveling salesman problem’s. At the same time, it is ensured that the algorithm always finds the acceptable solution.
Czech name
—
Czech description
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Article name in the collection
18th Conference on Applied Mathematics APLIMAT 2019 PROCEEDINGS
ISBN
978-80-227-4884-1
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
679-684
Publisher name
Slovak University of Technology
Place of publication
Bratislava
Event location
Bratislava
Event date
Feb 5, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)