174
A
vances
en
la
hidráulica
de
redes
de
distribución
de
agua
potable
distribución de agua. La razón principal es que los criterios de partición son diferentes en los
dos casos. En este trabajo se delinearon los criterios de particionamiento de grafos básicos
específicos para la sectorización de redes de agua potable y se propone un algoritmo que los
considera. En trabajos futuros se debe de considerar la inclusión de la viabilidad hidráulica
directamente en el algoritmo propuesto.
REFERENCIAS
Tzatchkov V.G., Alcocer-Yamanaka V.H., Ortiz V. Bourguett, “Graph theory based algo-
rithms for water distribution network sectorization projects”.
Proc. 8th ASCE Annual
water distribution systems analysis symposium
, Cincinnati, OH, USA, (2006), pp. 1-15.
Grayman W.M., Murray R., Savic D.A., “Effects of redesign of water systems for security
and water quality factors”,
Proc. EWRI-ASCE World Environmental and Water Resources
Congress
. Kansas City, MO, USA, (2009), pp. 504-514.
Di Nardo A., Di Natale M., Guida M., Musmarra D., “Water supply network protection
from malicious attacks by sectorization”,
Proc. VI EWRA International Symposium
, Ca-
tania, Italy, Vol. 6, (2011).
Schloegel K., Karypis G. and Kumar V., “Graph Partitioning for high performance scien-
tific simulations”, In:
Parallel Computing Handbook
, Dongarra J., Foster I., Fox G., Ken-
nedy K. and White A. (Eds.), Morgan Kaufmann (2000) pp. 491-541.
Fjallstrom P. O. “Algorithms for graph partitioning: A survey”,
Linkoping Electronic Articles
in Computer and Information Science
, Vol. 3, No. 10 (1998).
Sempewo J., Pathirana A. and Vairavamoorthy K. “Spatial analysis tool for development of
leakage control zones from the analogy of distributed computing”
Proc. 10th Annual
Water Distribution Systems Analysis Conference
, Kruger National Park, South Africa.
(2008), pp. 676-690.
Di Nardo A., Di Natale M., Santonastaso G. M. and Venticinque S. “Graph partitioning for
automatic sectorization of a water distribution system”,
Proc. 11th International Confe-
rence on Computing and Control for Water Industry
, Exeter, UK, Vol. 3 (2011), pp. 841-846.
Water Industry Research Ltd.,
A Manual of DMA Practice
, London, UK, Water Industry
Research, (1999).
Deuerlein, J.W. Decomposition Model of a General Water Supply Network Graph,
Journal
of Hydraulic Engineering
, Vol. 134, No. 6, (2008), pp. 822-832.
Di Nardo, A. & Di Natale, M. A heuristic design support methodology based on graph
theory for district metering of water supply networks,
Engineering Optimization
, Vol.
43, No. 2, (2011), pp. 193-211.
Rossman L.A., EPANET2 User’s Manual. Cincinnati, OH, USA, (2000).
Skiena S., Implementing Discrete Mathematics: Combinatorics and Graph Theory with
Mathematica. Redwood City, CA, Addison-Wesley (1990).
Dijkstra E.W. “A note on two problems in connexion with graphs”,
Numerische Mathematik
,
Vol. 1, (1959).
Diks K., Djidjev H. N., Sýkora O., Vrt’o I., “Edge separators of planar and outerplanar
graphs with applications”,
Journal of Algorithms
, Vol. 14, No. 2, (1993), pp 258–279.
