A new tabu search algorithm for the vehicle routing problem with backhauls |
| |
Affiliation: | 1. Departamento de Estadística e Investigación Operativa, Universidad de Valencia, Valencia, Spain;2. Departamento de Estadística, Matemáticas e Informática, Universidad Miguel Hernández, 03202 Elche, Spain;3. Departamento de Estadística e Investigación Operativa, Universidad Complutense de Madrid, 28040 Madrid, Spain |
| |
Abstract: | In the distribution of goods from a central depot to geographically dispersed customers happens quite frequently that some customers, called linehauls, receive goods from that depot while others, named backhauls, send goods to it. This situation is described and studied by the vehicle routing problem with backhauls. In this paper we present a new tabu search algorithm that starting from pseudo-lower bounds was able to match almost all the best published solutions and to find many new best solutions, for a large set of benchmark problems. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|