IDEAS home Printed from https://ideas.repec.org/a/eee/transa/v137y2020icp285-300.html
   My bibliography  Save this article

A round-trip bus evacuation model with scheduling and routing planning

Author

Listed:
  • Zhao, Xing
  • Ji, Kang
  • Xu, Peng
  • Qian, Wen-wen
  • Ren, Gang
  • Shan, Xiao-nian

Abstract

As emergencies occur more frequently, such as natural disasters and industrial accidents, evacuation planning attracts more and more attention. Bus is often used to evacuate car-free people due to its large capacity and manageability. To improve the efficiency and practicality of public transport evacuation plans, this paper presents a round-trip bus evacuation model based on unfixed routes with simultaneous optimization of bus scheduling and routing planning. With constraints of bus capacity, evacuee demand at pick-up points, time windows and flow balance, the proposed model aims to reduce the total evacuee time cost, including in-bus travel time and waiting time. Moreover, a two-layer algorithm, integrating the insertion algorithm and the edge-exchange algorithm, is devised to obtain the model sub-optimal solution. To verify the effectiveness of the proposed model and solution, two cases are presented in this paper. In the first case, the proposed model and algorithm manage to solve bus evacuation problems effectively. Furthermore, sensitivity analyses are conducted to show the impact factors on the objective function. Based on the realistic topology and size network of Ningbo in China, the second case illustrates the practical value of the model and solution in large-scale evacuation, and demonstrates the superiority over the conventional solution.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:transa:v:137:y:2020:i:c:p:285-300
    DOI: 10.1016/j.tra.2020.05.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0965856420305905
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tra.2020.05.008?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. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms," Transportation Science, INFORMS, vol. 39(1), pages 104-118, February.
    2. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    3. 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.
    4. Shahparvari, Shahrooz & Abbasi, Babak, 2017. "Robust stochastic vehicle routing and scheduling for bushfire emergency evacuation: An Australian case study," Transportation Research Part A: Policy and Practice, Elsevier, vol. 104(C), pages 32-49.
    5. 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.
    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. Wagenvoort, M. & Bouman, P.C. & van Ee, M. & Lamballais Tessensohn, T. & Postek, K., 2025. "Exact and heuristic approaches for the ship-to-shore problem," European Journal of Operational Research, Elsevier, vol. 320(1), pages 115-131.
    2. Ye, Shi & Chen, Qun & Tang, Yi, 2023. "Anger between bus drivers and passengers or among passengers: Development of a bus passenger anger scale (BPAS) and a bus driver anger scale (BDAS)," Transportation Research Part A: Policy and Practice, Elsevier, vol. 167(C).
    3. Bi, Hui & Gao, Hui & Li, Aoyong & Ye, Zhirui, 2024. "Investigation on the joint travel behavior in bike sharing systems during the COVID-19 pandemic: Insights from New York City," Journal of Transport Geography, Elsevier, vol. 117(C).
    4. Shahparvari, Shahrooz & Mohammadi, Mahsa & Peszynski, Konrad & Rickards, Lauren, 2024. "How contraflow enhances clearance time during assisted mass evacuation – A case study exploring the Australian 2013–14 Gippsland bushfires," Transportation Research Part A: Policy and Practice, Elsevier, vol. 189(C).
    5. Liu, Jialin & Jiang, Rui & Liu, Yang & Jia, Bin & Li, Xingang & Wang, Ting, 2024. "Managing evacuation of multiclass traffic flow: Fleet configuration, lane allocation, lane reversal, and cross elimination," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(C).
    6. Muhammad Fadhlullah Abu Bakar & Shuhairy Norhisham & Herda Yati Katman & Chow Ming Fai & Nor Najwa Irina Mohd Azlan & Nur Sarah Shaziah Samsudin, 2022. "Service Quality of Bus Performance in Asia: A Systematic Literature Review and Conceptual Framework," Sustainability, MDPI, vol. 14(13), pages 1-21, June.

    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. Li Zhu & Yeming Gong & Yishui Xu & Jun Gu, 2019. "Emergency relief routing models for injured victims considering equity and priority," Annals of Operations Research, Springer, vol. 283(1), pages 1573-1606, December.
    2. Asbach, Lasse & Dorndorf, Ulrich & Pesch, Erwin, 2009. "Analysis, modeling and solution of the concrete delivery problem," European Journal of Operational Research, Elsevier, vol. 193(3), pages 820-835, March.
    3. 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.
    4. Gerhard Hiermann & Matthias Prandtstetter & Andrea Rendl & Jakob Puchinger & Günther Raidl, 2015. "Metaheuristics for solving a multimodal home-healthcare scheduling 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. 23(1), pages 89-113, March.
    5. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    6. Ullrich, Christian A., 2013. "Integrated machine scheduling and vehicle routing with time windows," European Journal of Operational Research, Elsevier, vol. 227(1), pages 152-165.
    7. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.
    8. Zhiping Zuo & Yanhui Li & Jing Fu & Jianlin Wu, 2019. "Human Resource Scheduling Model and Algorithm with Time Windows and Multi-Skill Constraints," Mathematics, MDPI, vol. 7(7), pages 1-18, July.
    9. 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.
    10. Ulrike Ritzinger & Jakob Puchinger & Richard Hartl, 2016. "Dynamic programming based metaheuristics for the dial-a-ride problem," Annals of Operations Research, Springer, vol. 236(2), pages 341-358, January.
    11. John E. Fontecha & Oscar O. Guaje & Daniel Duque & Raha Akhavan-Tabatabaei & Juan P. Rodríguez & Andrés L. Medaglia, 2020. "Combined maintenance and routing optimization for large-scale sewage cleaning," Annals of Operations Research, Springer, vol. 286(1), pages 441-474, March.
    12. Subramanyam, Anirudh & Wang, Akang & Gounaris, Chrysanthos E., 2018. "A scenario decomposition algorithm for strategic time window assignment vehicle routing problems," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 296-317.
    13. Mohammad Torkjazi & Nathan Huynh, 2019. "Effectiveness of Dynamic Insertion Scheduling Strategy for Demand-Responsive Paratransit Vehicles Using Agent-Based Simulation," Sustainability, MDPI, vol. 11(19), pages 1-12, September.
    14. Julia Rieck & Jürgen Zimmermann, 2010. "A new mixed integer linear model for a rich vehicle routing problem with docking constraints," Annals of Operations Research, Springer, vol. 181(1), pages 337-358, December.
    15. 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.
    16. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    17. Ehmke, Jan Fabian & Campbell, Ann Melissa, 2014. "Customer acceptance mechanisms for home deliveries in metropolitan areas," European Journal of Operational Research, Elsevier, vol. 233(1), pages 193-207.
    18. Koch, Sebastian & Klein, Robert, 2020. "Route-based approximate dynamic programming for dynamic pricing in attended home delivery," European Journal of Operational Research, Elsevier, vol. 287(2), pages 633-652.
    19. Taş, D. & Gendreau, M. & Dellaert, N. & van Woensel, T. & de Kok, A.G., 2014. "Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach," European Journal of Operational Research, Elsevier, vol. 236(3), pages 789-799.
    20. Zajac, Sandra & Huber, Sandra, 2021. "Objectives and methods in multi-objective routing problems: a survey and classification scheme," European Journal of Operational Research, Elsevier, vol. 290(1), pages 1-25.

    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:transa:v:137:y:2020:i:c:p:285-300. 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/547/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.