IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v285y2020i2p712-727.html
   My bibliography  Save this article

The median routing problem for simultaneous planning of emergency response and non-emergency jobs

Author

Listed:
  • Huizing, Dylan
  • Schäfer, Guido
  • van der Mei, Rob D.
  • Bhulai, Sandjai

Abstract

This paper studies a setting in emergency logistics where emergency responders must also perform a set of known, non-emergency jobs in the network when there are no active emergencies going on. These jobs typically have a preventive function, and allow the responders to use their idle time much more productively than in the current standard. When an emergency occurs, the nearest responder must abandon whatever job he or she is doing and go to the emergency. This leads to the optimisation problem of timetabling jobs and moving responders over a discrete network such that the expected emergency response time remains minimal. Our model, the Median Routing Problem, addresses this complex problem by minimising the expected response time to the next emergency and allowing for re-solving after this. We describe a mixed-integer linear program and a number of increasingly refined heuristics for this problem. We created a large set of benchmark instances, both from real-life case study data and from a generator. On the real-life case study instances, the best performing heuristic finds on average a solution only 3.4% away from optimal in a few seconds. We propose an explanation for the success of this heuristic, with the most pivotal conclusion being the importance of solving the underlying p-Medians Problem.

Suggested Citation

  • Huizing, Dylan & Schäfer, Guido & van der Mei, Rob D. & Bhulai, Sandjai, 2020. "The median routing problem for simultaneous planning of emergency response and non-emergency jobs," European Journal of Operational Research, Elsevier, vol. 285(2), pages 712-727.
    • Handle: RePEc:eee:ejores:v:285:y:2020:i:2:p:712-727
    DOI: 10.1016/j.ejor.2020.02.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722172030120X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2020.02.002?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. P. L. van den Berg & J. T. van Essen, 2019. "Scheduling Non-Urgent Patient Transportation While Maximizing Emergency Coverage," Transportation Science, INFORMS, vol. 53(2), pages 492-509, March.
    2. 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.
    3. Ram Gopalan & Kalyan T. Talluri, 1998. "The Aircraft Maintenance Routing Problem," Operations Research, INFORMS, vol. 46(2), pages 260-271, April.
    4. López-Santana, Eduyn & Akhavan-Tabatabaei, Raha & Dieulle, Laurence & Labadie, Nacima & Medaglia, Andrés L., 2016. "On the combined maintenance and routing optimization problem," Reliability Engineering and System Safety, Elsevier, vol. 145(C), pages 199-214.
    5. Kalyan T. Talluri, 1998. "The Four-Day Aircraft Maintenance Routing Problem," Transportation Science, INFORMS, vol. 32(1), pages 43-53, February.
    6. Brotcorne, Luce & Laporte, Gilbert & Semet, Frederic, 2003. "Ambulance location and relocation models," European Journal of Operational Research, Elsevier, vol. 147(3), pages 451-463, June.
    7. Dimitris J. Bertsimas & Garrett van Ryzin, 1993. "Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles," Operations Research, INFORMS, vol. 41(1), pages 60-76, February.
    8. Almoustafa, Samira & Hanafi, Said & Mladenović, Nenad, 2013. "New exact method for large asymmetric distance-constrained vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 226(3), pages 386-394.
    9. Donald R. Plane & Thomas E. Hendrick, 1977. "Mathematical Programming and the Location of Fire Companies for the Denver Fire Department," Operations Research, INFORMS, vol. 25(4), pages 563-578, August.
    10. Amy Mainville Cohn & Cynthia Barnhart, 2003. "Improving Crew Scheduling by Incorporating Key Maintenance Routing Decisions," Operations Research, INFORMS, vol. 51(3), pages 387-396, June.
    11. Justin C. Goodson & Jeffrey W. Ohlmann & Barrett W. Thomas, 2013. "Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits," Operations Research, INFORMS, vol. 61(1), pages 138-154, February.
    12. Owen, Susan Hesse & Daskin, Mark S., 1998. "Strategic facility location: A review," European Journal of Operational Research, Elsevier, vol. 111(3), pages 423-447, December.
    13. Sarac, Abdulkadir & Batta, Rajan & Rump, Christopher M., 2006. "A branch-and-price approach for operational aircraft maintenance routing," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1850-1869, December.
    14. Raghavan, S. & Sahin, Mustafa & Salman, F. Sibel, 2019. "The capacitated mobile facility location problem," European Journal of Operational Research, Elsevier, vol. 277(2), pages 507-520.
    15. Gábor Maróti & Leo Kroon, 2005. "Maintenance Routing for Train Units: The Transition Model," Transportation Science, INFORMS, vol. 39(4), pages 518-525, November.
    16. John E. Fontecha & Oscar O. Guaje & Daniel Duque & Raha Akhavan-Tabatabaei & Juan P. Rodríguez & Andrés L. Medaglia, 2020. "Combined maintenance and routing optimization for large-scale sewage cleaning," Annals of Operations Research, Springer, vol. 286(1), pages 441-474, March.
    17. Başdere, Mehmet & Bilge, Ümit, 2014. "Operational aircraft maintenance routing problem with remaining time consideration," European Journal of Operational Research, Elsevier, vol. 235(1), pages 315-328.
    18. Zhang, Shu & Ohlmann, Jeffrey W. & Thomas, Barrett W., 2014. "A priori orienteering with time windows and stochastic wait times at customers," European Journal of Operational Research, Elsevier, vol. 239(1), pages 70-79.
    19. H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
    20. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    21. Caunhye, Aakil M. & Nie, Xiaofeng & Pokharel, Shaligram, 2012. "Optimization models in emergency logistics: A literature review," Socio-Economic Planning Sciences, Elsevier, vol. 46(1), pages 4-13.
    22. Irawan, Chandra Ade & Ouelhadj, Djamila & Jones, Dylan & Stålhane, Magnus & Sperstad, Iver Bakken, 2017. "Optimisation of maintenance routing and scheduling for offshore wind farms," European Journal of Operational Research, Elsevier, vol. 256(1), pages 76-89.
    23. Soumia Ichoua & Michel Gendreau & Jean-Yves Potvin, 2000. "Diversion Issues in Real-Time Vehicle Dispatching," Transportation Science, INFORMS, vol. 34(4), pages 426-438, November.
    24. Mark S. Daskin & Kayse Lee Maass, 2015. "The p-Median Problem," Springer Books, in: Gilbert Laporte & Stefan Nickel & Francisco Saldanha da Gama (ed.), Location Science, edition 127, chapter 0, pages 21-45, Springer.
    25. Patrick Jaillet & Jonathan F. Bard & Liu Huang & Moshe Dror, 2002. "Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework," Transportation Science, INFORMS, vol. 36(3), pages 292-300, August.
    26. Laporte, Gilbert, 1992. "The vehicle routing problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(3), pages 345-358, June.
    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. Safaei, Nima & Jardine, Andrew K.S., 2018. "Aircraft routing with generalized maintenance constraints," Omega, Elsevier, vol. 80(C), pages 111-122.
    2. John E. Fontecha & Oscar O. Guaje & Daniel Duque & Raha Akhavan-Tabatabaei & Juan P. Rodríguez & Andrés L. Medaglia, 2020. "Combined maintenance and routing optimization for large-scale sewage cleaning," Annals of Operations Research, Springer, vol. 286(1), pages 441-474, March.
    3. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    4. Tönissen, D.D. & Arts, J.J., 2020. "The stochastic maintenance location routing allocation problem for rolling stock," International Journal of Production Economics, Elsevier, vol. 230(C).
    5. Denise D. Tönissen & Joachim J. Arts & Zuo-Jun (Max) Shen, 2019. "Maintenance Location Routing for Rolling Stock Under Line and Fleet Planning Uncertainty," Transportation Science, INFORMS, vol. 53(5), pages 1252-1270, September.
    6. Shaukat, Syed & Katscher, Mathias & Wu, Cheng-Lung & Delgado, Felipe & Larrain, Homero, 2020. "Aircraft line maintenance scheduling and optimisation," Journal of Air Transport Management, Elsevier, vol. 89(C).
    7. Sanchez, David Torres & Boyacı, Burak & Zografos, Konstantinos G., 2020. "An optimisation framework for airline fleet maintenance scheduling with tail assignment considerations," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 142-164.
    8. Liang, Zhe & Feng, Yuan & Zhang, Xiaoning & Wu, Tao & Chaovalitwongse, Wanpracha Art, 2015. "Robust weekly aircraft maintenance routing problem and the extension to the tail assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 238-259.
    9. Eltoukhy, Abdelrahman E.E. & Wang, Z.X. & Chan, Felix T.S. & Fu, X., 2019. "Data analytics in managing aircraft routing and maintenance staffing with price competition by a Stackelberg-Nash game model," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 122(C), pages 143-168.
    10. Başdere, Mehmet & Bilge, Ümit, 2014. "Operational aircraft maintenance routing problem with remaining time consideration," European Journal of Operational Research, Elsevier, vol. 235(1), pages 315-328.
    11. Mohamed Haouari & Shengzhi Shao & Hanif D. Sherali, 2013. "A Lifted Compact Formulation for the Daily Aircraft Maintenance Routing Problem," Transportation Science, INFORMS, vol. 47(4), pages 508-525, November.
    12. Gopalan, Ram, 2014. "The Aircraft Maintenance Base Location Problem," European Journal of Operational Research, Elsevier, vol. 236(2), pages 634-642.
    13. Zhe Liang & Wanpracha Art Chaovalitwongse & Huei Chuen Huang & Ellis L. Johnson, 2011. "On a New Rotation Tour Network Model for Aircraft Maintenance Routing Problem," Transportation Science, INFORMS, vol. 45(1), pages 109-120, February.
    14. Hanif D. Sherali & Ki-Hwan Bae & Mohamed Haouari, 2013. "An Integrated Approach for Airline Flight Selection and Timing, Fleet Assignment, and Aircraft Routing," Transportation Science, INFORMS, vol. 47(4), pages 455-476, November.
    15. Maher, Stephen J. & Desaulniers, Guy & Soumis, François, 2018. "The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints," European Journal of Operational Research, Elsevier, vol. 264(2), pages 534-547.
    16. Zhe Liang & Wanpracha Art Chaovalitwongse, 2013. "A Network-Based Model for the Integrated Weekly Aircraft Maintenance Routing and Fleet Assignment Problem," Transportation Science, INFORMS, vol. 47(4), pages 493-507, November.
    17. Lapp, Marcial & Wikenhauser, Florian, 2012. "Incorporating aircraft efficiency measures into the tail assignment problem," Journal of Air Transport Management, Elsevier, vol. 19(C), pages 25-30.
    18. Baris Yildiz & Martin Savelsbergh, 2019. "Provably High-Quality Solutions for the Meal Delivery Routing Problem," Transportation Science, INFORMS, vol. 53(5), pages 1372-1388, September.
    19. 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.
    20. Marlin W. Ulmer & Dirk C. Mattfeld & Felix Köster, 2018. "Budgeting Time for Dynamic Vehicle Routing with Stochastic Customer Requests," Transportation Science, INFORMS, vol. 52(1), pages 20-37, January.

    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:eee:ejores:v:285:y:2020:i:2:p:712-727. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.