IDEAS home Printed from https://ideas.repec.org/a/spr/waterr/v39y2025i12d10.1007_s11269-025-04247-x.html
   My bibliography  Save this article

A Two-stage Stochastic Bi-level Model and a Decomposition Algorithm for the Valve Location Problem in Water Networks

Author

Listed:
  • F. Hooshmand

    (Amirkabir University of Technology (Tehran Polytechnic))

  • S. A. MirHassani

    (Amirkabir University of Technology (Tehran Polytechnic))

  • M. Jamalian

    (Amirkabir University of Technology (Tehran Polytechnic))

Abstract

This paper addresses the valve location problem and the isolation system design in the water network under the pipe failure uncertainty. To overcome the weakness of the existing models in the literature, we formulate the problem as a two-stage stochastic bi-level programming model. Then, to solve the model, two methods are presented. The first one utilizes the duality theorems to reformulate the bi-level model as a single-level one and solves it by available optimization solvers. The second approach is a decomposition algorithm based on logic-based valid cuts. Computational results over a real-world network indicate that the proposed decomposition algorithm outperforms the direct resolution of the single-level model in all instances in terms of both solution quality and running time.

Suggested Citation

  • F. Hooshmand & S. A. MirHassani & M. Jamalian, 2025. "A Two-stage Stochastic Bi-level Model and a Decomposition Algorithm for the Valve Location Problem in Water Networks," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 39(12), pages 6239-6258, September.
    • Handle: RePEc:spr:waterr:v:39:y:2025:i:12:d:10.1007_s11269-025-04247-x
    DOI: 10.1007/s11269-025-04247-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11269-025-04247-x
    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/s11269-025-04247-x?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:waterr:v:39:y:2025:i:12:d:10.1007_s11269-025-04247-x. 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.