Improvement procedures for the undirected rural postman problem

被引：78

作者：

Hertz, A ^{[1
]}

Laporte, G

Hugo, PN

机构：

[1] Ecole Polytech Fed Lausanne, Dept Math, CH-1015 Lausanne, Switzerland

[2] Univ Montreal, Ctr Rech Transports, Montreal, PQ H3C 3J7, Canada

[3] Ctr Compensat, CH-1211 Geneva, Switzerland

来源：

INFORMS JOURNAL ON COMPUTING | 1999年 / 11卷 / 01期

关键词：

Heuristics; Undirected rural postman problem; Vehicle routing;

D O I：

10.1287/ijoc.11.1.53

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This article describes new construction and postoptimization heuristics for the Undirected Rural Postman Problem. Extensive computational tests indicate that some combinations of these heuristics consistently produce optimal or high-quality solutions.

引用

页码：53 / 62

页数：10

共 15 条

[1] Assad A. A., 1995, HDB OPERATIONS RES M, V8, P375
[2] Christofides N, 1981, ICOR815 IMP COLL
[3] Christofides N., 1976, P S NEW DIR REC RES
[4] A POLYHEDRAL APPROACH TO THE RURAL POSTMAN PROBLEM
CORBERAN, A
SANCHIS, JM
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 79 (01) : 95 - 114
[5] CORBERAN A, 1991, GEN ROUTING PROBLEM
[6] CORBERAN A, 1998, COMMUNICATION
[7] A METHOD FOR SOLVING TRAVELING-SALESMAN PROBLEMS
CROES, GA
[J]. OPERATIONS RESEARCH, 1958, 6 (06) : 791 - 812
[8] Edmonds J., 1973, Mathematical Programming, V5, P88, DOI 10.1007/BF01580113
[9] ARC ROUTING-PROBLEMS .2. THE RURAL POSTMAN PROBLEM
EISELT, HA
GENDREAU, M
LAPORTE, G
[J]. OPERATIONS RESEARCH, 1995, 43 (03) : 399 - 414
[10] APPROXIMATION ALGORITHMS FOR SOME ROUTING PROBLEMS
FREDERICKSON, GN
HECHT, MS
KIM, CE
[J]. SIAM JOURNAL ON COMPUTING, 1978, 7 (02) : 178 - 193

← 1 2 →