IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v39y2022i03ns0217595921500275.html
   My bibliography  Save this article

A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow

Author

Listed:
  • Hari Nandan Nath

    (Central Department of Mathematics, Tribhuvan University, P.O. Box 13143, Kathmandu, Nepal)

  • Stephan Dempe

    (Fakultät für Mathematik und Informatik, TU Bergakademie Freiberg, 09596 Freiberg, Germany)

  • Tanka Nath Dhamala

    (Central Department of Mathematics, Tribhuvan University, P.O. Box 13143, Kathmandu, Nepal)

Abstract

The maximum dynamic contraflow problem in transportation networks seeks to maximize the flow from a source to a sink within a given time horizon with a possibility of arc reversals. This may result into blockage of paths of desired length from some node of the network towards the source. In some cases such as the evacuation planning, we may require a path towards the source to move some facilities, for example, emergency vehicles. In this work, we model the problem of saving such a path as a bicriteria optimization problem which minimizes the length of the path and maximizes the dynamic flow with arc reversals. We use the 𠜖-constraint approach to solve the problem and propose a procedure that gives the set of all Pareto optimal solutions in a single-source-single-sink network with integer inputs. We also present computational performance of the algorithm on a road network of Kathmandu city, and on randomly generated networks. The results are of both theoretical and practical importance.

Suggested Citation

  • Hari Nandan Nath & Stephan Dempe & Tanka Nath Dhamala, 2022. "A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 39(03), pages 1-24, June.
    • Handle: RePEc:wsi:apjorx:v:39:y:2022:i:03:n:s0217595921500275
    DOI: 10.1142/S0217595921500275
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595921500275
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595921500275?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:wsi:apjorx:v:39:y:2022:i:03:n:s0217595921500275. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.