Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
482414 | European Journal of Operational Research | 2007 | 18 Pages |
Abstract
This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes a heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming. Tests are conducted on randomly generated instances.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Benoit Crevier, Jean-François Cordeau, Gilbert Laporte,