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 条
  • [21] Parallel Cuckoo Search Algorithm on OpenMP for Traveling Salesman Problem
    Ng Tzy-Luen
    Keat, Yeow Teck
    Abdullah, Rosni
    2016 3RD INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCES (ICCOINS), 2016, : 380 - 385
  • [22] A hybridized parallel bats algorithm for combinatorial problem of traveling salesman
    Trong-The Nguyen
    Qiao, Yu
    Pan, Jeng-Shyang
    Chu, Shu-Chuan
    Chang, Kuo-Chi
    Xue, Xingsi
    Thi-Kien Dao
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2020, 38 (05) : 5811 - 5820
  • [23] Parallel Artificial Bee Colony Algorithm for the Traveling Salesman Problem
    Xu, Kun
    Jiang, Mingyan
    Yuan, Dongfeng
    PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION APPLICATIONS (ICCIA 2012), 2012, : 663 - 667
  • [24] AN ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM
    LITTLE, JDC
    MURTY, KG
    SWEENEY, DW
    KAREL, C
    OPERATIONS RESEARCH, 1963, 11 (06) : 972 - 989
  • [25] An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
    Dimitrijevic, V
    Saric, Z
    INFORMATION SCIENCES, 1997, 102 (1-4) : 105 - 110
  • [26] THERMODYNAMICAL APPROACH TO THE TRAVELING SALESMAN PROBLEM - AN EFFICIENT SIMULATION ALGORITHM
    CERNY, V
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1985, 45 (01) : 41 - 51
  • [27] An efficient genetic algorithm for the traveling salesman problem with precedence constraints
    Moon, C
    Kim, J
    Choi, G
    Seo, Y
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 140 (03) : 606 - 617
  • [28] PARALLEL TEMPERING FOR THE TRAVELING SALESMAN PROBLEM
    Wang, Chiaming
    Hyman, Jeffrey D.
    Percus, Allon
    Caflisch, Russel
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2009, 20 (04): : 539 - 556
  • [29] A PARALLEL 2-OPT ALGORITHM FOR THE TRAVELING-SALESMAN PROBLEM
    VERHOEVEN, MGA
    AARTS, EHL
    SWINKELS, PCJ
    FUTURE GENERATION COMPUTER SYSTEMS, 1995, 11 (02) : 175 - 182
  • [30] Hadoop MapReduce for Parallel Genetic Algorithm to Solve Traveling Salesman Problem
    Manzi, Entesar
    Bennaceur, Hachemi
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2019, 10 (08) : 97 - 107
12345