| Article ID: | iaor19962261 |
| Country: | United Kingdom |
| Volume: | 23 |
| Issue: | 5 |
| Start Page Number: | 501 |
| End Page Number: | 508 |
| Publication Date: | May 1996 |
| Journal: | Computers and Operations Research |
| Authors: | Laporte Gilbert, Gendreau Michel, Herz Alain |
| Keywords: | heuristics |
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 Hamiltonain 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 heuristics, all having a good emprical performance ratio, are described and compared with a lower bound. Computational results indicate that the best of these heuristics yields high quality solutions.