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

Case Article—Growing Pains: A Case Study for Large-Scale Vehicle Routing

Author

Listed:
  • Ashlea Bennett Milburn

    (Department of Industrial Engineering, University of Arkansas, Fayetteville, Arkansas 72701)

  • Emre Kirac

    (Department of Industrial Engineering, University of Arkansas, Fayetteville, Arkansas 72701)

  • Mina Hadianniasar

    (Department of Industrial Engineering, University of Arkansas, Fayetteville, Arkansas 72701)

Abstract

This is a case study focused on the quantitative modeling of transportation services for use in undergraduate and graduate level transportation and logistics or optimization courses. The problem considered in the case is a capacitated vehicle routing problem (CVRP) with additional side constraints corresponding to delivery windows and United States Department of Transportation drive and duty time regulations. The case is presented in the context of a fictional company, Northeastern Home Goods (NHG), but is based on a problem encountered by a real organization. NHG is considering outsourcing its transportation services to a firm having logistics as a core competency. Specifically, NHG wishes to evaluate the transportation costs that will result if a single distribution center is used to serve all of NHG’s current stores according to a preexisting store delivery schedule. The primary objective of the case is to provide students with hands-on experience developing and applying solution techniques for a large unstructured vehicle routing problem. Secondary objectives include requiring students to think logically through the process of creating good solutions, promoting continuous improvement, and encouraging students to consider the business implications of their recommendations.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:orited:v:17:y:2017:i:2:p:75-80
    DOI: 10.1287/ited.2016.0167ca
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/ited.2016.0167ca
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ited.2016.0167ca?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. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    2. Gail W. DePuy, 2009. "Puzzle ---Chain-Reaction: A Puzzle to Demonstrate TSP Formulation," INFORMS Transactions on Education, INFORMS, vol. 10(1), pages 41-44, September.
    3. 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.
    4. Irnich, S. & Schneider, M. & Vigo, D., 2014. "Four Variants of the Vehicle Routing Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 63514, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    5. 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.
    6. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
    7. Maria Battarra & Güneş Erdoğan & Daniele Vigo, 2014. "Exact Algorithms for the Clustered Vehicle Routing Problem," Operations Research, INFORMS, vol. 62(1), pages 58-71, February.
    8. J-F Cordeau & M Gendreau & G Laporte & J-Y Potvin & F Semet, 2002. "A guide to vehicle routing heuristics," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(5), pages 512-522, May.
    9. Billy E. Gillett & Leland R. Miller, 1974. "A Heuristic Algorithm for the Vehicle-Dispatch Problem," Operations Research, INFORMS, vol. 22(2), pages 340-349, April.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. 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.
    2. 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.
    3. Thomas C. Sharkey & Steve Bublak & Lisa Disselkamp & Brittney Shkil, 2020. "Workforce Scheduling for Airport Immigration on the Island of Tropical Paradise," INFORMS Transactions on Education, INFORMS, vol. 20(2), pages 85-89, January.

    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. Angel Juan & Javier Faulin & Albert Ferrer & Helena Lourenço & Barry Barrios, 2013. "MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 109-132, April.
    2. Fleming, Christopher L. & Griffis, Stanley E. & Bell, John E., 2013. "The effects of triangle inequality on the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 224(1), pages 1-7.
    3. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    4. 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.
    5. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
    6. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    7. Karaoğlan, İsmail & Erdoğan, Güneş & Koç, Çağrı, 2018. "The Multi-Vehicle Probabilistic Covering Tour Problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 278-287.
    8. Tânia Rodrigues Pereira Ramos & Maria Isabel Gomes & Ana Paula Barbosa-Póvoa, 2020. "A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 75-110, March.
    9. Qiuping Ni & Yuanxiang Tang, 2023. "A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research," Sustainability, MDPI, vol. 15(9), pages 1-37, April.
    10. Brandstätter, Christian & Reimann, Marc, 2018. "The Line-haul Feeder Vehicle Routing Problem: Mathematical model formulation and heuristic approaches," European Journal of Operational Research, Elsevier, vol. 270(1), pages 157-170.
    11. Niaz A. Wassan & A. Hameed Wassan & Gábor Nagy, 2008. "A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries," Journal of Combinatorial Optimization, Springer, vol. 15(4), pages 368-386, May.
    12. Gilbert Laporte, 2007. "What you should know about the vehicle routing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(8), pages 811-819, December.
    13. Liu, Ran & Jiang, Zhibin, 2012. "The close–open mixed vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 349-360.
    14. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "Thirty years of heterogeneous vehicle routing," European Journal of Operational Research, Elsevier, vol. 249(1), pages 1-21.
    15. Lai, David S.W. & Caliskan Demirag, Ozgun & Leung, Janny M.Y., 2016. "A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 86(C), pages 32-52.
    16. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms," Transportation Science, INFORMS, vol. 39(1), pages 104-118, February.
    17. U Derigs & K Reuter, 2009. "A simple and efficient tabu search heuristic for solving the open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1658-1669, December.
    18. Gong, Manlin & Hu, Yucong & Chen, Zhiwei & Li, Xiaopeng, 2021. "Transfer-based customized modular bus system design with passenger-route assignment optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    19. 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.
    20. Forma, Iris A. & Raviv, Tal & Tzur, Michal, 2015. "A 3-step math heuristic for the static repositioning problem in bike-sharing systems," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 230-247.

    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:17:y:2017:i:2:p:75-80. 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.