Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
482755 | European Journal of Operational Research | 2006 | 16 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
José Brandão,