IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v335y2024i1d10.1007_s10479-023-05773-w.html
   My bibliography  Save this article

Generalized maximum flow over time with intermediate storage

Author

Listed:
  • Tanka Nath Dhamala

    (Tribhuvan University)

  • Mohan Chandra Adhikari

    (Tribhuvan University)

  • Durga Prasad Khanal

    (Tribhuvan University)

  • Urmila Pyakurel

    (Tribhuvan University)

Abstract

We consider two classical network flow problems. First, it is possible to store excess flow in the intermediate nodes to improve the total amount of flow that can be transported through the network. Second, we consider lossy network, where each arc has certain gain factor along with capacity and some portion of the flow is lost while traversing through such arcs. While both extensions have been considered separately in the literature, this will be the first time that they are considered simultaneously, which requires new mathematical model, analysis and solution methods. We consider that intermediate nodes have sufficient holding capacity and the excess flow is stored in the priority order within their capacity. We introduce the generalized maximum static and dynamic flow problems with intermediate storage in lossy network and present efficient algorithms and FPTAS for the solutions. Furthermore, notion of the generalized maximum dynamic flow with excess flow storage is extended to contraflow technique with symmetric and asymmetric arc travel times.

Suggested Citation

  • Tanka Nath Dhamala & Mohan Chandra Adhikari & Durga Prasad Khanal & Urmila Pyakurel, 2024. "Generalized maximum flow over time with intermediate storage," Annals of Operations Research, Springer, vol. 335(1), pages 111-134, April.
    • Handle: RePEc:spr:annopr:v:335:y:2024:i:1:d:10.1007_s10479-023-05773-w
    DOI: 10.1007/s10479-023-05773-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-023-05773-w
    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/s10479-023-05773-w?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:annopr:v:335:y:2024:i:1:d:10.1007_s10479-023-05773-w. 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.