IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v61y2024i1d10.1007_s12597-023-00690-9.html
   My bibliography  Save this article

Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach

Author

Listed:
  • Hari Nandan Nath

    (Tribhuvan University)

  • Tanka Nath Dhamala

    (Tribhuvan University)

  • Stephan Dempe

    (TU Bergakademie Freiberg)

Abstract

Reversing the direction of traffic flow in necessary road segments is an important strategy to optimize the flow, especially, in an emergency evacuation. The configuration may, however, block the paths toward the source. Sometimes, it may be necessary to save a path for some facility movements from a specific node towards the source. We consider such a problem as a biobjective optimization problem that minimizes the length of the saved path and the egress time of the given amount of flow. An algorithm based on the $$\epsilon$$ ϵ -constraint method is proposed to find the non-dominated solutions and its computational performance has been tested on a road network of Kathmandu city and randomly generated networks.

Suggested Citation

  • Hari Nandan Nath & Tanka Nath Dhamala & Stephan Dempe, 2024. "Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach," OPSEARCH, Springer;Operational Research Society of India, vol. 61(1), pages 98-120, March.
    • Handle: RePEc:spr:opsear:v:61:y:2024:i:1:d:10.1007_s12597-023-00690-9
    DOI: 10.1007/s12597-023-00690-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-023-00690-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12597-023-00690-9?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. Caunhye, Aakil M. & Zhang, Yidong & Li, Mingzhe & Nie, Xiaofeng, 2016. "A location-routing model for prepositioning and distributing emergency supplies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 90(C), pages 161-176.
    2. Siliang Luan & Qingfang Yang & Huxing Zhou & Zhongtai Jiang & Wei Wang & Zhuorui Wang & Ruijuan Chu, 2019. "The HSABA for Emergency Location-Routing Problem," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-12, July.
    3. Nadine Baumann & Martin Skutella, 2009. "Earliest Arrival Flows with Multiple Sources," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 499-512, May.
    4. Horst Hamacher & Stephanie Heller & Benjamin Rupp, 2013. "Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning," Annals of Operations Research, Springer, vol. 207(1), pages 161-180, 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. Urmila Pyakurel & Tanka Nath Dhamala, 2017. "Continuous Dynamic Contraflow Approach for Evacuation Planning," Annals of Operations Research, Springer, vol. 253(1), pages 573-598, June.
    2. Sarhadi, Hassan & Naoum-Sawaya, Joe & Verma, Manish, 2020. "A robust optimization approach to locating and stockpiling marine oil-spill response facilities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    3. Urmila Pyakurel & Tanka Nath Dhamala & Stephan Dempe, 2017. "Efficient continuous contraflow algorithms for evacuation planning problems," Annals of Operations Research, Springer, vol. 254(1), pages 335-364, July.
    4. Aakil M. Caunhye & Xiaofeng Nie, 2018. "A Stochastic Programming Model for Casualty Response Planning During Catastrophic Health Events," Transportation Science, INFORMS, vol. 52(2), pages 437-453, March.
    5. Alf Kimms & Marc Maiwald, 2017. "An exact network flow formulation for cell‐based evacuation in urban areas," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(7), pages 547-555, October.
    6. Yongqiang Zhang & Zhuang Hu & Min Zhang & Wenting Ba & Ying Wang, 2022. "Emergency Response Resource Allocation in Sparse Network Using Improved Particle Swarm Optimization," IJERPH, MDPI, vol. 19(16), pages 1-11, August.
    7. Fatemeh Sabouhi & Ali Bozorgi-Amiri & Mohammad Moshref-Javadi & Mehdi Heydari, 2019. "An integrated routing and scheduling model for evacuation and commodity distribution in large-scale disaster relief operations: a case study," Annals of Operations Research, Springer, vol. 283(1), pages 643-677, December.
    8. Ismaila Abderhamane Ndiaye & Emmanuel Neron & Antoine Jouglet, 2017. "Macroscopic evacuation plans for natural disasters," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 231-272, January.
    9. Zhongzhen Yang & Liquan Guo & Zaili Yang, 2019. "Emergency logistics for wildfire suppression based on forecasted disaster evolution," Annals of Operations Research, Springer, vol. 283(1), pages 917-937, December.
    10. Yang, Wenjie & Caunhye, Aakil M. & Zhuo, Maolin & Wang, Qingyi, 2024. "Integrated planning of emergency supply pre-positioning and victim evacuation," Socio-Economic Planning Sciences, Elsevier, vol. 95(C).
    11. Wang, Qingyi & Nie, Xiaofeng, 2022. "A stochastic programming model for emergency supply planning considering transportation network mitigation and traffic congestion," Socio-Economic Planning Sciences, Elsevier, vol. 79(C).
    12. Maliheh Khorsi & Seyed Kamal Chaharsooghi & Ali Husseinzadeh Kashan & Ali Bozorgi-Amiri, 2021. "Pareto-based grouping meta-heuristic algorithm for humanitarian relief logistics with multistate network reliability," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 327-365, June.
    13. Hong Zheng & Yi-Chang Chiu, 2011. "A Network Flow Algorithm for the Cell-Based Single-Destination System Optimal Dynamic Traffic Assignment Problem," Transportation Science, INFORMS, vol. 45(1), pages 121-137, February.
    14. Hammad, Ahmed W A & Akbarnezhad, Ali & Rey, David, 2017. "Sustainable urban facility location: Minimising noise pollution and network congestion," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 38-59.
    15. Md Ashikur Rahman & Rajalingam Sokkalingam & Mahmod Othman & Kallol Biswas & Lazim Abdullah & Evizal Abdul Kadir, 2021. "Nature-Inspired Metaheuristic Techniques for Combinatorial Optimization Problems: Overview and Recent Advances," Mathematics, MDPI, vol. 9(20), pages 1-32, October.
    16. Kundu, Tanmoy & Sheu, Jiuh-Biing & Kuo, Hsin-Tsz, 2022. "Emergency logistics management—Review and propositions for future research," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    17. Ma, Rui & Ban, Xuegang (Jeff) & Pang, Jong-Shi, 2014. "Continuous-time dynamic system optimum for single-destination traffic networks with queue spillbacks," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 98-122.
    18. Jimoh Eniola Olaogbebikan & Richard Oloruntoba, 2019. "Similarities between disaster supply chains and commercial supply chains: a SCM process view," Annals of Operations Research, Springer, vol. 283(1), pages 517-542, December.
    19. Lara Turner & Dwi Groß & Horst Hamacher & Sven Krumke, 2015. "Static and dynamic source locations in undirected networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(3), pages 619-646, October.
    20. Urmila Pyakurel & Hari Nandan Nath & Stephan Dempe & Tanka Nath Dhamala, 2019. "Efficient Dynamic Flow Algorithms for Evacuation Planning Problems with Partial Lane Reversal," Mathematics, MDPI, vol. 7(10), pages 1-29, October.

    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:spr:opsear:v:61:y:2024:i:1:d:10.1007_s12597-023-00690-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.