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 条
  • [31] A Novel Local Search Algorithm for the Traveling Salesman Problem that Exploits Backbones
    Zhang, Weixiong
    Looks, Moshe
    19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 343 - 348
  • [32] Distributed Scheduling Combined with Traveling Salesman Problem: An Iterated Local Search
    Li, Peng
    Yang, Yixin
    Li, Zhengyang
    Duan, Wenzhe
    Li, Xiaoya
    Liu, Bo
    2017 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2017, : 1948 - 1953
  • [33] Local elimination in the traveling salesman problem
    Cook, William
    Helsgaun, Keld
    Hougardy, Stefan
    Schroeder, Rasmus T.
    MATHEMATICAL PROGRAMMING COMPUTATION, 2024, : 599 - 628
  • [34] LOCAL OPTIMIZATION AND THE TRAVELING SALESMAN PROBLEM
    JOHNSON, DS
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 443 : 446 - 461
  • [35] Two-phase Pareto local search for the biobjective traveling salesman problem
    Thibaut Lust
    Jacques Teghem
    Journal of Heuristics, 2010, 16 : 475 - 510
  • [36] Iterated local search approach using genetic transformation to the traveling salesman problem
    Katayama, K
    Narihisa, H
    GECCO-99: PROCEEDINGS OF THE GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 1999, : 321 - 328
  • [37] An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs
    Rey, Carlos
    Toth, Paolo
    Vigo, Daniele
    2020 39TH INTERNATIONAL CONFERENCE OF THE CHILEAN COMPUTER SCIENCE SOCIETY (SCCC), 2020,
  • [38] AN IMPROVED ARTIFICIAL BEE COLONY ALGORITHM WITH LOCAL SEARCH FOR TRAVELING SALESMAN PROBLEM
    Kocer, Hasan Erdinc
    Akca, Melike Ruhan
    CYBERNETICS AND SYSTEMS, 2014, 45 (08) : 635 - 649
  • [39] Composite Algorithm Based on Clarke - Wright and Local Search for the Traveling Salesman Problem
    Komarudin
    Parhusip, Sandiego F.
    2019 5TH INTERNATIONAL CONFERENCE ON INDUSTRIAL AND BUSINESS ENGINEERING (ICIBE 2019), 2019, : 87 - 90
  • [40] MAX-MIN Ant System and local search for the traveling salesman problem
    Stutzle, T
    Hoos, H
    PROCEEDINGS OF 1997 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '97), 1997, : 309 - 314
12345