A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities
Published Online:1 Feb 2008https://doi.org/10.1287/ijoc.1070.0230
References
- The capacitated arc routing problem with refill points. Oper. Res. Lett. (2007) 35:45–53Crossref, Google Scholar
- A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks (1997) 30:105–119Crossref, Google Scholar
- , Barnhart C., Laporte G. Vehicle routing. Handbooks in Operations Research and Management Science (2007) 14(Elsevier, Amsterdam) 367–428Google Scholar
- The multi-depot vehicle routing problem with inter-depot routes. Eur. J. Oper. Res. (2007) 176:756–773Crossref, Google Scholar
- Future paths for integer programming and links to artificial intelligence. Comput Oper. Res. (1986) 13:533–549Crossref, Google Scholar
- Waste collection vehicle routing problem with time windows. Comput Oper. Res. (2006) 33:3624–3642Crossref, Google Scholar
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Comput Oper. Res. (2007) 34:2964–2975Crossref, Google Scholar
- Variable neighbourhood search. Comput Oper. Res. (1997) 24:1097–1100Crossref, Google Scholar
- The savings algorithm for the vehicle routing problem. Eur. J. Oper. Res. (1988) 34:336–344Crossref, Google Scholar
- A survey of models and algorithms for winter road maintenance. Part III: Vehicle routing and depot location for spreading. Comp. Oper. Res. (2007) 34:211–257Crossref, Google Scholar
- Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics (1995) 1:147–167Crossref, Google Scholar
- Solving the vehicle routing problem with adaptive memory programming methodology. Comput Oper. Res. (2005) 32:2309–2327Crossref, Google Scholar
- Partial constraint satisfaction problems and guided local search. Proc. 2nd Internat. Conf. Practical Appl. Constraint Tech. (PACT'96) (1996) London:337–356Google Scholar

