Optimal water system operation using graph theory algorithms

E. Price; A. Ostfeld

doi:10.1016/j.proeng.2014.11.245

Optimal water system operation using graph theory algorithms

E. Price
, A. Ostfeld

Civil and Environmental Engineering

Research output: Contribution to journal › Conference article › peer-review

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 24h water system is examined using the proposed graph representation. The results are compared to the results of numeration and standard linear programing solver.

Original language	English
Pages (from-to)	502-508
Number of pages	7
Journal	Procedia Engineering
Volume	89
DOIs	https://doi.org/10.1016/j.proeng.2014.11.245
State	Published - 2014
Event	16th International Conference on Water Distribution System Analysis, WDSA 2014 - Bari, Italy Duration: 14 Jul 2014 → 17 Jul 2014

Keywords

Graph theory
Headloss
Optimal operation
Pump scheduling
Water system

ASJC Scopus subject areas

General Engineering

Access to Document

10.1016/j.proeng.2014.11.245

Cite this

@article{7abfa042228440f89b59206a71f0a609,

title = "Optimal water system operation using graph theory algorithms",

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 24h water system is examined using the proposed graph representation. The results are compared to the results of numeration and standard linear programing solver.",

keywords = "Graph theory, Headloss, Optimal operation, Pump scheduling, Water system",

author = "E. Price and A. Ostfeld",

note = "Publisher Copyright: {\textcopyright} 2014 Published by Elsevier Ltd.; 16th International Conference on Water Distribution System Analysis, WDSA 2014 ; Conference date: 14-07-2014 Through 17-07-2014",

year = "2014",

doi = "10.1016/j.proeng.2014.11.245",

language = "אנגלית",

volume = "89",

pages = "502--508",

}

TY - JOUR

T1 - Optimal water system operation using graph theory algorithms

AU - Price, E.

AU - Ostfeld, A.

PY - 2014

Y1 - 2014

N2 - 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 24h water system is examined using the proposed graph representation. The results are compared to the results of numeration and standard linear programing solver.

AB - 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 24h water system is examined using the proposed graph representation. The results are compared to the results of numeration and standard linear programing solver.

KW - Graph theory

KW - Headloss

KW - Optimal operation

KW - Pump scheduling

KW - Water system

UR - https://www.scopus.com/pages/publications/84949122189

U2 - 10.1016/j.proeng.2014.11.245

DO - 10.1016/j.proeng.2014.11.245

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:84949122189

SN - 1877-7058

VL - 89

SP - 502

EP - 508

JO - Procedia Engineering

JF - Procedia Engineering

T2 - 16th International Conference on Water Distribution System Analysis, WDSA 2014

Y2 - 14 July 2014 through 17 July 2014

ER -

Optimal water system operation using graph theory algorithms

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this