IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v49y2015i4p853-867.html
   My bibliography  Save this article

Scheduling and Routing for a Bus-Based Evacuation with a Constant Evacuee Arrival Rate

Author

Listed:
  • Victor C. Pereira

    (Grado Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, Virginia 24061)

  • Douglas R. Bish

    (Grado Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, Virginia 24061)

Abstract

This paper introduces a variant of the vehicle routing problem adapted for bus-based, regional evacuation planning, where evacuees arrive at predetermined pickup locations at constant, location-specific rates. This arrival process more realistically portrays evacuee arrival behavior, presenting an important distinction from the current transit-based evacuation literature. In this problem, capacity-constrained buses are routed, potentially multiple times, to transport all evacuees to a depot/shelter such that the last pickup, and the end of the arrival process, occurs at a location-specific time, determined by risk considerations. The problem seeks to minimize the total waiting time at these locations (total exposure) and exploits efficiencies by allowing service choice. The structural properties of this problem guide the choice for two important strategic parameters: the maximum number of pickups allowed on each location and the fleet size. It is shown that, depending on the problem instance, increasing the maximum number of pickups may reduce both the fleet size requirement and the total exposure and that, past a certain threshold, there exists a maximum number of pickups (or a range of potential values, if the problem cannot be solved to optimality) that guarantees an efficient usage of the available fleet and equitable reductions in exposure across pickup locations.

Suggested Citation

  • Victor C. Pereira & Douglas R. Bish, 2015. "Scheduling and Routing for a Bus-Based Evacuation with a Constant Evacuee Arrival Rate," Transportation Science, INFORMS, vol. 49(4), pages 853-867, November.
    • Handle: RePEc:inm:ortrsc:v:49:y:2015:i:4:p:853-867
    DOI: 10.1287/trsc.2014.0555
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2014.0555
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2014.0555?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
    ---><---

    References listed on IDEAS

    as
    1. Peter Francis & Karen Smilowitz & Michal Tzur, 2006. "The Period Vehicle Routing Problem with Service Choice," Transportation Science, INFORMS, vol. 40(4), pages 439-454, November.
    2. André Puong & Nigel H. M. Wilson, 2008. "A Train Holding Model for Urban Rail Transit Systems," Lecture Notes in Economics and Mathematical Systems, in: Mark Hickman & Pitu Mirchandani & Stefan Voß (ed.), Computer-aided Systems in Public Transport, pages 319-337, Springer.
    3. Jean-Francois Cordeau & Gilbert Laporte, 2006. "Modeling and Optimization of Vehicle Routing and Arc Routing Problems," International Series in Operations Research & Management Science, in: Gautam Appa & Leonidas Pitsoulis & H. Paul Williams (ed.), Handbook on Modelling for Discrete Optimization, chapter 0, pages 151-191, Springer.
    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. Wang, Qingyi & Wallace, Stein W., 2022. "Non-compliance in transit-based evacuation pick-up point assignments," Socio-Economic Planning Sciences, Elsevier, vol. 82(PB).
    2. Swamy, Rahul & Kang, Jee Eun & Batta, Rajan & Chung, Younshik, 2017. "Hurricane evacuation planning using public transportation," Socio-Economic Planning Sciences, Elsevier, vol. 59(C), pages 43-55.
    3. Yuanyuan Feng & Yi Cao & Shuanghua Yang & Lili Yang & Tangjian Wei, 2023. "A two-step sub-optimal algorithm for bus evacuation planning," Operational Research, Springer, vol. 23(2), pages 1-35, June.
    4. Bo Chen & Zhicheng Li & Zaiyue Yang, 2022. "Nuclear Accident Emergency Response System: Radiation Field Estimation and Evacuation," Sustainability, MDPI, vol. 14(9), pages 1-18, May.
    5. Wang, Yan & Wang, Junwei, 2019. "Integrated reconfiguration of both supply and demand for evacuation planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 130(C), pages 82-94.
    6. Krutein, Klaas Fiete & Goodchild, Anne, 2022. "The isolated community evacuation problem with mixed integer programming," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    7. Zhao, Xing & Ji, Kang & Xu, Peng & Qian, Wen-wen & Ren, Gang & Shan, Xiao-nian, 2020. "A round-trip bus evacuation model with scheduling and routing planning," Transportation Research Part A: Policy and Practice, Elsevier, vol. 137(C), pages 285-300.
    8. Lehilton L. C. Pedrosa & Rafael C. S. Schouery, 2018. "Approximation algorithms for the bus evacuation problem," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 131-141, July.

    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. Sánchez-Martínez, G.E. & Koutsopoulos, H.N. & Wilson, N.H.M., 2016. "Real-time holding control for high-frequency transit with dynamics," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 1-19.
    2. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    3. Nair, D.J. & Grzybowska, H. & Fu, Y. & Dixit, V.V., 2018. "Scheduling and routing models for food rescue and delivery operations," Socio-Economic Planning Sciences, Elsevier, vol. 63(C), pages 18-32.
    4. Meyer, Anne & Amberg, Boris, 2018. "Transport concept selection considering supplier milk runs – An integrated model and a case study from the automotive industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 113(C), pages 147-169.
    5. Roberto Baldacci & Enrico Bartolini & Aristide Mingozzi & Andrea Valletta, 2011. "An Exact Algorithm for the Period Routing Problem," Operations Research, INFORMS, vol. 59(1), pages 228-241, February.
    6. Nasr Al-Hinai & Chefi Triki, 2020. "A two-level evolutionary algorithm for solving the petrol station replenishment problem with periodicity constraints and service choice," Annals of Operations Research, Springer, vol. 286(1), pages 325-350, March.
    7. Davis, Lauren B. & Sengul, Irem & Ivy, Julie S. & Brock, Luther G. & Miles, Lastella, 2014. "Scheduling food bank collections and deliveries to ensure food safety and improve access," Socio-Economic Planning Sciences, Elsevier, vol. 48(3), pages 175-188.
    8. Gläser, Sina & Stücken, Mareike, 2021. "Introduction of an underground waste container system–model and solution approaches," European Journal of Operational Research, Elsevier, vol. 295(2), pages 675-689.
    9. Ann-Kathrin Rothenbächer, 2019. "Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures," Transportation Science, INFORMS, vol. 53(3), pages 850-866, May.
    10. Zhen, Lu & Gao, Jiajing & Tan, Zheyi & Laporte, Gilbert & Baldacci, Roberto, 2023. "Territorial design for customers with demand frequency," European Journal of Operational Research, Elsevier, vol. 309(1), pages 82-101.
    11. Rodríguez-Martín, Inmaculada & Salazar-González, Juan-José & Yaman, Hande, 2019. "The periodic vehicle routing problem with driver consistency," European Journal of Operational Research, Elsevier, vol. 273(2), pages 575-584.
    12. Ansari, Sina & Başdere, Mehmet & Li, Xiaopeng & Ouyang, Yanfeng & Smilowitz, Karen, 2018. "Advancements in continuous approximation models for logistics and transportation systems: 1996–2016," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 229-252.
    13. Ann-Kathrin Rothenbächer, 2017. "Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures," Working Papers 1714, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    14. Vera C. Hemmelmayr & Karl F. Doerner & Richard F. Hartl & Daniele Vigo, 2014. "Models and Algorithms for the Integrated Planning of Bin Allocation and Vehicle Routing in Solid Waste Management," Transportation Science, INFORMS, vol. 48(1), pages 103-120, February.
    15. Darvish, Maryam & Archetti, Claudia & Coelho, Leandro C. & Speranza, M. Grazia, 2019. "Flexible two-echelon location routing problem," European Journal of Operational Research, Elsevier, vol. 277(3), pages 1124-1136.
    16. Ali Diabat & Tarek Abdallah & Tung Le, 2016. "A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods," Annals of Operations Research, Springer, vol. 242(2), pages 373-398, July.
    17. Wang, Yihui & Zhao, Kangqi & D’Ariano, Andrea & Niu, Ru & Li, Shukai & Luan, Xiaojie, 2021. "Real-time integrated train rescheduling and rolling stock circulation planning for a metro line under disruptions," Transportation Research Part B: Methodological, Elsevier, vol. 152(C), pages 87-117.
    18. Karen Smilowitz & Maciek Nowak & Tingting Jiang, 2013. "Workforce Management in Periodic Delivery Operations," Transportation Science, INFORMS, vol. 47(2), pages 214-230, May.
    19. Liu, Ran & Xie, Xiaolan & Garaix, Thierry, 2014. "Hybridization of tabu search with feasible and infeasible local searches for periodic home health care logistics," Omega, Elsevier, vol. 47(C), pages 17-32.
    20. Zamorano, Emilio & Stolletz, Raik, 2017. "Branch-and-price approaches for the Multiperiod Technician Routing and Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 257(1), pages 55-68.

    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:inm:ortrsc:v:49:y:2015:i:4:p:853-867. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.