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 条

[31] A New Parallel Ant Colony Optimization Algorithm for Traveling Salesman Problem
Xiong, Jie
Liu, Caiyun
Chen, Zhong
Zou, Xueyu
PROGRESS IN INTELLIGENCE COMPUTATION AND APPLICATIONS, 2008, : 171 - 175
[32] A study of five parallel approaches to a genetic algorithm for the traveling salesman problem
Wang, L
Maciejewski, AA
Siegel, HJ
Roychowdhury, VP
Eldridge, BD
INTELLIGENT AUTOMATION AND SOFT COMPUTING, 2005, 11 (04): : 217 - 234
[33] Research On Traveling Salesman Problem Algorithm
Yun, Xiaoyan
MANUFACTURING PROCESS AND EQUIPMENT, PTS 1-4, 2013, 694-697 : 2901 - 2904
[34] AN ALGORITHM FOR THE BOTTLENECK TRAVELING SALESMAN PROBLEM
CARPANETO, G
MARTELLO, S
TOTH, P
OPERATIONS RESEARCH, 1984, 32 (02) : 380 - 389
[35] Searching for backbones - An efficient parallel algorithm for finding groundstates in spin glass models
Schneider, JJ
SLOW DYNAMICS IN COMPLEX SYSTEMS, 2004, 708 : 426 - 429
[36] A Memetic Algorithm for the Traveling Salesman Problem
Arango, M. D.
Serna, C. A.
IEEE LATIN AMERICA TRANSACTIONS, 2015, 13 (08) : 2674 - 2679
[37] AN ALGORITHM FOR GENERAL TRAVELING SALESMAN PROBLEM
HEIN, O
ANGEWANDTE INFORMATIK, 1977, (01): : 22 - 25
[38] SEARCH ALGORITHM FOR TRAVELING SALESMAN PROBLEM
GUPTA, JND
COMPUTERS & OPERATIONS RESEARCH, 1978, 5 (04) : 243 - 250
[39] NETWORK ALGORITHM FOR TRAVELING SALESMAN PROBLEM
SUURBALL.JW
OPERATIONS RESEARCH, 1964, 12 : B55 - &
[40] AN ALGORITHM FOR SOLVING THE TRAVELING SALESMAN PROBLEM
LITTLE, JDC
MURTY, KG
KAREL, C
SWEENEY, DW
OPERATIONS RESEARCH, 1963, 11 : B48 - B48

← 1 2 3 4 5 →