| Title |
Improving local search for the traveling salesman problem |
| Another Title |
Lokaliosios paieškos patobulinimas komivojažieriaus uždaviniui spręsti. |
| Authors |
Misevičius, Alfonsas ; Ostreika, Armantas ; Šimaitis, Antanas ; Žilevičius, Vilius |
| Full Text |
|
| Is Part of |
Informacinės technologijos ir valdymas = Information technology and control.. Kaunas : Technologija. 2007, t. 36, Nr. 2. ISSN 1392-124X. eISSN 2335-884X |
| Keywords [eng] |
Traveling salesman problem ; Heuristics ; Local search ; Fast descent-random ascent strategy |
| Abstract [eng] |
The subject of this paper is the improving of local search for the traveling salesman problem (TSP). In particular, a so-called fast descent-random ascent (FDRA) strategy is proposed. The FDRA approach is based on the fast-modified 2-opt algorithm combined with certain perturbation (random ascent) procedures. The results obtained from the experiments demonstrate that the new improved local search strategy is better than the other local search algorithms. This approach may also be applied to other combinatorial optimization problems. |
| Published |
Kaunas : Technologija |
| Type |
Journal article |
| Language |
English |
| Publication date |
2007 |
| CC license |
|
