A concise guide to the Traveling Salesman Problem

被引：51

作者：

Laporte, G. ^{[1
]}

机构：

[1] HEC Montreal, Canada Res Chair Distribut Management, Montreal, PQ, Canada

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2010年 / 61卷 / 01期

基金：

加拿大自然科学与工程研究理事会;

关键词：

Traveling Salesman Problem; exact algorithms; heuristics; software; LARGE-SCALE; ALGORITHM; BRANCH;

D O I：

10.1057/jors.2009.76

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

The Traveling Salesman Problem (TSP) is one of the most famous problems in combinatorial optimization. Hundreds of papers have been written on the TSP and several exact and heuristic algorithms are available for it. Their concise guide outlines the most important and best algorithms for the symmetric and asymmetric versions of the TSP. In several cases, references to publicly available software are provided. Journal of the Operational Research Society (2010) 61, 35-40. doi:10.1057/jors.2009.76

引用

页码：35 / 40

页数：6

共 54 条

[1]

[Anonymous], 2002, The vehicle routing problem pp

[2]

[Anonymous], 1995, Handbooks in Operations Research and Management Science, DOI 10.1016/S0927-0507(05)80121-5

[3]

[Anonymous], 1963, Recent Advances in Mathematical Programming

[4]

[Anonymous], 1985, The traveling salesman problem: a guided tour of combinatorial optimization

[5]

[Anonymous], 1985, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

[6]

[Anonymous], 1971, Math Program, DOI DOI 10.1007/BF01584070

[7] Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems [J].

Applegate, D ;

Bixby, R ;

Chvátal, V ;

Cook, W .

MATHEMATICAL PROGRAMMING, 2003, 97 (1-2) :91-153

[8] Certification of an optimal TSP tour through 85,900 cities [J].

Applegate, David L. ;

Bixby, Robert E. ;

Chvatal, Vasek ;

Cook, William ;

Espinoza, Daniel G. ;

Goycoolea, Marcos ;

Helsgaun, Keld .

OPERATIONS RESEARCH LETTERS, 2009, 37 (01) :11-15

[9]

Applegate David L, 2006, TRAVELING SALESMAN P

[10] Improvements to the Or-opt heuristic for the symmetric travelling salesman problem [J].

Babin, G. ;

Deneault, S. ;

Laporte, G. .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2007, 58 (03) :402-407

← 1 2 3 4 5 6 →