Searching for backbones - An efficient parallel algorithm for the traveling salesman problem

被引：45
|
作者：
Schneider, J [1 ]
Froschhammer, C [1 ]
Morgenstern, I [1 ]
Husslein, T [1 ]
Singer, JM [1 ]
机构：
[1] UNIV ZURICH,INST PHYS,CH-8057 ZURICH,SWITZERLAND
来源：
COMPUTER PHYSICS COMMUNICATIONS | 1996年 / 96卷 / 2-3期
关键词：
optimization; parallel; Monte Carlo; threshold accepting; TSP; backbone; degeneracy;
D O I：
10.1016/0010-4655(96)00062-8
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
The Traveling Salesman Problem (TSP) plays an important role in Operations Research, Applied Mathematics and Computational Physics. We investigated it using a stochastic approach. Studying several solutions of a special TSP we found that many parts of a good solution are the same in all other good solutions for this problem. In this paper we discuss an efficient parallel method to reduce the TSP to a smaller one by finding these backbones and eliminating them to get even better solutions in a very short time and a few observables of interest corresponding to this parallel approach.
引用
收藏
页码：173 / 188
页数：16
相关论文
共 50 条
  • [41] Efficient parallelization of a branch & bound algorithm for the symmetric traveling salesman problem
    Lueling, R.
    Monien, B.
    Raecke, M.
    Tschoeke, S.
    Proceedings of the European Workshops on Parallel Computing, 1992,
  • [42] Efficient GPU Implementation of Genetic Algorithm to Solve the Traveling Salesman Problem
    Kidwell, Adam
    Fillmore, Alex
    Alawneh, Shadi
    SOUTHEASTCON 2024, 2024, : 44 - 49
  • [43] Amoeba searching behavior model for traveling salesman problem
    Yokoi, Hiroshi
    Mizuno, Takafumi
    Takita, Masatoshi
    Kakazu, Yukinori
    International Journal of Smart Engineering System Design, 1999, 2 (01): : 43 - 55
  • [44] An efficient hybrid genetic algorithm for the traveling salesman problem with release dates
    Soares, Gabriel
    Bulhoes, Teobaldo
    Bruck, Bruno
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 318 (01) : 31 - 42
  • [45] Parallel discrete lion swarm optimization algorithm for solving traveling salesman problem
    Zhang Daoqing
    Jiang Mingyan
    JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2020, 31 (04) : 751 - 760
  • [46] RESULTS FROM A PARALLEL BRANCH AND BOUND ALGORITHM FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEM
    MILLER, DL
    PEKNY, JF
    OPERATIONS RESEARCH LETTERS, 1989, 8 (03) : 129 - 135
  • [47] A Parallel Multi-start Search Algorithm for Dynamic Traveling Salesman Problem
    Li, Weiqi
    EXPERIMENTAL ALGORITHMS, 2011, 6630 : 65 - 75
  • [48] Parallel discrete lion swarm optimization algorithm for solving traveling salesman problem
    ZHANG Daoqing
    JIANG Mingyan
    Journal of Systems Engineering and Electronics, 2020, 31 (04) : 751 - 760
  • [49] An Efficient Combined Meta-Heuristic Algorithm for Solving the Traveling Salesman Problem
    Yousefikhoshbakht, Majid
    Dolatnejad, Azam
    BRAIN-BROAD RESEARCH IN ARTIFICIAL INTELLIGENCE AND NEUROSCIENCE, 2016, 7 (03): : 125 - 138
  • [50] AN EFFICIENT TRANSFORMATION OF THE GENERALIZED TRAVELING SALESMAN PROBLEM
    NOON, CE
    BEAN, JC
    INFOR, 1993, 31 (01) : 39 - 44
12345