A branch‐and‐price‐based large neighborhood search algorithm for the vehicle routing problem with time windows
- 11 August 2009
- Vol. 54 (4), 190-204
- https://doi.org/10.1002/net.20332
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Vehicle Routing Problem with elementary shortest path based column generationComputers & Operations Research, 2006
- A new ILP-based refinement heuristic for Vehicle Routing ProblemsMathematical Programming, 2005
- Vehicle Routing Problem with Time Windows, Part II: MetaheuristicsTransportation Science, 2005
- Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search AlgorithmsTransportation Science, 2005
- A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time WindowsTransportation Science, 2004
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time WindowsINFORMS Journal on Computing, 2003
- Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling ProblemsPublished by Springer Science and Business Media LLC ,2002
- A unified tabu search heuristic for vehicle routing problems with time windowsJournal of the Operational Research Society, 2001
- Tabu SearchPublished by Springer Science and Business Media LLC ,1997
- A New Optimization Algorithm for the Vehicle Routing Problem with Time WindowsOperations Research, 1992