THE TRAVELING SALESMAN PROBLEM WITH BACKHAULS

Authors
GENDREAU M HERTZ A LAPORTE G
Citation
M. Gendreau et al., THE TRAVELING SALESMAN PROBLEM WITH BACKHAULS, Computers & operations research, 23(5), 1996, pp. 501-508
Citations number
19
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science","Computer Science Interdisciplinary Applications","Engineering, Industrial
Journal title
Computers & operations research → ACNP
ISSN journal
03050548
Volume
23
Issue
5
Year of publication
1996
Pages
501 - 508
Database
ISI
SICI code
0305-0548(1996)23:5<501:TTSPWB>2.0.ZU;2-R
Abstract
The purpose of this paper is to propose new heuristics for the Traveli ng Salesman Problem with Backhauls. In this problem, the aim is to det ermine a least cost Hamiltonian tour through a set of linehaul and bac khaul 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 heu ristics yields high quality solutions. (C) 1996 Elsevier Science Ltd