Abstract
The water system minimum-cost flow problem is solved using the successive shortest path (SSP), graph theory algorithm, by representing the network as a directed graph. The graph nodes represent water sources, junctions, tanks and consumers. The edges represent pipes, pumping stations water tanks. The successive shortest path algorithm is applied to the graph ending when max flow limitation is fulfilled between the sources and sink nodes, returning minimal operating costs. A simple 24 h water system is examined using the proposed graph representation. The results are compared to the results of numeration and standard linear programing solver.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.