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 条
  • [1] An Exact Parallel Algorithm for Traveling Salesman Problem
    Burkhovetskiy, V.
    Steinberg, B.
    CEE-SECR'17: PROCEEDINGS OF THE 13TH CENTRAL & EASTERN EUROPEAN SOFTWARE ENGINEERING CONFERENCE IN RUSSIA, 2017,
  • [2] 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
  • [3] An Efficient Heuristic Algorithm for the Traveling Salesman Problem
    Azimi, Parham
    Daneshvar, Peyman
    ADVANCED MANUFACTURING AND SUSTAINABLE LOGISTICS, PROCEEDINGS, 2010, 46 : 384 - +
  • [4] An Efficient Genetic Algorithm for the Traveling Salesman Problem
    Sun, Guangfu
    Li, Chengjun
    Zhu, Jiacheng
    Li, Yanpeng
    Liu, Wei
    COMPUTATIONAL INTELLIGENCE AND INTELLIGENT SYSTEMS, 2010, 107 : 108 - 116
  • [5] An Efficient and Scalable Algorithm for the Traveling Salesman Problem
    Ye, Chen
    Yang, Zhongcheng
    Yan, Tianxing
    2014 5TH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND SERVICE SCIENCE (ICSESS), 2014, : 335 - 339
  • [6] A Parallel Ensemble Genetic Algorithm for the Traveling Salesman Problem
    Varadarajan, Swetha
    Whitley, Darrell
    PROCEEDINGS OF THE 2021 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'21), 2021, : 636 - 643
  • [7] Parallel Genetic Algorithm with OpenCL for Traveling Salesman Problem
    Zhang, Kai
    Yang, Siman
    Li, Li
    Qiu, Ming
    BIO-INSPIRED COMPUTING - THEORIES AND APPLICATIONS, BIC-TA 2014, 2014, 472 : 585 - 590
  • [8] A Fast Parallel Genetic Algorithm for Traveling Salesman Problem
    Tsai, Chun-Wei
    Tseng, Shih-Pang
    Chiang, Ming-Chao
    Yang, Chu-Sing
    METHODS AND TOOLS OF PARALLEL PROGRAMMING MULTICOMPUTERS, 2010, 6083 : 241 - +
  • [9] A parallel and distributed Genetic Algorithm for the Traveling Salesman Problem
    Sena, G
    Isern, G
    Megherbi, D
    PROCEEDINGS OF THE HIGH PERFORMANCE COMPUTING SYMPOSIUM - HPC '99, 1999, : 319 - 324
  • [10] Parallel genetic algorithm with openCL for traveling salesman problem
    Zhang, Kai
    Yang, Siman
    Li, Li
    Qiu, Ming
    Communications in Computer and Information Science, 2014, 472 : 585 - 590
12345