Integrating logistics planning and population sampling decisions for humanitarian needs assessment
Author
Abstract
Suggested Citation
DOI: 10.1016/j.seps.2025.102204
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.References listed on IDEAS
- Archetti, Claudia & Carrabs, Francesco & Cerulli, Raffaele, 2018. "The Set Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 267(1), pages 264-272.
- Pereira Coutinho, Walton & Fliege, Jörg & Battarra, Maria, 2019. "Glider Routing and Trajectory Optimisation in disaster assessment," European Journal of Operational Research, Elsevier, vol. 274(3), pages 1138-1154.
- Nilay Noyan & Burcu Balcik & Semih Atakan, 2016. "A Stochastic Optimization Model for Designing Last Mile Relief Networks," Transportation Science, INFORMS, vol. 50(3), pages 1092-1113, August.
- 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.
- 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).
- Oruc, Buse Eylul & Kara, Bahar Yetis, 2018. "Post-disaster assessment routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 76-102.
- Morteza Keshtkaran & Koorush Ziarati & Andrea Bettinelli & Daniele Vigo, 2016. "Enhanced exact solution methods for the Team Orienteering Problem," International Journal of Production Research, Taylor & Francis Journals, vol. 54(2), pages 591-601, January.
- Lin, Shih-Wei & Yu, Vincent F., 2012. "A simulated annealing heuristic for the team orienteering problem with time windows," European Journal of Operational Research, Elsevier, vol. 217(1), pages 94-107.
- Huang, Michael & Smilowitz, Karen R. & Balcik, Burcu, 2013. "A continuous approximation approach for assessment routing in disaster relief," Transportation Research Part B: Methodological, Elsevier, vol. 50(C), pages 20-41.
- 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.
- 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.
- Chao, I-Ming & Golden, Bruce L. & Wasil, Edward A., 1996. "A fast and effective heuristic for the orienteering problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 475-489, February.
- Gendreau, Michel & Laporte, Gilbert & Semet, Frederic, 1998. "A tabu search heuristic for the undirected selective travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 539-545, April.
- Bruce L. Golden & Larry Levy & Rakesh Vohra, 1987. "The orienteering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(3), pages 307-318, June.
- 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.
- Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "Traveling Salesman Problems with Profits," Transportation Science, INFORMS, vol. 39(2), pages 188-205, May.
- Verbeeck, C. & Vansteenwegen, P. & Aghezzaf, E.-H., 2016. "Solving the stochastic time-dependent orienteering problem with time windows," European Journal of Operational Research, Elsevier, vol. 255(3), pages 699-718.
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.- Zhang, Guowei & Jia, Ning & Zhu, Ning & Adulyasak, Yossiri & Ma, Shoufeng, 2023. "Robust drone selective routing in humanitarian transportation network assessment," European Journal of Operational Research, Elsevier, vol. 305(1), pages 400-428.
- 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.
- 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.
- Gunawan, Aldy & Lau, Hoong Chuin & Vansteenwegen, Pieter, 2016. "Orienteering Problem: A survey of recent variants, solution approaches and applications," European Journal of Operational Research, Elsevier, vol. 255(2), pages 315-332.
- Rahma Lahyani & Mahdi Khemakhem & Frédéric Semet, 2017. "A unified matheuristic for solving multi-constrained traveling salesman problems with profits," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 393-422, September.
- 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.
- 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).
- 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.
- 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.
- Mei, Yi & Salim, Flora D. & Li, Xiaodong, 2016. "Efficient meta-heuristics for the Multi-Objective Time-Dependent Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 254(2), pages 443-457.
- 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.
- Bian, Zheyong & Liu, Xiang, 2018. "A real-time adjustment strategy for the operational level stochastic orienteering problem: A simulation-aided optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 115(C), pages 246-266.
- 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.
- Angelelli, E. & Archetti, C. & Vindigni, M., 2014. "The Clustered Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 404-414.
- Aldy Gunawan & Hoong Chuin Lau & Pieter Vansteenwegen & Kun Lu, 2017. "Well-tuned algorithms for the Team Orienteering Problem with Time Windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(8), pages 861-876, August.
- Kim, Hyunjoon & Kim, Byung-In, 2022. "Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem," European Journal of Operational Research, Elsevier, vol. 303(2), pages 550-566.
- Hu, Qian & Lim, Andrew, 2014. "An iterative three-component heuristic for the team orienteering problem with time windows," European Journal of Operational Research, Elsevier, vol. 232(2), pages 276-286.
- Shih-Wei Lin & Sirui Guo & Wen-Jie Wu, 2024. "Applying the Simulated Annealing Algorithm to the Set Orienteering Problem with Mandatory Visits," Mathematics, MDPI, vol. 12(19), pages 1-24, October.
- Vansteenwegen, Pieter & Souffriau, Wouter & Oudheusden, Dirk Van, 2011. "The orienteering problem: A survey," European Journal of Operational Research, Elsevier, vol. 209(1), pages 1-10, February.
- Racha El-Hajj & Rym Nesrine Guibadj & Aziz Moukrim & Mehdi Serairi, 2020. "A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit," Annals of Operations Research, Springer, vol. 291(1), pages 281-316, August.
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:soceps:v:99:y:2025:i:c:s0038012125000539. 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/seps .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.