A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows
The authors present a branch-and-cut-and-price algorithm for the exact solution of a variation of the vehicle routing problem with time windows in which the transportation fleet is made by vehicles with different capacities and fixed costs, based at different depots. They illustrate different pricing and cutting techniques and we present an experimental evaluation of their combinations. Computational results are reported on the use of the algorithm both for exact optimization and as a heuristic method.
- Record URL:
-
Availability:
- Find a library where document is available. Order URL: http://worldcat.org/issn/0968090X
-
Supplemental Notes:
- Abstract reprinted with permission from Elsevier
-
Authors:
- Bettinelli, Andrea
- Ceselli, Alberto
- Righini, Giovanni
- Publication Date: 2011-8
Language
- English
Media Info
- Media Type: Print
- Features: Figures; References; Tables;
- Pagination: pp 723-740
-
Serial:
- Transportation Research Part C: Emerging Technologies
- Volume: 19
- Issue Number: 5
- Publisher: Elsevier
- ISSN: 0968-090X
- Serial URL: http://www.sciencedirect.com/science/journal/0968090X
Subject/Index Terms
- TRT Terms: Algorithms; Fleet management; Heuristic methods; Logistics; Optimization; Pricing; Routing; Time windows; Vehicle fleets
- Subject Areas: Freight Transportation; Highways; Planning and Forecasting;
Filing Info
- Accession Number: 01342149
- Record Type: Publication
- Files: TRIS
- Created Date: Jun 21 2011 9:27AM