Integrating Relative Coordinates with Simulated Annealing to Solve a Traveling Salesman Problem

被引：3

作者：

Liu, Xiaojun ^{[1
,2
]}

Zhang, Bin ^{[2
]}

Du, Fangying ^{[2
]}

机构：

[1] Macau Univ Sci & Technol, Sch Business, Taipa, Peoples R China

[2] Jilin Univ, Zhuhai Coll, Dept Logist & Informat Management, Zhuhai, Peoples R China

来源：

2014 SEVENTH INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL SCIENCES AND OPTIMIZATION (CSO) | 2014年

关键词：

simulated annealing method; traveling salesman problem; city's relative coordinates;

D O I：

10.1109/CSO.2014.39

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Traveling salesman problem is one of most famous problems in Combinatorial Optimization. This paper presents a case study of ANJI-CEVA AUTOMOTIVE LOGISTICS CO., LTD. We formulated their problem as a traveling salesman problem and, with the use of relative coordinates of the locations as problem parameters, solved the traveling salesman problem by simulated annealing and our final solution is shown to be a circular path.

引用

页码：177 / 180

页数：4

共 15 条

[1] THERMODYNAMICAL APPROACH TO THE TRAVELING SALESMAN PROBLEM - AN EFFICIENT SIMULATION ALGORITHM [J].

CERNY, V .

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1985, 45 (01) :41-51

[2] Two-Level Genetic Algorithm for Clustered Traveling Salesman Problem with Application in Large-Scale TSPs [J].

Department of Industrial Engineering, Tsinghua University, Beijing, 100084, China .

Tsinghua Sci. Tech., 2007, 4 (459-465) :459-465

[3] Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search [J].

Geng, Xiutang ;

Chen, Zhihua ;

Yang, Wei ;

Shi, Deqian ;

Zhao, Kai .

APPLIED SOFT COMPUTING, 2011, 11 (04) :3680-3689

[4] Combination of chaotic neurodynamics with the 2-opt algorithm to solve traveling salesman problems [J].

Hasegawa, M ;

Ikeguchi, T ;

Aihara, K .

PHYSICAL REVIEW LETTERS, 1997, 79 (12) :2344-2347

[5] A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery [J].

Hernández-Pérez, H ;

Salazar-González, JS .

DISCRETE APPLIED MATHEMATICS, 2004, 145 (01) :126-139

[6]

Hui Wang., 2012, Systems Engineering Procedia, V4, P226, DOI DOI 10.1016/J.SEPRO.2011.11.070

[7] OPTIMIZATION BY SIMULATED ANNEALING [J].

KIRKPATRICK, S ;

GELATT, CD ;

VECCHI, MP .

SCIENCE, 1983, 220 (4598) :671-680

[8] Probability Collectives: A multi-agent approach for solving combinatorial optimization problems [J].

Kulkarni, Anand J. ;

Tai, K. .

APPLIED SOFT COMPUTING, 2010, 10 (03) :759-771

[9] Speed-up techniques for solving large-scale biobjective TSP [J].

Lust, T. ;

Jaszkiewicz, A. .

COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (03) :521-533

[10] Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times [J].

Majumdar, J. ;

Bhunia, A. K. .

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2011, 235 (09) :3063-3078

← 1 2 →