IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v34y1988i3p336-344.html
   My bibliography  Save this item

The savings algorithm for the vehicle routing problem

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Haughton, Michael A., 1998. "The performance of route modification and demand stabilization strategies in stochastic vehicle routing," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 551-566, November.
  2. Javier Faulin & Pablo Sarobe & Jorge Simal, 2005. "The DSS LOGDIS Optimizes Delivery Routes for FRILAC’s Frozen Products," Interfaces, INFORMS, vol. 35(3), pages 202-214, June.
  3. Rieck, Julia, 2011. "Ein Framework fu?r die Gestaltung grosser, internationaler Transportnetze: Beru?cksichtigung von Netzwerkdesign und Tourenbildung," Die Unternehmung - Swiss Journal of Business Research and Practice, Nomos Verlagsgesellschaft mbH & Co. KG, vol. 65(2), pages 133-150.
  4. Hughes, Michael S. & Lunday, Brian J. & Weir, Jeffrey D. & Hopkinson, Kenneth M., 2021. "The multiple shortest path problem with path deconfliction," European Journal of Operational Research, Elsevier, vol. 292(3), pages 818-829.
  5. Tarantilis, C. D. & Diakoulaki, D. & Kiranoudis, C. T., 2004. "Combination of geographical information system and efficient routing algorithms for real life distribution operations," European Journal of Operational Research, Elsevier, vol. 152(2), pages 437-453, January.
  6. Tarantilis, C. D. & Kiranoudis, C. T. & Vassiliadis, V. S., 2004. "A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 152(1), pages 148-158, January.
  7. A A Juan & J Faulin & J Jorba & D Riera & D Masip & B Barrios, 2011. "On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(6), pages 1085-1097, June.
  8. İ K Altınel & T Öncan, 2005. "A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 954-961, August.
  9. Bernhard Fleischmann & Martin Gietz & Stefan Gnutzmann, 2004. "Time-Varying Travel Times in Vehicle Routing," Transportation Science, INFORMS, vol. 38(2), pages 160-173, May.
  10. T Doyuran & B Çatay, 2011. "A robust enhancement to the Clarke–Wright savings algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 223-231, January.
  11. M Battarra & B Golden & D Vigo, 2008. "Tuning a parametric Clarke–Wright heuristic via a genetic algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1568-1572, November.
  12. Park, Junhyuk & Kim, Byung-In, 2010. "The school bus routing problem: A review," European Journal of Operational Research, Elsevier, vol. 202(2), pages 311-319, April.
  13. Martin Schwardt & Kathrin Fischer, 2009. "Combined location-routing problems—a neural network approach," Annals of Operations Research, Springer, vol. 167(1), pages 253-269, March.
  14. N. R. Achuthan & L. Caccetta & S. P. Hill, 2003. "An Improved Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem," Transportation Science, INFORMS, vol. 37(2), pages 153-169, May.
  15. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
  16. M. Kritikos & G. Ioannou, 2017. "A greedy heuristic for the capacitated minimum spanning tree problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(10), pages 1223-1235, October.
  17. C D Tarantilis & C T Kiranoudis & V S Vassiliadis, 2003. "A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(1), pages 65-71, January.
  18. T Öncan & İ K Altınel, 2009. "Parametric enhancements of the Esau–Williams heuristic for the capacitated minimum spanning tree problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 259-267, February.
  19. Loske, Dominic & Klumpp, Matthias, 2021. "Human-AI collaboration in route planning: An empirical efficiency-based analysis in retail logistics," International Journal of Production Economics, Elsevier, vol. 241(C).
  20. A Corominas & A García-Villoria & R Pastor, 2010. "Fine-tuning a parametric Clarke and Wright heuristic by means of EAGH (empirically adjusted greedy heuristics)," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(8), pages 1309-1314, August.
  21. Vigo, Daniele, 1996. "A heuristic algorithm for the asymmetric capacitated vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 89(1), pages 108-126, February.
  22. Wadi Khalid Anuar & Lai Soon Lee & Hsin-Vonn Seow & Stefan Pickl, 2022. "A Multi-Depot Dynamic Vehicle Routing Problem with Stochastic Road Capacity: An MDP Model and Dynamic Policy for Post-Decision State Rollout Algorithm in Reinforcement Learning," Mathematics, MDPI, vol. 10(15), pages 1-70, July.
  23. Zachariadis, Emmanouil E. & Tarantilis, Christos D. & Kiranoudis, Chris T., 2010. "An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries," European Journal of Operational Research, Elsevier, vol. 202(2), pages 401-411, April.
  24. Chiang, Wen-Chyuan & Russell, Robert A., 2004. "Integrating purchasing and routing in a propane gas supply chain," European Journal of Operational Research, Elsevier, vol. 154(3), pages 710-729, May.
  25. Christos D. Tarantilis & Emmanouil E. Zachariadis & Chris T. Kiranoudis, 2008. "A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities," INFORMS Journal on Computing, INFORMS, vol. 20(1), pages 154-168, February.
  26. Quirion-Blais, Olivier & Chen, Lu, 2021. "A case-based reasoning approach to solve the vehicle routing problem with time windows and drivers’ experience," Omega, Elsevier, vol. 102(C).
  27. Tarantilis, C.D. & Kiranoudis, C.T., 2007. "A flexible adaptive memory-based algorithm for real-life transportation operations: Two case studies from dairy and construction sector," European Journal of Operational Research, Elsevier, vol. 179(3), pages 806-822, June.
  28. Van Breedam, Alex, 2002. "A parametric analysis of heuristics for the vehicle routing problem with side-constraints," European Journal of Operational Research, Elsevier, vol. 137(2), pages 348-370, March.
  29. Rui Yan & Haotong Tian & Kaiye Gao & Rui Peng & Bin Liu, 2023. "A two-stage UAV routing problem with time window considering rescheduling with random delivery reliability," Journal of Risk and Reliability, , vol. 237(4), pages 781-797, August.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.