IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v14y2022i5p3024-d764331.html
   My bibliography  Save this article

A Bi-Objective Field-Visit Planning Problem for Rapid Needs Assessment under Travel-Time Uncertainty

Author

Listed:
  • Mohammadmehdi Hakimifar

    (Department of Global Business and Trade, Vienna University of Economics and Business, 1020 Vienna, Austria)

  • Vera C. Hemmelmayr

    (Department of Global Business and Trade, Vienna University of Economics and Business, 1020 Vienna, Austria)

  • Fabien Tricoire

    (Department of Global Business and Trade, Vienna University of Economics and Business, 1020 Vienna, Austria)

Abstract

After a sudden-onset disaster strikes, relief agencies usually dispatch assessment teams to the affected region to quickly investigate the impacts of the disaster on the affected communities. Within this process, assessment teams should compromise between the two conflicting objectives of a “faster” assessment, which covers the needs of fewer community groups, and a “better” assessment, i.e., covering more community groups over a longer time. Moreover, due to the possible effect of the disaster on the transportation network, assessment teams need to make their field-visit planning decisions under travel-time uncertainty. This study considers the two objectives of minimizing the total route duration and maximizing the coverage ratio of community groups, as well as the uncertainty of travel times, during the rapid needs assessment stage. In particular, within our bi-objective solution approach, we provide the set of non-dominated solutions that differ in terms of total route duration and the vector of community coverage ratio at different levels of travel-time uncertainty. Moreover, we provide an in-depth analysis of the amount of violation of maximum allowed time for decision makers to see the trade-offs between infeasibility and solution quality. We apply the robust optimization approach to tackle travel-time uncertainty due to its advantages in requiring fewer data for uncertain parameters and immunizing a feasible solution under all possible realizations.

Suggested Citation

  • Mohammadmehdi Hakimifar & Vera C. Hemmelmayr & Fabien Tricoire, 2022. "A Bi-Objective Field-Visit Planning Problem for Rapid Needs Assessment under Travel-Time Uncertainty," Sustainability, MDPI, vol. 14(5), pages 1-16, March.
  • Handle: RePEc:gam:jsusta:v:14:y:2022:i:5:p:3024-:d:764331
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/14/5/3024/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/14/5/3024/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Lehuédé, Fabien & Péton, Olivier & Tricoire, Fabien, 2020. "A lexicographic minimax approach to the vehicle routing problem with route balancing," European Journal of Operational Research, Elsevier, vol. 282(1), pages 129-147.
    2. David Pisinger & Stefan Ropke, 2019. "Large Neighborhood Search," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, edition 3, chapter 0, pages 99-127, Springer.
    3. Bruni, M.E. & Khodaparasti, S. & Beraldi, P., 2020. "The selective minimum latency problem under travel time variability: An application to post-disaster assessment operations," Omega, Elsevier, vol. 92(C).
    4. Erdoğan, Sevgi & Miller-Hooks, Elise, 2012. "A Green Vehicle Routing Problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 100-114.
    5. Özdamar, Linet & Ertem, Mustafa Alp, 2015. "Models, solutions and enabling technologies in humanitarian logistics," European Journal of Operational Research, Elsevier, vol. 244(1), pages 55-65.
    6. Liu, Songsong & Papageorgiou, Lazaros G., 2013. "Multiobjective optimisation of production, distribution and capacity planning of global supply chains in the process industry," Omega, Elsevier, vol. 41(2), pages 369-382.
    7. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    8. Gralla, Erica & Goentzel, Jarrod, 2018. "Humanitarian transportation planning: Evaluation of practice-based heuristics and recommendations for improvement," European Journal of Operational Research, Elsevier, vol. 269(2), pages 436-450.
    9. Sleman Saliba, 2006. "Heuristics for the lexicographic max-ordering vehicle routing problem," 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. 14(3), pages 313-336, September.
    10. Duygu Pamukcu & Burcu Balcik, 2020. "A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 1-42, March.
    11. Balcik, Burcu & Yanıkoğlu, İhsan, 2020. "A robust optimization approach for humanitarian needs assessment planning under travel time uncertainty," European Journal of Operational Research, Elsevier, vol. 282(1), pages 40-57.
    12. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "The impact of depot location, fleet composition and routing on emissions in city logistics," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 81-102.
    13. Balcik, Burcu, 2017. "Site selection and vehicle routing for post-disaster rapid needs assessment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 101(C), pages 30-58.
    14. Kimms, A. & Maiwald, M., 2018. "Bi-objective safe and resilient urban evacuation planning," European Journal of Operational Research, Elsevier, vol. 269(3), pages 1122-1136.
    15. Dritan Nace & James B. Orlin, 2007. "Lexicographically Minimum and Maximum Load Linear Programming Problems," Operations Research, INFORMS, vol. 55(1), pages 182-187, February.
    16. Ogryczak, Wlodzimierz, 1997. "On the lexicographic minimax approach to location problems," European Journal of Operational Research, Elsevier, vol. 100(3), pages 566-585, August.
    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. Mohammadmehdi Hakimifar & Vera C. Hemmelmayr & Fabien Tricoire, 2023. "A lexicographic maximin approach to the selective assessment routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(1), pages 205-249, March.
    2. Lehuédé, Fabien & Péton, Olivier & Tricoire, Fabien, 2020. "A lexicographic minimax approach to the vehicle routing problem with route balancing," European Journal of Operational Research, Elsevier, vol. 282(1), pages 129-147.
    3. Mohammadmehdi Hakimifar & Burcu Balcik & Christian Fikar & Vera Hemmelmayr & Tina Wakolbinger, 2022. "Evaluation of field visit planning heuristics during rapid needs assessment in an uncertain post-disaster environment," Annals of Operations Research, Springer, vol. 319(1), pages 517-558, December.
    4. Zhang, Guowei & Zhu, Ning & Ma, Shoufeng & Xia, Jun, 2021. "Humanitarian relief network assessment using collaborative truck-and-drone system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    5. Yichen Lu & Chao Yang & Jun Yang, 2022. "A multi-objective humanitarian pickup and delivery vehicle routing problem with drones," Annals of Operations Research, Springer, vol. 319(1), pages 291-353, December.
    6. Singh, Nitish & Dang, Quang-Vinh & Akcay, Alp & Adan, Ivo & Martagan, Tugce, 2022. "A matheuristic for AGV scheduling with battery constraints," European Journal of Operational Research, Elsevier, vol. 298(3), pages 855-873.
    7. Rodríguez-Espíndola, Oscar & Ahmadi, Hossein & Gastélum-Chavira, Diego & Ahumada-Valenzuela, Omar & Chowdhury, Soumyadeb & Dey, Prasanta Kumar & Albores, Pavel, 2023. "Humanitarian logistics optimization models: An investigation of decision-maker involvement and directions to promote implementation," Socio-Economic Planning Sciences, Elsevier, vol. 89(C).
    8. Balcik, Burcu & Yanıkoğlu, İhsan, 2020. "A robust optimization approach for humanitarian needs assessment planning under travel time uncertainty," European Journal of Operational Research, Elsevier, vol. 282(1), pages 40-57.
    9. El Mehdi, Er Raqabi & Ilyas, Himmich & Nizar, El Hachemi & Issmaïl, El Hallaoui & François, Soumis, 2023. "Incremental LNS framework for integrated production, inventory, and vessel scheduling: Application to a global supply chain," Omega, Elsevier, vol. 116(C).
    10. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    11. Raeesi, Ramin & Zografos, Konstantinos G., 2020. "The electric vehicle routing problem with time windows and synchronised mobile battery swapping," Transportation Research Part B: Methodological, Elsevier, vol. 140(C), pages 101-129.
    12. Kallestad, Jakob & Hasibi, Ramin & Hemmati, Ahmad & Sörensen, Kenneth, 2023. "A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 309(1), pages 446-468.
    13. Dumez, Dorian & Lehuédé, Fabien & Péton, Olivier, 2021. "A large neighborhood search approach to the vehicle routing problem with delivery options," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 103-132.
    14. Dukkanci, Okan & Karsu, Özlem & Kara, Bahar Y., 2022. "Planning sustainable routes: Economic, environmental and welfare concerns," European Journal of Operational Research, Elsevier, vol. 301(1), pages 110-123.
    15. Yang, Yongjian & Yin, Yunqiang & Wang, Dujuan & Ignatius, Joshua & Cheng, T.C.E. & Dhamotharan, Lalitha, 2023. "Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1042-1062.
    16. Matthias Klumpp & Dominic Loske, 2021. "Long-Term Economic Sustainability of Humanitarian Logistics—A Multi-Level and Time-Series Data Envelopment Analysis," IJERPH, MDPI, vol. 18(5), pages 1-19, February.
    17. 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.
    18. Goeke, Dominik & Schneider, Michael, 2015. "Routing a mixed fleet of electric and conventional vehicles," European Journal of Operational Research, Elsevier, vol. 245(1), pages 81-99.
    19. Abhishek Behl & Pankaj Dutta, 2019. "Humanitarian supply chain management: a thematic literature review and future directions of research," Annals of Operations Research, Springer, vol. 283(1), pages 1001-1044, December.
    20. Lorena Reyes-Rubiano & Jana Voegl & Klaus-Dieter Rest & Javier Faulin & Patrick Hirsch, 2021. "Exploration of a disrupted road network after a disaster with an online routing algorithm," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 289-326, March.

    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:gam:jsusta:v:14:y:2022:i:5:p:3024-:d:764331. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.