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.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.