Self-imposed time windows in vehicle routing problems
- 2 October 2013
- journal article
- research article
- Published by Springer Science and Business Media LLC in OR Spectrum
- Vol. 37 (2), 331-352
- https://doi.org/10.1007/s00291-013-0348-1
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- A hybrid method based on linear programming and tabu search for routing of logging trucksComputers & Operations Research, 2009
- Meta-heuristics for stable scheduling on a single machineComputers & Operations Research, 2008
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demandsOperations Research Letters, 2007
- Multiple machine JIT scheduling: a tabu search approachInternational Journal of Production Research, 2007
- 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
- Separating capacity constraints in the CVRP using tabu searchEuropean Journal of Operational Research, 1998
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage ProductionManagement Science, 1995
- A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraintsComputers & Operations Research, 1994
- A Tabu Search Heuristic for the Vehicle Routing ProblemManagement Science, 1994