This paper presents an automatic algorithm for the identification of the minimum loops in a multi-source looped water distribution network. This algorithm, obtained as a generalization of that recently proposed by Creaco and Franchini (2014), has the novelty of being able to identify, automatically and in a single run, both the geometric and the fictitious loops of the network. Applications prove that the algorithm has acceptable computation times and can then be profitably adopted in the context of water distribution system analysis.
The identification of loops in water distribution networks
CREACO, ENRICO FORTUNATO;
2015-01-01
Abstract
This paper presents an automatic algorithm for the identification of the minimum loops in a multi-source looped water distribution network. This algorithm, obtained as a generalization of that recently proposed by Creaco and Franchini (2014), has the novelty of being able to identify, automatically and in a single run, both the geometric and the fictitious loops of the network. Applications prove that the algorithm has acceptable computation times and can then be profitably adopted in the context of water distribution system analysis.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
