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 条
  • [21] Consultant-Guided Search Combined with Local Search for the Traveling Salesman Problem
    Iordache, Serban
    GECCO-2010 COMPANION PUBLICATION: PROCEEDINGS OF THE 12TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2010, : 2087 - 2088
  • [22] Improving the Performance of Multi-start Search on the Traveling Salesman Problem
    King, Charles R.
    McKenney, Mark
    Tamir, Dan E.
    DEVELOPING CONCEPTS IN APPLIED INTELLIGENCE, 2011, 363 : 77 - 82
  • [23] SEARCH ALGORITHM FOR TRAVELING SALESMAN PROBLEM
    GUPTA, JND
    COMPUTERS & OPERATIONS RESEARCH, 1978, 5 (04) : 243 - 250
  • [24] On the neighborhood structure of the traveling salesman problem generated by local search moves
    Stattenberger, Guether
    Dankesreiter, Markus
    Baumgartner, Florian
    Schneider, Johannes J.
    JOURNAL OF STATISTICAL PHYSICS, 2007, 129 (04) : 623 - 648
  • [25] Breakout local search for the traveling salesman problem with job-times
    Zou, Yuji
    Hao, Jin-Kao
    Wu, Qinghua
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 225
  • [26] Design and analysis of stochastic local search for the multiobjective traveling salesman problem
    Paquete, Luis
    Stutzle, Thomas
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (09) : 2619 - 2631
  • [27] On the Neighborhood Structure of the Traveling Salesman Problem Generated by Local Search Moves
    Günther Stattenberger
    Markus Dankesreiter
    Florian Baumgartner
    Johannes J. Schneider
    Journal of Statistical Physics, 2007, 129 : 623 - 648
  • [28] A two-phase local search for the biobjective traveling salesman problem
    Paquete, L
    Stützle, T
    EVOLUTIONARY MULTI-CRITERION OPTIMIZATION, PROCEEDINGS, 2003, 2632 : 479 - 493
  • [29] Simulated Annealing with a Hybrid Local Search for Solving the Traveling Salesman Problem
    Zhao, Dongming
    Xiong, Wei
    Shu, Zongyu
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (07) : 1165 - 1169
  • [30] Improved Ant Colony Optimization with Local Search for Traveling Salesman Problem
    Thammano, Arit
    Oonsrikaw, Yindee
    2019 20TH IEEE/ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING (SNPD), 2019, : 22 - 27
12345