IDEAS home Printed from https://ideas.repec.org/a/inm/orited/v22y2021i1p9-27.html
   My bibliography  Save this article

Getting Beyond the First Result of Solving a Vehicle Routing Problem

Author

Listed:
  • John F. Wellington

    (Purdue University Fort Wayne, Campton, New Hampshire 03223)

  • Stephen A. Lewis

    (Purdue University Fort Wayne, Campton, New Hampshire 03223)

Abstract

The simple vehicle routing problem (VRP) is a common topic of discussion in introductory operations research/management science courses. The VRP can be framed in a variety of ways, and it can be difficult to solve to optimality. For solution purposes, introductory textbooks demonstrate how Excel’s Evolutionary Solver (ES) add-in produces a routing. The ES utilizes a genetic algorithm with a heuristic stopping rule to produce a routing that is not guaranteed to be optimal. Beyond pointing out that search controls, such as maximum execution time, may be extended and followed by restart(s) of ES, textbook treatments do not offer alternative ways to continue the search for a possibly better routing. In this paper, a suite of ways is presented in which students may investigate beyond what ES produces or any other optimality-uncertain VRP solution method. The suite includes perturbation methods and other ways that function within an Excel spreadsheet environment that is popular with students and textbook writers. Because there is no demonstrable feature that confirms optimality, the student problem Solver must settle for a ‘best found’ result as unsettling as it may be. The incertitude is addressed.

Suggested Citation

  • John F. Wellington & Stephen A. Lewis, 2021. "Getting Beyond the First Result of Solving a Vehicle Routing Problem," INFORMS Transactions on Education, INFORMS, vol. 22(1), pages 9-27, September.
    • Handle: RePEc:inm:orited:v:22:y:2021:i:1:p:9-27
    DOI: 10.1287/ited.2021.0255
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ited.2021.0255
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ited.2021.0255?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Kulkarni, R. V. & Bhave, P. R., 1985. "Integer programming formulations of vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 20(1), pages 58-67, April.
    2. Matthew J. Drake & Paul M. Griffin & Julie L. Swann, 2011. "Case Article ---Keeping Logistics Under Wraps," INFORMS Transactions on Education, INFORMS, vol. 11(2), pages 57-62, January.
    3. Ashlea Bennett Milburn & Emre Kirac & Mina Hadianniasar, 2017. "Case Article—Growing Pains: A Case Study for Large-Scale Vehicle Routing," INFORMS Transactions on Education, INFORMS, vol. 17(2), pages 81-84, January.
    4. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    5. Cliff T. Ragsdale, 2001. "Teaching Management Science with Spreadsheets: From Decision Models to Decision Support," INFORMS Transactions on Education, INFORMS, vol. 1(2), pages 68-74, January.
    6. Rick Hesse & Deborah Hesse Scerno, 2009. "How Electronic Spreadsheets Changed the World," Interfaces, INFORMS, vol. 39(2), pages 159-167, April.
    7. Murat Köksalan & F. Sibel Salman, 2003. "Beer in the Classroom: A Case Study of Location and Distribution Decisions," INFORMS Transactions on Education, INFORMS, vol. 4(1), pages 65-77, September.
    8. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
    9. Carter, Arthur E. & Ragsdale, Cliff T., 2002. "Scheduling pre-printed newspaper advertising inserts using genetic algorithms," Omega, Elsevier, vol. 30(6), pages 415-421, December.
    10. Ashlea Bennett Milburn & Emre Kirac & Mina Hadianniasar, 2017. "Case Article—Growing Pains: A Case Study for Large-Scale Vehicle Routing," INFORMS Transactions on Education, INFORMS, vol. 17(2), pages 75-80, January.
    11. Andrew J Mason, 2013. "SolverStudio: A New Tool for Better Optimisation and Simulation Modelling in Excel," INFORMS Transactions on Education, INFORMS, vol. 14(1), pages 45-52, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ashlea Bennett Milburn & Emre Kirac & Mina Hadianniasar, 2017. "Case Article—Growing Pains: A Case Study for Large-Scale Vehicle Routing," INFORMS Transactions on Education, INFORMS, vol. 17(2), pages 75-80, January.
    2. Sanjay Choudhari & Saurabh Chandra, 2022. "Case Article—Route Planning at an Animal Husbandry Department," INFORMS Transactions on Education, INFORMS, vol. 23(1), pages 35-40, September.
    3. Rahma Lahyani & Leandro C. Coelho & Jacques Renaud, 2018. "Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(1), pages 125-157, January.
    4. Muren, & Wu, Jianjun & Zhou, Li & Du, Zhiping & Lv, Ying, 2019. "Mixed steepest descent algorithm for the traveling salesman problem and application in air logistics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 87-102.
    5. Frey, Christian M.M. & Jungwirth, Alexander & Frey, Markus & Kolisch, Rainer, 2023. "The vehicle routing problem with time windows and flexible delivery locations," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1142-1159.
    6. Bektas, Tolga, 2006. "The multiple traveling salesman problem: an overview of formulations and solution procedures," Omega, Elsevier, vol. 34(3), pages 209-219, June.
    7. Allahyari, Somayeh & Salari, Majid & Vigo, Daniele, 2015. "A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 242(3), pages 756-768.
    8. D. G. N. D. Jayarathna & G. H. J. Lanel & Z. A. M. S. Juman, 2022. "Industrial vehicle routing problem: a case study," Journal of Shipping and Trade, Springer, vol. 7(1), pages 1-27, December.
    9. Saurabh Chandra & Amit Kumar Vatsa, 2021. "Case Article—Coastal Shipping for Automobile Distribution," INFORMS Transactions on Education, INFORMS, vol. 22(1), pages 28-34, September.
    10. Chrysanthos E. Gounaris & Wolfram Wiesemann & Christodoulos A. Floudas, 2013. "The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty," Operations Research, INFORMS, vol. 61(3), pages 677-693, June.
    11. Jesica de Armas & Jessica Rodríguez-Pereira & Bruno Vieira & Helena Ramalhinho, 2021. "Optimizing Assistive Technology Operations for Aging Populations," Sustainability, MDPI, vol. 13(12), pages 1-27, June.
    12. Tino Henke & M. Grazia Speranza & Gerhard Wäscher, 2019. "A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes," Annals of Operations Research, Springer, vol. 275(2), pages 321-338, April.
    13. Bonet Filella, Guillem & Trivella, Alessio & Corman, Francesco, 2023. "Modeling soft unloading constraints in the multi-drop container loading problem," European Journal of Operational Research, Elsevier, vol. 308(1), pages 336-352.
    14. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    15. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    16. A. Mor & M. G. Speranza, 2020. "Vehicle routing problems over time: a survey," 4OR, Springer, vol. 18(2), pages 129-149, June.
    17. Chiang, Wen-Chyuan & Russell, Robert & Xu, Xiaojing & Zepeda, David, 2009. "A simulation/metaheuristic approach to newspaper production and distribution supply chain problems," International Journal of Production Economics, Elsevier, vol. 121(2), pages 752-767, October.
    18. Coelho, V.N. & Grasas, A. & Ramalhinho, H. & Coelho, I.M. & Souza, M.J.F. & Cruz, R.C., 2016. "An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints," European Journal of Operational Research, Elsevier, vol. 250(2), pages 367-376.
    19. Li, Hongqi & Zhang, Lu & Lv, Tan & Chang, Xinyu, 2016. "The two-echelon time-constrained vehicle routing problem in linehaul-delivery systems," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 169-188.
    20. Yue Lu & Maoxiang Lang & Xueqiao Yu & Shiqi Li, 2019. "A Sustainable Multimodal Transport System: The Two-Echelon Location-Routing Problem with Consolidation in the Euro–China Expressway," Sustainability, MDPI, vol. 11(19), pages 1-25, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orited:v:22:y:2021:i:1:p:9-27. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.