IDEAS home Printed from https://ideas.repec.org/a/spr/waterr/v24y2010i13p3665-3678.html
   My bibliography  Save this article

Water Supply Network Optimisation Using Equal Flow Algorithms

Author

Listed:
  • Antonio Manca
  • Giovanni Sechi
  • Paola Zuddas

Abstract

Algorithms to optimise water supply networks are developed and compared when a given set of transfer arcs is constrained to carry the same (or proportional) amounts of flow. Initially, a dynamic multi-period mathematical model is designed as a network flow model. A network simplex-based algorithm, Equalflow, and a subgradient-based algorithm, SUBeqf, are then presented. Both algorithms are characterised by polynomial complexity and can solve large-scale instances that arise when considering water system requirements. A specialised interface for water supply networks provides a data input processor to generate the overall multi-period network model in the implementation of the procedures. The implementation of the algorithms allows the consideration of different types of equal flow instances that take place in water resource system optimisation. The performances of the two algorithms and analysis of their computational efficiency with respect to state-of-the-art mathematical programming software are reported, considering equal-flow instances from a synthetically generated network and two water supply systems in the Sardinia region of Italy. Copyright Springer Science+Business Media B.V. 2010

Suggested Citation

  • Antonio Manca & Giovanni Sechi & Paola Zuddas, 2010. "Water Supply Network Optimisation Using Equal Flow Algorithms," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 24(13), pages 3665-3678, October.
    • Handle: RePEc:spr:waterr:v:24:y:2010:i:13:p:3665-3678
    DOI: 10.1007/s11269-010-9625-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11269-010-9625-9
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11269-010-9625-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. D. Klingman & A. Napier & J. Stutz, 1974. "NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems," Management Science, INFORMS, vol. 20(5), pages 814-821, January.
    2. Ali, Agha Iqbal & Kennington, Jeff & Shetty, Bala, 1988. "The equal flow problem," European Journal of Operational Research, Elsevier, vol. 36(1), pages 107-115, July.
    3. Giovanni Sechi & Paola Zuddas, 2008. "Multiperiod Hypergraph Models for Water Systems Optimization," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 22(3), pages 307-320, March.
    4. Ravindra K. Ahuja & James B. Orlin & Giovanni M. Sechi & Paola Zuddas, 1999. "Algorithms for the Simple Equal Flow Problem," Management Science, INFORMS, vol. 45(10), pages 1440-1455, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. D. Haro & J. Paredes & A. Solera & J. Andreu, 2012. "A Model for Solving the Optimal Water Allocation Problem in River Basins with Network Flow Programming When Introducing Non-Linearities," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 26(14), pages 4059-4071, November.
    2. Christina Büsing & Arie M. C. A. Koster & Sabrina Schmitz, 2022. "Robust minimum cost flow problem under consistent flow constraints," Annals of Operations Research, Springer, vol. 312(2), pages 691-722, May.

    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. David R. Morrison & Jason J. Sauppe & Sheldon H. Jacobson, 2013. "A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 2-12, February.
    2. Calvete, Herminia I., 2003. "Network simplex algorithm for the general equal flow problem," European Journal of Operational Research, Elsevier, vol. 150(3), pages 585-600, November.
    3. Kaul, Hemanshu & Rumpf, Adam, 2022. "A linear input dependence model for interdependent networks," European Journal of Operational Research, Elsevier, vol. 302(2), pages 781-797.
    4. Christina Büsing & Arie M. C. A. Koster & Sabrina Schmitz, 2022. "Robust minimum cost flow problem under consistent flow constraints," Annals of Operations Research, Springer, vol. 312(2), pages 691-722, May.
    5. Gutierrez, Genaro J. & Kouvelis, Panagiotis & Kurawarwala, Abbas A., 1996. "A robustness approach to uncapacitated network design problems," European Journal of Operational Research, Elsevier, vol. 94(2), pages 362-376, October.
    6. Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
    7. Gerald G. Brown & W. Matthew Carlyle, 2020. "Solving the Nearly Symmetric All-Pairs Shortest-Path Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 279-288, April.
    8. Balaji Gopalakrishnan & Seunghyun Kong & Earl Barnes & Ellis Johnson & Joel Sokol, 2011. "A least-squares minimum-cost network flow algorithm," Annals of Operations Research, Springer, vol. 186(1), pages 119-140, June.
    9. Giovanni Sechi & Paola Zuddas, 2008. "Multiperiod Hypergraph Models for Water Systems Optimization," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 22(3), pages 307-320, March.
    10. Festa, P. & Guerriero, F. & Laganà, D. & Musmanno, R., 2013. "Solving the shortest path tour problem," European Journal of Operational Research, Elsevier, vol. 230(3), pages 464-474.
    11. D. Haro & J. Paredes & A. Solera & J. Andreu, 2012. "A Model for Solving the Optimal Water Allocation Problem in River Basins with Network Flow Programming When Introducing Non-Linearities," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 26(14), pages 4059-4071, November.
    12. Yves Pochet & Mathieu Van Vyve, 2004. "A General Heuristic for Production Planning Problems," INFORMS Journal on Computing, INFORMS, vol. 16(3), pages 316-327, August.
    13. R. Fourer & H. Gassmann & J. Ma & R. Martin, 2009. "An XML-based schema for stochastic programs," Annals of Operations Research, Springer, vol. 166(1), pages 313-337, February.
    14. Maya Duque, Pablo A. & Coene, Sofie & Goos, Peter & Sörensen, Kenneth & Spieksma, Frits, 2013. "The accessibility arc upgrading problem," European Journal of Operational Research, Elsevier, vol. 224(3), pages 458-465.
    15. Jia Shu & Mabel C. Chou & Qizhang Liu & Chung-Piaw Teo & I-Lin Wang, 2013. "Models for Effective Deployment and Redistribution of Bicycles Within Public Bicycle-Sharing Systems," Operations Research, INFORMS, vol. 61(6), pages 1346-1359, December.
    16. ÇalIskan, Cenk, 2011. "A specialized network simplex algorithm for the constrained maximum flow problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 137-147, April.
    17. Mongeau, Marcel & Sartenaer, Annick, 1995. "Automatic decrease of the penalty parameter in exact penalty function methods," European Journal of Operational Research, Elsevier, vol. 83(3), pages 686-699, June.
    18. Mesquita-Cunha, Mariana & Figueira, José Rui & Barbosa-Póvoa, Ana Paula, 2023. "New ϵ−constraint methods for multi-objective integer linear programming: A Pareto front representation approach," European Journal of Operational Research, Elsevier, vol. 306(1), pages 286-307.
    19. Granat, Janusz & Guerriero, Francesca, 2003. "The interactive analysis of the multicriteria shortest path problem by the reference point method," European Journal of Operational Research, Elsevier, vol. 151(1), pages 103-118, November.
    20. Moreno, Alfredo & Munari, Pedro & Alem, Douglas, 2019. "A branch-and-Benders-cut algorithm for the Crew Scheduling and Routing Problem in road restoration," European Journal of Operational Research, Elsevier, vol. 275(1), pages 16-34.

    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:24:y:2010:i:13:p:3665-3678. 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.