Designing delivery districts for the vehicle routing problem with stochastic demands
- 1 August 2007
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 180 (3), 997-1010
- https://doi.org/10.1016/j.ejor.2005.11.070
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Solving a home-care districting problem in an urban settingJournal of the Operational Research Society, 2003
- A tabu search heuristic for the static multi-vehicle dial-a-ride problemTransportation Research Part B: Methodological, 2003
- A tabu search heuristic and adaptive memory procedure for political districtingEuropean Journal of Operational Research, 2003
- A simulated annealing approach to police district designComputers & Operations Research, 2002
- A unified tabu search heuristic for vehicle routing problems with time windowsJournal of the Operational Research Society, 2001
- Stochastic vehicle routingEuropean Journal of Operational Research, 1996
- Parallel iterative search methods for vehicle routing problemsNetworks, 1993
- Future paths for integer programming and links to artificial intelligenceComputers & Operations Research, 1986
- A system approach to the optimal health-care districtingEuropean Journal of Operational Research, 1981
- An Algorithm for the Vehicle-dispatching ProblemJournal of the Operational Research Society, 1969