Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.

Explore

Global maximum entropy minimum cost design of water distribution systems

Tanyimboh, Tiku and Saleh, Salah H A (2011) Global maximum entropy minimum cost design of water distribution systems. In: ASCE/EWRI World Environmental & Water Resources Congress. American Society of Civil Engineers.

Full text not available in this repository. Request a copy from the Strathclyde author

Abstract

The problem of designing water distribution systems to deliver the Global Maximum Entropy (GME) flows was hitherto hampered by the multiplicity of feasible flow directions associated with looped water distribution networks. This paper addresses this issue by presenting a new multi‐objective approach to the design optimization of water distribution systems based on a robust and fast genetic algorithm, namely NSGA‐II. The decision variables used in the approach are standard discrete pipe diameters. By integrating a hydraulic simulator with an algorithm for detection of flow directions, the approach is capable of achieving the Global Maximum Entropy Minimum Cost (GMEMC) design for a fixed layout. To ensure that the achieved design is near global, the approach does not assign penalties to any generated design. The new approach is demonstrated by designing a well known hypothetical network in the literature.