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

A covering tour approach to the location of satellite distribution centers to supply humanitarian aid

Author

Listed:
  • Naji-Azimi, Z.
  • Renaud, J.
  • Ruiz, A.
  • Salari, M.

Abstract

This article concerns the location of satellite distribution centers (SDCs) to supply humanitarian aid to the affected people throughout a disaster area. In such situations, it is not possible for the relief teams to visit every single home. Instead, the people are required to go to a satellite distribution center in order to obtain survival goods, provided that these centers are not too far from their homes. The SDCs are usually within walking distance. However, these SDCs need to be supplied from a central depot, using a heterogeneous and capacitated fleet of vehicles. We model this situation as a generalization of the covering tour problem, introduce the idea of split delivery, and propose an efficient heuristic approach to solve it. Numerical experiments on randomly-generated data show that, first, only very small instances can be solved efficiently using the mathematical model and, second, our heuristic produces high-quality solutions and solves real-size instances in a reasonable computing time.

Suggested Citation

  • Naji-Azimi, Z. & Renaud, J. & Ruiz, A. & Salari, M., 2012. "A covering tour approach to the location of satellite distribution centers to supply humanitarian aid," European Journal of Operational Research, Elsevier, vol. 222(3), pages 596-605.
    • Handle: RePEc:eee:ejores:v:222:y:2012:i:3:p:596-605
    DOI: 10.1016/j.ejor.2012.05.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712003475
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2012.05.001?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. Tzeng, Gwo-Hshiung & Cheng, Hsin-Jung & Huang, Tsung Dow, 2007. "Multi-objective optimal planning for designing relief delivery systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 43(6), pages 673-686, November.
    2. Altay, Nezih & Green III, Walter G., 2006. "OR/MS research in disaster operations management," European Journal of Operational Research, Elsevier, vol. 175(1), pages 475-493, November.
    3. Moreno Perez, Jose A. & Marcos Moreno-Vega, J. & Rodriguez Martin, Inmaculada, 2003. "Variable neighborhood tabu search and its application to the median cycle problem," European Journal of Operational Research, Elsevier, vol. 151(2), pages 365-378, December.
    4. J Renaud & F F Boctor & G Laporte, 2004. "Efficient heuristics for Median Cycle Problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 179-186, February.
    5. Current, John R. & Schilling, David A., 1994. "The median tour and maximal covering tour problems: Formulations and heuristics," European Journal of Operational Research, Elsevier, vol. 73(1), pages 114-126, February.
    6. Michel Gendreau & Gilbert Laporte & Frédéric Semet, 1997. "The Covering Tour Problem," Operations Research, INFORMS, vol. 45(4), pages 568-576, August.
    7. Kara, Imdat & Laporte, Gilbert & Bektas, Tolga, 2004. "A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(3), pages 793-795, November.
    8. John R. Current & David A. Schilling, 1989. "The Covering Salesman Problem," Transportation Science, INFORMS, vol. 23(3), pages 208-213, 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. 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.
    2. Shu, Jia & Lv, Wenya & Na, Qing, 2021. "Humanitarian relief supply network design: Expander graph based approach and a case study of 2013 Flood in Northeast China," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 146(C).
    3. Masoud Mahootchi & Sajjad Golmohammadi, 2018. "Developing a new stochastic model considering bi-directional relations in a natural disaster: a possible earthquake in Tehran (the Capital of Islamic Republic of Iran)," Annals of Operations Research, Springer, vol. 269(1), pages 439-473, October.
    4. Jianfang Shao & Changyong Liang & Xihui Wang & Xiang Wang & Liang Liang, 2020. "Relief Demand Calculation in Humanitarian Logistics Using Material Classification," IJERPH, MDPI, vol. 17(2), pages 1-25, January.
    5. Katharina Glock & Anne Meyer, 2020. "Mission Planning for Emergency Rapid Mapping with Drones," Transportation Science, INFORMS, vol. 54(2), pages 534-560, March.
    6. A. Anaya-Arenas & J. Renaud & A. Ruiz, 2014. "Relief distribution networks: a systematic review," Annals of Operations Research, Springer, vol. 223(1), pages 53-79, December.
    7. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    8. Sheu, Jiuh-Biing & Pan, Cheng, 2014. "A method for designing centralized emergency supply network to respond to large-scale natural disasters," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 284-305.
    9. İbrahim Miraç Eligüzel & Eren Özceylan & Gerhard-Wilhelm Weber, 2023. "Location-allocation analysis of humanitarian distribution plans: a case of United Nations Humanitarian Response Depots," Annals of Operations Research, Springer, vol. 324(1), pages 825-854, May.
    10. Elfe Buluc & Meltem Peker & Bahar Y. Kara & Manoj Dora, 2022. "Covering vehicle routing problem: application for mobile child friendly spaces for refugees," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 461-484, June.
    11. David A. Flores-Garza & M. Angélica Salazar-Aguilar & Sandra Ulrich Ngueveu & Gilbert Laporte, 2017. "The multi-vehicle cumulative covering tour problem," Annals of Operations Research, Springer, vol. 258(2), pages 761-780, November.
    12. Rodríguez-Espíndola, Oscar & Albores, Pavel & Brewster, Christopher, 2018. "Disaster preparedness in humanitarian logistics: A collaborative approach for resource management in floods," European Journal of Operational Research, Elsevier, vol. 264(3), pages 978-993.
    13. Sachin Modgil & Rohit Kumar Singh & Cyril Foropon, 2022. "Quality management in humanitarian operations and disaster relief management: a review and future research directions," Annals of Operations Research, Springer, vol. 319(1), pages 1045-1098, December.
    14. Veenstra, Marjolein & Roodbergen, Kees Jan & Coelho, Leandro C. & Zhu, Stuart X., 2018. "A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands," European Journal of Operational Research, Elsevier, vol. 268(2), pages 703-715.
    15. Büsing, Christina & Comis, Martin & Schmidt, Eva & Streicher, Manuel, 2021. "Robust strategic planning for mobile medical units with steerable and unsteerable demands," European Journal of Operational Research, Elsevier, vol. 295(1), pages 34-50.
    16. Ali Ekici & Okan Örsan Özener, 2020. "Inventory routing for the last mile delivery of humanitarian relief supplies," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(3), pages 621-660, September.
    17. Zhou, Lin & Baldacci, Roberto & Vigo, Daniele & Wang, Xu, 2018. "A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution," European Journal of Operational Research, Elsevier, vol. 265(2), pages 765-778.
    18. Bakker, Hannah & Diehlmann, Florian & Wiens, Marcus & Nickel, Stefan & Schultmann, Frank, 2023. "School or parking lot? Selecting locations for points of distribution in urban disasters," Socio-Economic Planning Sciences, Elsevier, vol. 89(C).
    19. Christian Burkart & Pamela C. Nolz & Walter J. Gutjahr, 2017. "Modelling beneficiaries’ choice in disaster relief logistics," Annals of Operations Research, Springer, vol. 256(1), pages 41-61, September.
    20. 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.
    21. Oscar Rodríguez-Espíndola & Juan Gaytán, 2015. "Scenario-based preparedness plan for floods," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 76(2), pages 1241-1262, March.
    22. Glize, Estèle & Roberti, Roberto & Jozefowiez, Nicolas & Ngueveu, Sandra Ulrich, 2020. "Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 812-824.
    23. Pérez-Galarce, Francisco & Canales, Linda J. & Vergara, Claudio & Candia-Véjar, Alfredo, 2017. "An optimization model for the location of disaster refuges," Socio-Economic Planning Sciences, Elsevier, vol. 59(C), pages 56-66.
    24. Nikolopoulos, Konstantinos & Petropoulos, Fotios & Rodrigues, Vasco Sanchez & Pettit, Stephen & Beresford, Anthony, 2022. "A disaster response model driven by spatial–temporal forecasts," International Journal of Forecasting, Elsevier, vol. 38(3), pages 1214-1220.
    25. Esteban Ogazón & Neale R. Smith & Angel Ruiz, 2022. "Reconfiguration of Foodbank Network Logistics to Cope with a Sudden Disaster," Mathematics, MDPI, vol. 10(9), pages 1-20, April.

    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. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    2. Contreras, Ivan & Fernández, Elena, 2012. "General network design: A unified view of combined location and network design problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 680-697.
    3. 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.
    4. Elfe Buluc & Meltem Peker & Bahar Y. Kara & Manoj Dora, 2022. "Covering vehicle routing problem: application for mobile child friendly spaces for refugees," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 461-484, June.
    5. Reihaneh, Mohammad & Ghoniem, Ahmed, 2019. "A branch-and-price algorithm for a vehicle routing with demand allocation problem," European Journal of Operational Research, Elsevier, vol. 272(2), pages 523-538.
    6. L Vogt & C A Poojari & J E Beasley, 2007. "A tabu search algorithm for the single vehicle routing allocation problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 467-480, April.
    7. Glize, Estèle & Roberti, Roberto & Jozefowiez, Nicolas & Ngueveu, Sandra Ulrich, 2020. "Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 812-824.
    8. Lamb, John D., 2012. "Variable neighbourhood structures for cycle location problems," European Journal of Operational Research, Elsevier, vol. 223(1), pages 15-26.
    9. Lei, Chao & Lin, Wei-Hua & Miao, Lixin, 2014. "A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 699-710.
    10. Afsaneh Amiri & Majid Salari, 2019. "Time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 415-468, June.
    11. Eduardo Álvarez-Miranda & Markus Sinnl, 2020. "A branch-and-cut algorithm for the maximum covering cycle problem," Annals of Operations Research, Springer, vol. 284(2), pages 487-499, January.
    12. Huili Zhang & Yinfeng Xu, 2018. "Online covering salesman problem," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 941-954, April.
    13. Eda Yücel & F. Sibel Salman & Burçin Bozkaya & Cemre Gökalp, 2020. "A data-driven optimization framework for routing mobile medical facilities," Annals of Operations Research, Springer, vol. 291(1), pages 1077-1102, August.
    14. A. Anaya-Arenas & J. Renaud & A. Ruiz, 2014. "Relief distribution networks: a systematic review," Annals of Operations Research, Springer, vol. 223(1), pages 53-79, December.
    15. Liwei Zeng & Sunil Chopra & Karen Smilowitz, 2019. "The Covering Path Problem on a Grid," Transportation Science, INFORMS, vol. 53(6), pages 1656-1672, November.
    16. Lu, Chung-Cheng & Ying, Kuo-Ching & Chen, Hui-Ju, 2016. "Real-time relief distribution in the aftermath of disasters – A rolling horizon approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 1-20.
    17. Wilson, Duncan T. & Hawe, Glenn I. & Coates, Graham & Crouch, Roger S., 2013. "A multi-objective combinatorial model of casualty processing in major incident response," European Journal of Operational Research, Elsevier, vol. 230(3), pages 643-655.
    18. Ivan Contreras & Moayad Tanash & Navneet Vidyarthi, 2017. "Exact and heuristic approaches for the cycle hub location problem," Annals of Operations Research, Springer, vol. 258(2), pages 655-677, November.
    19. Renaud, Jacques & Boctor, Fayez F., 1998. "An efficient composite heuristic for the symmetric generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 108(3), pages 571-584, August.
    20. de la Torre, Luis E. & Dolinskaya, Irina S. & Smilowitz, Karen R., 2012. "Disaster relief routing: Integrating research and practice," Socio-Economic Planning Sciences, Elsevier, vol. 46(1), pages 88-97.

    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:222:y:2012:i:3:p:596-605. 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.