IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v46y2012i8p984-999.html
   My bibliography  Save this article

Optimal team deployment in urban search and rescue

Author

Listed:
  • Chen, Lichun
  • Miller-Hooks, Elise

Abstract

The problem of optimally deploying urban search and rescue (USAR) teams to disaster sites in post-disaster circumstances is formulated as a multistage stochastic program (MSP). A portion of sites requiring assistance arrive dynamically over the decision horizon and key problem characteristics are known only with uncertainty a priori. The problem seeks to identify a set of tours for USAR teams so as to maximize the total expected number of people that can be saved by attending to all or a subset of disaster sites within the disaster region. Decisions are taken dynamically over the decision horizon as situational awareness improves and survival likelihood diminishes with the aim of increasing the expected number of saved lives. To overcome the expensive computational effort associated with solving a MSP, a column generation-based strategy that consists of solving a series of interrelated two-stage stochastic programs with recourse within a shrinking time horizon is developed.

Suggested Citation

  • Chen, Lichun & Miller-Hooks, Elise, 2012. "Optimal team deployment in urban search and rescue," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 984-999.
    • Handle: RePEc:eee:transb:v:46:y:2012:i:8:p:984-999
    DOI: 10.1016/j.trb.2012.03.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261512000409
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2012.03.004?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. Sheu, Jiuh-Biing, 2007. "An emergency logistics distribution approach for quick response to urgent relief demand in disasters," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 43(6), pages 687-709, November.
    2. Dimitris J. Bertsimas & Garrett van Ryzin, 1991. "A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane," Operations Research, INFORMS, vol. 39(4), pages 601-615, August.
    3. Bertsimas, Dimitris & Van Ryzin, Garrett., 1991. "A stochastic and dynamic vehicle routing problem in the Euclidean plane," Working papers 3286-91., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    4. Soumia Ichoua & Michel Gendreau & Jean-Yves Potvin, 2006. "Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching," Transportation Science, INFORMS, vol. 40(2), pages 211-225, May.
    5. 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.
    6. Sheu, Jiuh-Biing, 2010. "Dynamic relief-demand management for emergency logistics operations under large-scale disasters," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(1), pages 1-17, January.
    7. Raymond K. Cheung & Warren B. Powell, 1996. "An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management," Operations Research, INFORMS, vol. 44(6), pages 951-963, December.
    8. Ann Campbell & Michel Gendreau & Barrett Thomas, 2011. "The orienteering problem with stochastic travel and service times," Annals of Operations Research, Springer, vol. 186(1), pages 61-81, June.
    9. Zhi-Long Chen & Hang Xu, 2006. "Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows," Transportation Science, INFORMS, vol. 40(1), pages 74-88, February.
    10. Lijian Chen & Tito Homem-de-Mello, 2010. "Re-solving stochastic programming models for airline revenue management," Annals of Operations Research, Springer, vol. 177(1), pages 91-114, June.
    11. Anton J. Kleywegt & Jason D. Papastavrou, 1998. "The Dynamic and Stochastic Knapsack Problem," Operations Research, INFORMS, vol. 46(1), pages 17-35, February.
    12. 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.
    13. Tang, Hao & Miller-Hooks, Elise & Tomastik, Robert, 2007. "Scheduling technicians for planned maintenance of geographically distributed equipment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 43(5), pages 591-609, September.
    14. Martin Savelsbergh & Marc Sol, 1998. "Drive: Dynamic Routing of Independent Vehicles," Operations Research, INFORMS, vol. 46(4), pages 474-490, August.
    15. Edward P. C. Kao, 1978. "A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem," Operations Research, INFORMS, vol. 26(6), pages 1033-1045, December.
    16. Russell W. Bent & Pascal Van Hentenryck, 2004. "Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers," Operations Research, INFORMS, vol. 52(6), pages 977-987, December.
    17. 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.
    18. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    19. 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.
    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. Davood Shiri & Vahid Akbari & F. Sibel Salman, 2020. "Online routing and scheduling of search-and-rescue teams," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(3), pages 755-784, September.
    2. Liu, Bingsheng & Sheu, Jiuh-Biing & Zhao, Xue & Chen, Yuan & Zhang, Wei, 2020. "Decision making on post-disaster rescue routing problems from the rescue efficiency perspective," European Journal of Operational Research, Elsevier, vol. 286(1), pages 321-335.
    3. Ghazaleh Ahmadi & Reza Tavakkoli-Moghaddam & Armand Baboli & Mehdi Najafi, 2022. "A decision support model for robust allocation and routing of search and rescue resources after earthquake: a case study," Operational Research, Springer, vol. 22(2), pages 1039-1081, April.
    4. Rezapour, Shabnam & Naderi, Nazanin & Morshedlou, Nazanin & Rezapourbehnagh, Shaghayegh, 2018. "Optimal deployment of emergency resources in sudden onset disasters," International Journal of Production Economics, Elsevier, vol. 204(C), pages 365-382.
    5. Allahviranloo, Mahdieh & Chow, Joseph Y.J. & Recker, Will W., 2014. "Selective vehicle routing problems under uncertainty without recourse," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 68-88.
    6. Yagci Sokat, Kezban & Dolinskaya, Irina S. & Smilowitz, Karen & Bank, Ryan, 2018. "Incomplete information imputation in limited data environments with application to disaster response," European Journal of Operational Research, Elsevier, vol. 269(2), pages 466-485.
    7. Cheng, Yung-Hsiang & Liang, Zheng-Xian, 2014. "A strategic planning model for the railway system accident rescue problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 75-96.
    8. Cejun Cao & Congdong Li & Qin Yang & Fanshun Zhang, 2017. "Multi-Objective Optimization Model of Emergency Organization Allocation for Sustainable Disaster Supply Chain," Sustainability, MDPI, vol. 9(11), pages 1-22, November.
    9. Tarhan, İstenç & Zografos, Konstantinos G. & Sutanto, Juliana & Kheiri, Ahmed, 2024. "A quadrant shrinking heuristic for solving the dynamic multi-objective disaster response personnel routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 314(2), pages 776-791.
    10. Zhang, Zhenyu & Ji, Tingting & Wei, Hsi-Hsien, 2022. "Dynamic emergency inspection routing and restoration scheduling to enhance the post-earthquake resilience of a highway–bridge network," Reliability Engineering and System Safety, Elsevier, vol. 220(C).
    11. Farahani, Reza Zanjirani & Lotfi, M.M. & Baghaian, Atefe & Ruiz, Rubén & Rezapour, Shabnam, 2020. "Mass casualty management in disaster scene: A systematic review of OR&MS research in humanitarian operations," European Journal of Operational Research, Elsevier, vol. 287(3), pages 787-819.
    12. Bakker, Hannah & Dunke, Fabian & Nickel, Stefan, 2020. "A structuring review on multi-stage optimization under uncertainty: Aligning concepts from theory and practice," Omega, Elsevier, vol. 96(C).
    13. Atefe Baghaian & M. M. Lotfi & Shabnam Rezapour, 2022. "Integrated deployment of local urban relief teams in the first hours after mass casualty incidents," Operational Research, Springer, vol. 22(4), pages 4517-4555, September.
    14. Yiping Jiang & Yufei Yuan, 2019. "Emergency Logistics in a Large-Scale Disaster Context: Achievements and Challenges," IJERPH, MDPI, vol. 16(5), pages 1-23, March.
    15. Cui, Shaohua & Yao, Baozhen & Chen, Gang & Zhu, Chao & Yu, Bin, 2020. "The multi-mode mobile charging service based on electric vehicle spatiotemporal distribution," Energy, Elsevier, vol. 198(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. Soeffker, Ninja & Ulmer, Marlin W. & Mattfeld, Dirk C., 2022. "Stochastic dynamic vehicle routing in the light of prescriptive analytics: A review," European Journal of Operational Research, Elsevier, vol. 298(3), pages 801-820.
    2. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(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. Xiong Hao & Yan Huili, 2019. "General Method of Building a Real-Time Optimization Policy for Dynamic Vehicle Routing Problem," Journal of Systems Science and Information, De Gruyter, vol. 7(6), pages 584-598, December.
    5. Barrett W. Thomas, 2007. "Waiting Strategies for Anticipating Service Requests from Known Customer Locations," Transportation Science, INFORMS, vol. 41(3), pages 319-331, August.
    6. Nikola Mardešić & Tomislav Erdelić & Tonči Carić & Marko Đurasević, 2023. "Review of Stochastic Dynamic Vehicle Routing in the Evolving Urban Logistics Environment," Mathematics, MDPI, vol. 12(1), pages 1-44, December.
    7. Zhang, Jian & Luo, Kelin & Florio, Alexandre M. & Van Woensel, Tom, 2023. "Solving large-scale dynamic vehicle routing problems with stochastic requests," European Journal of Operational Research, Elsevier, vol. 306(2), pages 596-614.
    8. Lars M. Hvattum & Arne Løkketangen & Gilbert Laporte, 2006. "Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic," Transportation Science, INFORMS, vol. 40(4), pages 421-438, November.
    9. Soumia Ichoua & Michel Gendreau & Jean-Yves Potvin, 2006. "Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching," Transportation Science, INFORMS, vol. 40(2), pages 211-225, May.
    10. Marlin W. Ulmer & Justin C. Goodson & Dirk C. Mattfeld & Marco Hennig, 2019. "Offline–Online Approximate Dynamic Programming for Dynamic Vehicle Routing with Stochastic Requests," Service Science, INFORMS, vol. 53(1), pages 185-202, February.
    11. Roberto Tadei & Guido Perboli & Francesca Perfetti, 2017. "The multi-path Traveling Salesman Problem with stochastic travel costs," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 3-23, March.
    12. Diego Muñoz-Carpintero & Doris Sáez & Cristián E. Cortés & Alfredo Núñez, 2015. "A Methodology Based on Evolutionary Algorithms to Solve a Dynamic Pickup and Delivery Problem Under a Hybrid Predictive Control Approach," Transportation Science, INFORMS, vol. 49(2), pages 239-253, May.
    13. Barrett W. Thomas & Chelsea C. White, 2004. "Anticipatory Route Selection," Transportation Science, INFORMS, vol. 38(4), pages 473-487, November.
    14. Cristián E. Cortés & Doris Sáez & Alfredo Núñez & Diego Muñoz-Carpintero, 2009. "Hybrid Adaptive Predictive Control for a Dynamic Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 43(1), pages 27-42, February.
    15. Van Woensel, T. & Kerbache, L. & Peremans, H. & Vandaele, N., 2008. "Vehicle routing with dynamic travel times: A queueing approach," European Journal of Operational Research, Elsevier, vol. 186(3), pages 990-1007, May.
    16. Liu, Bingsheng & Sheu, Jiuh-Biing & Zhao, Xue & Chen, Yuan & Zhang, Wei, 2020. "Decision making on post-disaster rescue routing problems from the rescue efficiency perspective," European Journal of Operational Research, Elsevier, vol. 286(1), pages 321-335.
    17. Noah Gans & Garrett van Ryzin, 1999. "Dynamic Vehicle Dispatching: Optimal Heavy Traffic Performance and Practical Insights," Operations Research, INFORMS, vol. 47(5), pages 675-692, October.
    18. Jian Yang & Patrick Jaillet & Hani Mahmassani, 2004. "Real-Time Multivehicle Truckload Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 38(2), pages 135-148, May.
    19. Sheng Liu & Long He & Zuo-Jun Max Shen, 2021. "On-Time Last-Mile Delivery: Order Assignment with Travel-Time Predictors," Management Science, INFORMS, vol. 67(7), pages 4095-4119, July.
    20. van de Klundert, J. & Wormer, L., 2008. "ASAP: the after salesman problem," Research Memorandum 054, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).

    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:transb:v:46:y:2012:i:8:p:984-999. 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/wps/find/journaldescription.cws_home/548/description#description .

    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.