Comparison of Methods of Initial Transport Routes Design

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60461373%3A22340%2F01%3A00003873" target="_blank" >RIV/60461373:22340/01:00003873 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Comparison of Methods of Initial Transport Routes Design
Original language description
The choice of a method of initial transport routes design (so-called initial estimate) is of great importance for a class of heuristic algorithms working on the principle of modification existing routes. Modified heuristic algorithms applied for solvingthe problem called Travelling Salesman Problem appear as advisable ones. They give very good results at considerably shorter calculation times in comparison with random initial estimate algorithms. In this article, the calculation times and results of atypical design of transport routes for initial estimates created by a number of heuristic rules are compared with these for random choice. All the calculations were carried out by means of numerical experiments on the background of a real network of roads.
Czech name
—
Czech description
—

Publication year
2001
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
Proc. of the 13th Int. Conf. on Process Control PC '01
ISBN
80-227-1542-5
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
"P070-1"-"P070-7"
Publisher name
Slovak University of Technology
Place of publication
Bratislava
Event location
Štrbské Pleso, High Tatras, Slovakia
Event date
Jun 11, 2001
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—

Similar results(10)