An improved heuristic for the period traveling salesman problem

被引：19

作者：

Bertazzi, L

Paletta, G

Speranza, MG

机构：

[1] Univ Brescia, Dipartimento Metodi Quantitativi, I-25122 Brescia, Italy

[2] Univ Calabria, Dipartimento Econ Polit, I-87036 Arcavacata Di Rende, Cs, Italy

来源：

COMPUTERS & OPERATIONS RESEARCH | 2004年 / 31卷 / 08期

关键词：

period traveling salesman problem; heuristic algorithms; computational results;

D O I：

10.1016/S0305-0548(03)00075-3

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We propose a heuristic algorithm for the solution of the period traveling salesman problem. Computational results obtained on the classical test instances of the literature show that the total distance obtained by the algorithm is not worse than the best-known total distance in 95% of the instances and is strictly better in 18 of the 40 tested instances. (C) 2003 Elsevier Ltd. All rights reserved.

引用

页码：1215 / 1222

页数：8

共 12 条

[1]

BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8

[2] A NEW HEURISTIC FOR THE PERIOD TRAVELING SALESMAN PROBLEM [J].