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 条
  • [41] A Greedy-Genetic Local-Search Heuristic for the Traveling Salesman Problem
    Rashid, Mohammad Harun
    Mosteiro, Miguel A.
    2017 15TH IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING WITH APPLICATIONS AND 2017 16TH IEEE INTERNATIONAL CONFERENCE ON UBIQUITOUS COMPUTING AND COMMUNICATIONS (ISPA/IUCC 2017), 2017, : 868 - 872
  • [42] New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
    Schmidt, Jeanette
    Irnich, Stefan
    EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2022, 10
  • [43] A new local search for the bees algorithm to optimize multiple traveling salesman problem
    Hamza A.
    Haj Darwish A.
    Rihawi O.
    Intelligent Systems with Applications, 2023, 18
  • [44] SEQUENTIAL AND PARALLEL LOCAL SEARCH FOR THE TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM
    KINDERVATER, G
    LENSTRA, JK
    SAVELSBERGH, M
    DISCRETE APPLIED MATHEMATICS, 1993, 42 (2-3) : 211 - 225
  • [45] A Random Restart Local Search Matheuristic for the Flying Sidekick Traveling Salesman Problem
    Dell'Amico, Mauro
    Montemanni, Roberto
    Novellani, Stefano
    2021 THE 8TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND APPLICATIONS-EUROPE, ICIEA 2021-EUROPE, 2021, : 205 - 209
  • [46] Two-phase Pareto local search for the biobjective traveling salesman problem
    Lust, Thibaut
    Teghem, Jacques
    JOURNAL OF HEURISTICS, 2010, 16 (03) : 475 - 510
  • [47] A Memetic Algorithm Based on Breakout Local Search for the Generalized Traveling Salesman Problem
    El Krari, Mehdi
    Ahiod, Belaid
    El Benani, Bouazza
    APPLIED ARTIFICIAL INTELLIGENCE, 2020, 34 (07) : 537 - 549
  • [48] Genetic local search based on genetic recombination: A case for traveling salesman problem
    Gang, P
    Iimura, I
    Tsurusawa, H
    Nakayama, S
    PARALLEL AND DISTRIBUTED COMPUTING: APPLICATIONS AND TECHNOLOGIES, PROCEEDINGS, 2004, 3320 : 202 - 212
  • [49] CROSSOVER ON INTENSIVE SEARCH AND TRAVELING SALESMAN PROBLEM
    CHENG, RW
    GEN, M
    COMPUTERS & INDUSTRIAL ENGINEERING, 1994, 27 (1-4) : 485 - 488
  • [50] Discrete Cuckoo Search for Traveling Salesman Problem
    Jati, Gilang Kusuma
    Manurung, Hisar Maruli
    Suyanto
    2012 7TH INTERNATIONAL CONFERENCE ON COMPUTING AND CONVERGENCE TECHNOLOGY (ICCCT2012), 2012, : 993 - 997
12345