The traveling salesman problem with backhauls

被引:45
|
作者
Gendreau, M [1 ]
Hertz, A [1 ]
Laporte, G [1 ]
机构
[1] ECOLE POLYTECH FED LAUSANNE,DEPT MATH,CH-1015 ECUBLENS,SWITZERLAND
关键词
D O I
10.1016/0305-0548(95)00036-4
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The purpose of this paper is to propose new heuristics for the Traveling Salesman Problem with Backhauls. In this problem, the aim is to determine a least cost Hamiltonian tour through a set of linehaul and backhaul customers, in such a way that all backhaul customers are visited contiguously after all linehaul customers. Six heuristic, all having a good empirical performance ratio, are described and compared with a lower bound. Computational results indicate that the best of these heuristics yields high quality solutions. (C) 1996 Elsevier Science Ltd
引用
收藏
页码:501 / 508
页数:8
相关论文
共 50 条