A new combined heuristic for the Euclidean traveling salesman problem

被引：0
|
作者：
Yang, Fei [1 ]
Lu, Yijiang [1 ]
机构：
[1] Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China
来源：
Proceedings of the First International Conference on Information and Management Sciences | 2002年 / 1卷
关键词：
Euclidean traveling salesman problem (ETSP); heuristics; greedy algorithms; genetic algorithms;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
A new algorithm for solving, suboptimally, the Euclidean traveling salesman problem (ETSP) is created. The algorithm is a genetic algorithm based on a construction greedy algorithm. Namely, the tour is constructed by the greedy algorithm, and then a genetic algorithm is used to get better results. Extensive computational experiments are performed for several different families of ETSP instances, disclosing that our combined heuristic proves significantly faster in obtaining (relatively) high quality solutions over a wide range of instances.
引用
收藏
页码：102 / 105
页数：4
相关论文
共 50 条
  • [1] A Hybrid Heuristic Algorithm for the Euclidean Traveling Salesman Problem
    Singh, Dharm Raj
    Singh, Manoj Kumar
    Singh, Tarkeshwar
    [J]. 2015 INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION & AUTOMATION (ICCCA), 2015, : 773 - 778
  • [2] A NEW HEURISTIC FOR THE TRAVELING SALESMAN PROBLEM
    CARLIER, J
    VILLON, P
    [J]. RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1990, 24 (03): : 245 - 253
  • [3] A NEW HEURISTIC FOR THE PERIOD TRAVELING SALESMAN PROBLEM
    CHAO, IM
    GOLDEN, BL
    WASIL, EA
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (05) : 553 - 565
  • [4] A COMPUTATIONAL COMPARISON OF 5 HEURISTIC ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM
    STEWART, WR
    [J]. LECTURE NOTES IN ECONOMICS AND MATHEMATICAL SYSTEMS, 1982, 199 : 104 - 116
  • [5] New heuristic algorithm for traveling salesman problem
    Shahab, M. L.
    [J]. INTERNATIONAL CONFERENCE ON MATHEMATICS: PURE, APPLIED AND COMPUTATION, 2019, 1218
  • [6] THE APPROXIMATION RATIO OF THE k-OPT HEURISTIC FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM
    Brodowsky, Ulrich A.
    Hougardy, Stefan
    Zhong, Xianghui
    [J]. SIAM JOURNAL ON COMPUTING, 2023, 52 (04) : 841 - 864
  • [7] The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem
    Brodowsky, Ulrich A.
    Hougardy, Stefan
    [J]. 38TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2021), 2021, 187
  • [8] New heuristic algorithms for the Dubins traveling salesman problem
    Babel, Luitpold
    [J]. JOURNAL OF HEURISTICS, 2020, 26 (04) : 503 - 530
  • [9] Study on a new heuristic crossover for the traveling salesman problem
    Hu, Qiaohua
    Wu, Huaiyu
    Chen, Qiaoli
    Chen, Yuan
    [J]. 2006 CHINESE CONTROL CONFERENCE, VOLS 1-5, 2006, : 495 - +
  • [10] A new heuristic for the Traveling Salesman Problem with Time Windows
    Calvo, RW
    [J]. TRANSPORTATION SCIENCE, 2000, 34 (01) : 113 - 124
12345