New heuristic algorithm for traveling salesman problem

被引：2

作者：

Shahab, M. L. ^{[1
]}

机构：

[1] Inst Teknol Sepuluh Nopember, Dept Math, Surabaya, Indonesia

来源：

INTERNATIONAL CONFERENCE ON MATHEMATICS: PURE, APPLIED AND COMPUTATION | 2019年 / 1218卷

关键词：

OPTIMIZATION;

D O I：

10.1088/1742-6596/1218/1/012038

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Traveling salesman problem (TSP) is a basis for many bigger problems. If we can find an efficient method (that produce a good result in a short time) to solve the TSP, then we will also be able to solve many other problems. In this research, we proposed a new heuristic algorithm for TSP. We used 80 problems from TSPLIB to test the proposed heuristic algorithm. The proposed heuristic algorithm can find the best-known distance for 36 different TSPs. The average of all Goodness Value is 99.50%.

引用

页数：9

共 9 条

[1]

Applegate D.L., 2006, The traveling salesman problem: a computational study

[2]

Bonyadi MR, 2008, TRAVELING SALESMAN P

[3] A DYNAMIC PROGRAMMING APPROACH TO SEQUENCING PROBLEMS [J].

HELD, M ;

KARP, RM .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (01) :196-210

[4] OPTIMIZATION BY SIMULATED ANNEALING [J].

KIRKPATRICK, S ;

GELATT, CD ;

VECCHI, MP .

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

[5] EFFECTIVE HEURISTIC ALGORITHM FOR TRAVELING-SALESMAN PROBLEM [J].

LIN, S ;

KERNIGHAN, BW .

OPERATIONS RESEARCH, 1973, 21 (02) :498-516

[6] OPTIMIZATION OF A 532-CITY SYMMETRICAL TRAVELING SALESMAN PROBLEM BY BRANCH AND CUT [J].

PADBERG, M ;

RINALDI, G .

OPERATIONS RESEARCH LETTERS, 1987, 6 (01) :1-7

[7]

Reinelt G., 1991, ORSA Journal on Computing, V3, P376, DOI 10.1287/ijoc.3.4.376

[8]

Shahab M. L., 2016, J THEORETICAL APPL I, V87, P461

[9] PARALLEL ITERATIVE SEARCH METHODS FOR VEHICLE-ROUTING PROBLEMS [J].

TAILLARD, E .

NETWORKS, 1993, 23 (08) :661-673

← 1 →