Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

EOR
2007

favoriteEmaildiscussreport

163views more EOR 2007»

The multi-depot vehicle routing problem with inter-depot routes

13 years 4 months ago

The multi-depot vehicle routing problem with inter-depot routes

Download neumann.hec.ca

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.

Benoit Crevier, Jean-François Cordeau, Gilb

Real-time Traffic

Adaptative Memory Principle | EOR 2007 | Multi-depot Vehicle | Tabu Search Method |

claim paper

Related Content

» Vehicle Routing and Job Shop Scheduling Whats the Difference

» A General Vehicle Routing Problem

» Planning time restricted logistic tours with fuzzy logic

» The Vehicle Routing Problem with Demand Range

» An exact algorithm for a vehicle routing problem with time windows and multiple use of veh...

» A Column Generation Heuristic for the General Vehicle Routing Problem

» Open Vehicle Routing Problem with Time Deadlines Solution Methods and an Application

» Improved bounds for vehicle routing solutions

» A general heuristic for vehicle routing problems

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	EOR
Authors	Benoit Crevier, Jean-François Cordeau, Gilbert Laporte

Comments (0)