Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems

被引：8

作者：

David Applegate

Robert Bixby

Vašek Chvátal

William Cook

机构：

[1] Algorithms and Optimization Department,

[2] AT&T Labs – Research,undefined

[3] Florham Park,undefined

[4] NJ 07932,undefined

[5] USA,undefined

[6] Computational and Applied Mathematics,undefined

[7] Rice University,undefined

[8] Houston,undefined

[9] TX 77005,undefined

[10] USA,undefined

[11] Department of Computer Science,undefined

[12] Rutgers University,undefined

[13] Piscataway,undefined

[14] NJ 08854,undefined

[15] USA,undefined

[16] Industrial and Systems Engineering,undefined

[17] Georgia Institute of Technology,undefined

[18] Atlanta,undefined

[19] GA 30332,undefined

[20] USA,undefined

来源：

Mathematical Programming | 2003年 / 97卷

关键词：

Combinatorial Optimization; Integer Programming; Broad Classis; Travel Salesman Problem;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Dantzig, Fulkerson, and Johnson (1954) introduced the cutting-plane method as a means of attacking the traveling salesman problem; this method has been applied to broad classes of problems in combinatorial optimization and integer programming. In this paper we discuss an implementation of Dantzig et al.'s method that is suitable for TSP instances having 1,000,000 or more cities. Our aim is to use the study of the TSP as a step towards understanding the applicability and limits of the general cutting-plane method in large-scale applications.

引用

页码：91 / 153

页数：62

共 50 条

[1] Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
Applegate, D
Bixby, R
Chvátal, V
Cook, W
[J]. MATHEMATICAL PROGRAMMING, 2003, 97 (1-2) : 91 - 153
[2] On Lovasz-Schrijver lift-and-project procedures on the Dantzig-Fulkerson-Johnson relaxation of the TSP
Cheung, KKH
[J]. SIAM JOURNAL ON OPTIMIZATION, 2005, 16 (02) : 380 - 399
[3] An evolutionary algorithm for large traveling salesman problems
Tsai, HK
Yang, JM
Tsai, YF
Kao, CY
[J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2004, 34 (04): : 1718 - 1729
[4] A PARALLEL TABU SEARCH ALGORITHM FOR LARGE TRAVELING SALESMAN PROBLEMS
FIECHTER, CN
[J]. DISCRETE APPLIED MATHEMATICS, 1994, 51 (03) : 243 - 267
[5] Genetic algorithm for traveling salesman problems
School of Sciences, North University of China, Taiyuan 030051, China
[J]. Zhongbei Daxue Xuebao (Ziran Kexue Ban), 2007, 1 (49-52):
[6] Evolutionary algorithm to traveling salesman problems
Liao, Yen-Far
Yau, Dun-Han
Chen, Chieh-Li
[J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2012, 64 (05) : 788 - 797
[7] Bilevel Genetic Algorithm with Clustering for Large Scale Traveling Salesman Problems
Tan, Yan-yan
Yan, Li-zhuang
Yun, Guo-xiao
Zheng, Wei
[J]. 2016 INTERNATIONAL CONFERENCE ON INFORMATION SYSTEM AND ARTIFICIAL INTELLIGENCE (ISAI 2016), 2016, : 365 - 369
[8] An improved firefly algorithm for traveling salesman problems
Wang Ming-bo
Fu Qiang
Tong Nan
Li Mengmeng
Zhao Yiming
[J]. PROCEEDINGS OF THE 2015 4TH NATIONAL CONFERENCE ON ELECTRICAL, ELECTRONICS AND COMPUTER ENGINEERING ( NCEECE 2015), 2016, 47 : 1085 - 1092
[9] A PARALLEL BRANCH AND BOUND ALGORITHM FOR SOLVING LARGE ASYMMETRIC TRAVELING SALESMAN PROBLEMS
PEKNY, JF
MILLER, DL
[J]. MATHEMATICAL PROGRAMMING, 1992, 55 (01) : 17 - 33
[10] A new efficient hybrid algorithm for large scale multiple traveling salesman problems
Jiang, Chao
Wan, Zhongping
Peng, Zhenhua
[J]. EXPERT SYSTEMS WITH APPLICATIONS, 2020, 139 (139)

← 1 2 3 4 5 →