A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities

Published Online:https://doi.org/10.1287/ijoc.1070.0230

References

  • Amaya A., Langevin A., Trépanier M. The capacitated arc routing problem with refill points. Oper. Res. Lett. (2007) 35:45–53CrossrefGoogle Scholar
  • Cordeau J. F., Gendreau M., Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks (1997) 30:105–119CrossrefGoogle Scholar
  • Cordeau J. F., Laporte G., Savelsbergh M. W. P., Vigo D., Barnhart C., Laporte G. Vehicle routing. Handbooks in Operations Research and Management Science (2007) 14(Elsevier, Amsterdam) 367–428Google Scholar
  • Crevier B., Cordeau J. F., Laporte G. The multi-depot vehicle routing problem with inter-depot routes. Eur. J. Oper. Res. (2007) 176:756–773CrossrefGoogle Scholar
  • Glover F. Future paths for integer programming and links to artificial intelligence. Comput Oper. Res. (1986) 13:533–549CrossrefGoogle Scholar
  • Kim B.-I., Kim S., Sahoo S. Waste collection vehicle routing problem with time windows. Comput Oper. Res. (2006) 33:3624–3642CrossrefGoogle Scholar
  • Mester D., Bräysy O. Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Comput Oper. Res. (2007) 34:2964–2975CrossrefGoogle Scholar
  • Mladenović N., Hansen P. Variable neighbourhood search. Comput Oper. Res. (1997) 24:1097–1100CrossrefGoogle Scholar
  • Paessens H. The savings algorithm for the vehicle routing problem. Eur. J. Oper. Res. (1988) 34:336–344CrossrefGoogle Scholar
  • Perrier N., Langevin A., Campbell J. F. 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–257CrossrefGoogle Scholar
  • Rochat Y., Taillard É. D. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics (1995) 1:147–167CrossrefGoogle Scholar
  • Tarantilis C. D. Solving the vehicle routing problem with adaptive memory programming methodology. Comput Oper. Res. (2005) 32:2309–2327CrossrefGoogle Scholar
  • Voudouris C., Tsang E. Partial constraint satisfaction problems and guided local search. Proc. 2nd Internat. Conf. Practical Appl. Constraint Tech. (PACT'96) (1996) London:337–356Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.