Improving local search for the traveling salesman problem

被引:0
|
作者
Misevicius, Alfonsas [1 ]
Ostreika, Armantas [1 ]
Simaitis, Antanas [1 ]
Zilevicius, Vilius [1 ]
机构
[1] Kaunas Univ Technol, Dept Multimedia Engn, LT-51368 Kaunas, Lithuania
来源
INFORMATION TECHNOLOGY AND CONTROL | 2007年 / 36卷 / 02期
关键词
traveling salesman problem; heuristics; local search; fast descent-random ascent strategy;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:187 / 195
页数:9
相关论文
共 50 条