IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v62y2011i4d10.1057_jors.2010.19.html
   My bibliography  Save this article

Disruption management of the vehicle routing problem with vehicle breakdown

Author

Listed:
  • Q Mu

    (Lancaster University Management School)

  • Z Fu

    (Central South University)

  • J Lysgaard

    (Aarhus School of Business, Aarhus University)

  • R Eglese

    (Lancaster University Management School)

Abstract

This paper introduces a new class of problem, the disrupted vehicle routing problem (VRP), which deals with the disruptions that occur at the execution stage of a VRP plan. The paper then focuses on one type of such problem, in which a vehicle breaks down during the delivery and a new routing solution needs to be quickly generated to minimise the costs. Two Tabu Search algorithms are developed to solve the problem and are assessed in relation to an exact algorithm. A set of test problems has been generated and computational results from experiments using the heuristic algorithms are presented.

Suggested Citation

  • Q Mu & Z Fu & J Lysgaard & R Eglese, 2011. "Disruption management of the vehicle routing problem with vehicle breakdown," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 742-749, April.
    • Handle: RePEc:pal:jorsoc:v:62:y:2011:i:4:d:10.1057_jors.2010.19
    DOI: 10.1057/jors.2010.19
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/jors.2010.19
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/jors.2010.19?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jian Yang & Xiangtong Qi & Gang Yu, 2005. "Disruption management in production planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(5), pages 420-442, August.
    2. G Zhu & J F Bard & G Yu, 2005. "Disruption management for resource-constrained project scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 365-381, April.
    3. Dimitris J. Bertsimas & David Simchi-Levi, 1996. "A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty," Operations Research, INFORMS, vol. 44(2), pages 286-304, April.
    4. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    5. Nicholas G. Hall & Chris N. Potts, 2004. "Rescheduling for New Orders," Operations Research, INFORMS, vol. 52(3), pages 440-453, June.
    6. Ghiani, Gianpaolo & Guerriero, Francesca & Laporte, Gilbert & Musmanno, Roberto, 2003. "Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies," European Journal of Operational Research, Elsevier, vol. 151(1), pages 1-11, November.
    7. Michel Gendreau & Alain Hertz & Gilbert Laporte, 1994. "A Tabu Search Heuristic for the Vehicle Routing Problem," Management Science, INFORMS, vol. 40(10), pages 1276-1290, October.
    8. Akturk, M. Selim & Gorgulu, Elif, 1999. "Match-up scheduling under a machine breakdown," European Journal of Operational Research, Elsevier, vol. 112(1), pages 81-97, January.
    9. Li, Jing-Quan & Mirchandani, Pitu B. & Borenstein, Denis, 2009. "Real-time vehicle rerouting problems with time windows," European Journal of Operational Research, Elsevier, vol. 194(3), pages 711-727, May.
    10. Jerzy Filar & Prabhu Manyem & Kevin White, 2001. "How Airlines and Airports Recover from Schedule Perturbations: A Survey," Annals of Operations Research, Springer, vol. 108(1), pages 315-333, November.
    11. A N Letchford & J Lysgaard & R W Eglese, 2007. "A branch-and-cut algorithm for the capacitated open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1642-1651, December.
    12. Marshall L. Fisher, 1994. "Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees," Operations Research, INFORMS, vol. 42(4), pages 626-642, August.
    13. Qi, Xiangtong & Bard, Jonathan F. & Yu, Gang, 2004. "Supply chain coordination with demand disruptions," Omega, Elsevier, vol. 32(4), pages 301-312, August.
    14. Tiaojun Xiao & Gang Yu & Zhaohan Sheng & Yusen Xia, 2005. "Coordination of a Supply Chain with One-Manufacturer and Two-Retailers Under Demand Promotion and Disruption Management Decisions," Annals of Operations Research, Springer, vol. 135(1), pages 87-109, March.
    15. Li, Jing-Quan & Mirchandani, Pitu B. & Borenstein, Denis, 2009. "A Lagrangian heuristic for the real-time vehicle rescheduling problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(3), pages 419-433, May.
    16. Z Fu & R Eglese & L Y O Li, 2005. "A new tabu search heuristic for the open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(3), pages 267-274, March.
    17. Z Fu & R Eglese & L Y O Li, 2006. "Erratum: A new tabu search heuristic for the open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(8), pages 1018-1018, August.
    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. Yangkun Xia & Zhuo Fu & Sang-Bing Tsai & Jiangtao Wang, 2018. "A New TS Algorithm for Solving Low-Carbon Logistics Vehicle Routing Problem with Split Deliveries by Backpack—From a Green Operation Perspective," IJERPH, MDPI, vol. 15(5), pages 1-12, May.
    2. Ji, Chenlu & Mandania, Rupal & Liu, Jiyin & Liret, Anne, 2022. "Scheduling on-site service deliveries to minimise the risk of missing appointment times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    3. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
    4. Junhu Ruan & Felix T. S. Chan & Xiaofeng Zhao, 2018. "Re-Planning the Intermodal Transportation of Emergency Medical Supplies with Updated Transfer Centers," Sustainability, MDPI, vol. 10(8), pages 1-20, August.
    5. Michael Bortlik & Bernd Heinrich & Michael Mayer, 2018. "Multi User Context-Aware Service Selection for Mobile Environments," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 60(5), pages 415-430, October.
    6. Briseida Sarasola & Karl F. Doerner & Verena Schmid & Enrique Alba, 2016. "Variable neighborhood search for the stochastic and dynamic vehicle routing problem," Annals of Operations Research, Springer, vol. 236(2), pages 425-461, January.
    7. Richard Eglese & Sofoclis Zambirinis, 2018. "Disruption management in vehicle routing and scheduling for road freight transport: a review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(1), pages 1-17, April.
    8. Yangkun Xia & Zhuo Fu & Lijun Pan & Fenghua Duan, 2018. "Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order," PLOS ONE, Public Library of Science, vol. 13(5), pages 1-19, May.
    9. G. Dikas & I. Minis & K. Mamassis, 2016. "Single vehicle routing with predefined client sequence and multiple warehouse returns: the case of two warehouses," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 24(3), pages 709-730, September.
    10. Jafarian, Ahmad & Asgari, Nasrin & Mohri, Seyed Sina & Fatemi-Sadr, Elham & Farahani, Reza Zanjirani, 2019. "The inventory-routing problem subject to vehicle failure," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 254-294.
    11. Aderemi Oluyinka Adewumi & Olawale Joshua Adeleke, 2018. "A survey of recent advances in vehicle routing problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 155-172, February.
    12. Ozbaygin, Gizem & Savelsbergh, Martin, 2019. "An iterative re-optimization framework for the dynamic vehicle routing problem with roaming delivery locations," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 207-235.
    13. Briseida Sarasola & Karl Doerner & Verena Schmid & Enrique Alba, 2016. "Variable neighborhood search for the stochastic and dynamic vehicle routing problem," Annals of Operations Research, Springer, vol. 236(2), pages 425-461, January.
    14. Sahitya Elluru & Hardik Gupta & Harpreet Kaur & Surya Prakash Singh, 2019. "Proactive and reactive models for disaster resilient supply chain," Annals of Operations Research, Springer, vol. 283(1), pages 199-224, December.
    15. Chen, Li-Ming & Chang, Wei-Lun, 2021. "Supply- and cyber-related disruptions in cloud supply chain firms: Determining the best recovery speeds," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 151(C).

    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. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
    2. Aderemi Oluyinka Adewumi & Olawale Joshua Adeleke, 2018. "A survey of recent advances in vehicle routing problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 155-172, February.
    3. Z Fu & R Eglese & L Y O Li, 2008. "A unified tabu search algorithm for vehicle routing problems with soft time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 663-673, May.
    4. Junhu Ruan & Felix T. S. Chan & Xiaofeng Zhao, 2018. "Re-Planning the Intermodal Transportation of Emergency Medical Supplies with Updated Transfer Centers," Sustainability, MDPI, vol. 10(8), pages 1-20, August.
    5. Chen Li & Xiangtong Qi & Chung-Yee Lee, 2015. "Disruption Recovery for a Vessel in Liner Shipping," Transportation Science, INFORMS, vol. 49(4), pages 900-921, November.
    6. Atefi, Reza & Salari, Majid & C. Coelho, Leandro & Renaud, Jacques, 2018. "The open vehicle routing problem with decoupling points," European Journal of Operational Research, Elsevier, vol. 265(1), pages 316-327.
    7. Qi, Xiangtong & Bard, Jonathan F. & Yu, Gang, 2006. "Disruption management for machine scheduling: The case of SPT schedules," International Journal of Production Economics, Elsevier, vol. 103(1), pages 166-184, September.
    8. Fleszar, Krzysztof & Osman, Ibrahim H. & Hindi, Khalil S., 2009. "A variable neighbourhood search algorithm for the open vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 803-809, June.
    9. Li, Jing-Quan & Mirchandani, Pitu B. & Borenstein, Denis, 2009. "Real-time vehicle rerouting problems with time windows," European Journal of Operational Research, Elsevier, vol. 194(3), pages 711-727, May.
    10. Han, Xiaohua & Wu, Haiyan & Yang, Qianxia & Shang, Jennifer, 2016. "Reverse channel selection under remanufacturing risks: Balancing profitability and robustness," International Journal of Production Economics, Elsevier, vol. 182(C), pages 63-72.
    11. César Rego, 1998. "A Subpath Ejection Method for the Vehicle Routing Problem," Management Science, INFORMS, vol. 44(10), pages 1447-1459, October.
    12. R. Baldacci & E. Hadjiconstantinou & A. Mingozzi, 2004. "An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation," Operations Research, INFORMS, vol. 52(5), pages 723-738, October.
    13. Müller, Juliane, 2010. "Approximative solutions to the bicriterion Vehicle Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 202(1), pages 223-231, April.
    14. Chen, Kebing & Xiao, Tiaojun, 2009. "Demand disruption and coordination of the supply chain with a dominant retailer," European Journal of Operational Research, Elsevier, vol. 197(1), pages 225-234, August.
    15. Yin, Yunqiang & Li, Dongwei & Wang, Dujuan & Ignatius, Joshua & Cheng, T.C.E. & Wang, Sutong, 2023. "A branch-and-price-and-cut algorithm for the truck-based drone delivery routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1125-1144.
    16. Jingfu Huang & Gaoke Wu & Yiju Wang, 2021. "Retailer’s Emergency Ordering Policy When Facing an Impending Supply Disruption," Sustainability, MDPI, vol. 13(13), pages 1-21, June.
    17. Olli Bräysy & Michel Gendreau, 2002. "Tabu Search heuristics for the Vehicle Routing Problem with Time Windows," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 10(2), pages 211-237, December.
    18. Paraskevopoulos, Dimitris C. & Laporte, Gilbert & Repoussis, Panagiotis P. & Tarantilis, Christos D., 2017. "Resource constrained routing and scheduling: Review and research prospects," European Journal of Operational Research, Elsevier, vol. 263(3), pages 737-754.
    19. 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.
    20. Ji, Xiang & Sun, Jiasen & Wang, Zebin, 2017. "Turn bad into good: Using transshipment-before-buyback for disruptions of stochastic demand," International Journal of Production Economics, Elsevier, vol. 185(C), pages 150-161.

    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:pal:jorsoc:v:62:y:2011:i:4:d:10.1057_jors.2010.19. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.