Pipe smoothing genetic algorithm for least cost water distribution network design

This is the author accepted manuscript. The final version is available from the publisher via the DOI in this record.GECCO '13 Proceedings of the 15th annual conference on Genetic and evolutionary computation Amsterdam, Netherlands — July 06 - 10, 2013This paper describes the development of a Pipe Smoothing Genetic Algorithm (PSGA) and its application to the problem of least cost water distribution network design. Genetic algorithms have been used widely for the optimisation of both theoretical and real-world non-linear optimisation problems, including water system design and maintenance problems. In this work we propose a pipe smoothing based approach to the creation and mutation of chromosomes which utilises engineering expertise with the view to increasing the performance of the algorithm compared to a standard genetic algorithm. Both PSGA and the standard genetic algorithm were tested on benchmark water distribution networks from the literature. In all cases PSGA achieves higher optimality in fewer solution evaluations than the standard genetic algorithm

A simulation-based multi-criteria management system for optimal water supply under uncertainty

For cost and reliability efficiency, optimal design and operation of pressurized water distribution networks is highly important. However, optimizing such networks is still a challenge since it requires an appropriate determination of: (1) dimension of pipe / pump / tank - decision variables (2) cost / network reliability - objective functions and (3) limits or restrictions within which the network must operate - a given set of constraints. The costs mentioned here consist in general of capital, construction, and operation costs. The reliability of a network mainly refers to the intrinsic capability of providing water with adequate volume and a certain pressure to consumers under normal and extreme conditions. These contradicting objective functions are functions of network configuration regarding component sizes and network layout. Because considerable uncertainties finally render the overall task to a highly complex problem, most recent approaches mainly focus only on finding a trade-off between minimizing cost and maximizing network reliability. To overcome these limitations, a novel model system that simultaneously considers network configuration, its operation and the relevant uncertainties is proposed in this study. For solving this multi-objective design problem, a simulation-based optimization approach has been developed and applied. The approach couples a hydraulic model (Epanet) with the covariance matrix adaptation evolution strategy (CMA-ES) and can be operated in two different modes. These modes are (1) simulation–based Single-objective optimization and (2) simulation-based multi-objective optimization. Single-objective optimization yields the single best solution with respect to cost or network reliability, whereas multi-objective optimization produces a set of non-dominated solutions called Pareto optimal solutions which are trade-offs between cost and reliability. In addition, to prevent a seriously under-designed network, demand uncertainties was also taken into account through a so called “robustness probability” of the network. This consideration may become useful for a more reliable water distribution network. In order to verify the performance of the proposed approach, it was systematically tested on a number of different benchmark water distribution networks ranging from simple to complex. These benchmark networks are either gravity-fed or pumped networks which need to be optimally designed to supply urban or irrigation water demand under specific constraints. The results show that the new approach is able: • to solve optimization problems of pressurized water distribution network design and operation regarding cost and network reliability; • to directly determine the pumping discharge and head, thus allowing to select pumps more adequately; • to simulate time series of tank water level; • to eliminate redundant pipes and pumps to generate an optimal network layout; • to respond well to complex networks other than only to simple networks; • to perform with multiple demand loading; • to produce reliable Pareto optimal solutions regarding multi-objective optimization. In conclusion, the new technique can be successfully applied for optimization problems in pressurized water distribution network design and operation. The new approach has been demonstrated to be a powerful tool for optimal network design not only for irrigation but also for an urban water supply

Lost in optimisation of water distribution systems? A literature review of system design

This is the final version of the article. Available from MDPI via the DOI in this record.Optimisation of water distribution system design is a well-established research field, which has been extremely productive since the end of the 1980s. Its primary focus is to minimise the cost of a proposed pipe network infrastructure. This paper reviews in a systematic manner articles published over the past three decades, which are relevant to the design of new water distribution systems, and the strengthening, expansion and rehabilitation of existing water distribution systems, inclusive of design timing, parameter uncertainty, water quality, and operational considerations. It identifies trends and limits in the field, and provides future research directions. Exclusively, this review paper also contains comprehensive information from over one hundred and twenty publications in a tabular form, including optimisation model formulations, solution methodologies used, and other important details

Planar Graph Generation with Application to Water Distribution Networks

The study of network representations of physical, biological, and social phenomena can help us better understand their structure and functional dynamics as well as formulate predictive models of these phenomena. However, in some applications there is a deficiency in real-world data-sets for research purposes due to such reasons as the data sensitivity and high costs for data retrieval. Research related to water distribution networks often relies on synthetic data because the real-world is data is not publicly available due to the sensitivity towards theft and misuse. An important characteristic of water distribution systems is that they can be embedded in a plane, therefore to simulate these system we need realistic networks which are also planar. Currently available synthetic network generators can generate networks that exhibit realism but the planarity is not guaranteed. On the other hand, existing water network generators do not guarantee similarity with the input network and do not scale. In this thesis, we present a flexible method to generate realistic water distribution networks with optimized network parameters such as pipe and tank diameters, tank minimum and maximum levels, and pump sizes. Our model consists of three stages. First, we generate a realistic planar graph from a known water network using the multi-scale randomized edit- ing. Next, we add physical water network characteristics such as pumps, pipes, tanks, and reservoirs to the obtained topology to generate a realistic synthetic water distribution system that can be used for simulation. Finally, we optimize the operational parameters using EPANet simulation tool and multi-objective optimization solver to generate a network with maximum resilience and minimum cost

Markov dynamics as a zooming lens for multiscale community detection: non clique-like communities and the field-of-view limit

In recent years, there has been a surge of interest in community detection algorithms for complex networks. A variety of computational heuristics, some with a long history, have been proposed for the identification of communities or, alternatively, of good graph partitions. In most cases, the algorithms maximize a particular objective function, thereby finding the `right' split into communities. Although a thorough comparison of algorithms is still lacking, there has been an effort to design benchmarks, i.e., random graph models with known community structure against which algorithms can be evaluated. However, popular community detection methods and benchmarks normally assume an implicit notion of community based on clique-like subgraphs, a form of community structure that is not always characteristic of real networks. Specifically, networks that emerge from geometric constraints can have natural non clique-like substructures with large effective diameters, which can be interpreted as long-range communities. In this work, we show that long-range communities escape detection by popular methods, which are blinded by a restricted `field-of-view' limit, an intrinsic upper scale on the communities they can detect. The field-of-view limit means that long-range communities tend to be overpartitioned. We show how by adopting a dynamical perspective towards community detection (Delvenne et al. (2010) PNAS:107: 12755-12760; Lambiotte et al. (2008) arXiv:0812.1770), in which the evolution of a Markov process on the graph is used as a zooming lens over the structure of the network at all scales, one can detect both clique- or non clique-like communities without imposing an upper scale to the detection. Consequently, the performance of algorithms on inherently low-diameter, clique-like benchmarks may not always be indicative of equally good results in real networks with local, sparser connectivity.Comment: 20 pages, 6 figure

Sustaining Glasgow's Urban Networks: the Link Communities of Complex Urban Systems

As cities grow in population size and became more crowded (UN DESA, 2018), the main future challenges around the world will remain to be accommodating the growing urban population while drastically reducing environmental pressure. Contemporary urban agglomerations (large or small) constantly impose burden on the natural environment by conveying ecosystem services to close and distant places, through coupled human nature [infrastructure] systems (CHANS). Tobler’s first law in geography (1970) that states that “everything is related to everything else, but near things are more related than distant things” is now challenged by globalization. When this law was first established, the hypothesis referred to geological processes (Campbell and Shin, 2012, p.194) that were predominantly observed in pre-globalized economy, where freight was costly and mainly localized (Zhang et al., 2018). With the recent advances and modernisation made in transport technologies, most of them in the sea and air transportation (Zhang et al., 2018) and the growth of cities in population, natural resources and bi-products now travel great distances to infiltrate cities (Neuman, 2006) and satisfy human demands. Technical modernisation and the global hyperconnectivity of human interactions and trading, in the last thirty years alone resulted with staggering 94 per cent growth of resource extraction and consumption (Giljum et al., 2015). Local geographies (Kennedy, Cuddihy and Engel-Yan, 2007) will remain affected by global urbanisation (Giljum et al., 2015), and as a corollary, the operational inefficiencies of their local infrastructure networks, will contribute even more to the issues of environmental unsustainability on a global scale. Another challenge for future city-regions is the equity of public infrastructure services and policy creation that promote the same (Neuman and Hull, 2009). Public infrastructure services refer to services provisioned by networked infrastructure, which are subject to both public obligation and market rules. Therefore, their accessibility to all citizens needs to be safeguarded. The disparity of growth between networked infrastructure and socio-economic dynamics affects the sustainable assimilation and equal access to infrastructure in various districts in cities, rendering it as a privilege. Yet, the empirical evidence of whether the place of residence acts as a disadvantage to public service access and use, remains rather scarce (Clifton et al., 2016). The European Union recognized (EU, 2011) the issue of equality in accessibility (i.e. equity) critical for territorial cohesion and sustainable development across districts, municipalities and regions with diverse economic performance. Territorial cohesion, formally incorporated into the Treaty of Lisbon, now steers the policy frameworks of territorial development within the Union. Subsequently, the European Union developed a policy paradigm guided by equal access (Clifton et al., 2016) to public infrastructure services, considering their accessibility as instrumental aspect in achieving territorial cohesion across and within its member states. A corollary of increasing the equity to public infrastructure services among growing global population is the potential increase in environmental pressure they can impose, especially if this pressure is not decentralised and surges at unsustainable rate (Neuman, 2006). This danger varies across countries and continents, and is directly linked to the increase of urban population due to; [1] improved quality of life and increased life expectancy and/or [2] urban in-migration of rural population and/or [3] global political or economic immigration. These three rising urban trends demand new approaches to reimagine planning and design practices that foster infrastructure equity, whilst delivering environmental justice. Therefore, this research explores in depth the nature of growth of networked infrastructure (Graham and Marvin, 2001) as a complex system and its disparity from the socio-economic growth (or decline) of Glasgow and Clyde Valley city-region. The results of this research gain new understanding in the potential of using emerging tools from network science for developing optimization strategy that supports more cecentralized, efficient, fair and (as an outcome) sustainable enlargement of urban infrastructure, to accommodate new and empower current residents of the city. Applying the novel link clustering community detection algorithm (Ahn et al., 2010) in this thesis I have presented the potential for better understanding the complexity behind the urban system of networked infrastructure, through discovering their overlapping communities. As I will show in the literature review (Chapter 2), the long standing tradition of centralised planning practice relying on zoning and infiltrating infrastructure, left us with urban settlements which are failing to respond to the environmental pressure and the socio-economic inequalities. Building on the myriad of knowledge from planners, geographers, sociologists and computer scientists, I developed a new element (i.e. link communities) within the theory of urban studies that defines cities as complex systems. After, I applied a method borrowed from the study of complex networks to unpack their basic elements. Knowing the link (i.e. functional, or overlapping) communities of metropolitan Glasgow enabled me to evaluate the current level of communities interconnectedness and reveal the gaps as well as the potentials for improving the studied system’s performance. The complex urban system in metropolitan Glasgow was represented by its networked infrastructure, which essentially was a system of distinct sub-systems, one of them mapped by a physical and the other one by a social graph. The conceptual framework for this methodological approach was formalised from the extensively reviewed literature and methods utilising network science tools to detect community structure in complex networks. The literature review led to constructing a hypothesis claiming that the efficiency of the physical network’s topology is achieved through optimizing the number of nodes with high betweenness centrality, while the efficiency of the logical network’s topology is achieved by optimizing the number of links with high edge betweenness. The conclusion from the literature review presented through the discourse on to the primal problem in 7.4.1, led to modelling the two network topologies as separate graphs. The bipartite graph of their primal syntax was mirrored to be symmetrical and converted to dual. From the dual syntax I measured the complete accessibility (i.e. betweenness centrality) of the entire area and not only of the streets. Betweenness centrality of a node measures the number of shortest paths that pass through the node connecting pairs of nodes. The betweenness centrality is same as the integration of streets in space syntax, where the streets are analysed in their dual syntax representation. Street integration is the number of intersections the street shares with other streets and a high value means high accessibility. Edges with high betweenness are shared between strong communities. Based on the theoretical underpinnings of the network’s modularity and community structure analysed herein, it can be concluded that a complex network that is both robust and efficient (and in urban planning terminology ‘sustainable’) is consisted of numerous strong communities connected with each other by optimal number of links with high edge betweenness. To get this insight, the study detected the edge cut-set and vertex cut-set of the complex network. The outcome was a statistical model developed in the open source software R (Ihaka and Gentleman, 1996). The model empirical detects the network’s overlapping communities, determining the current sustainability of its physical and logical topologies. Initially, an assumption was that the number of communities within the infrastructure (physical) network layer were different from the one in the logical. They were detected using the Louvain method that performs graph partitioning on the hierarchical streets structure. Further, the number of communities in the relational network layer (i.e. accessibility to locations) was detected based on the OD accessibility matrix established from the functional dependency between the household locations and predefined points of interest. The communities from the graph of the ‘relational layer' were discovered with the single-link hierarchical clustering algorithm. The number of communities observed in the physical and the logical topologies of the eight shires significantly deviated

Hydrolink 2021/2. Artificial Intelligence

Topic: Artificial Intelligenc

Multi-directional maximum-entropy approach to the evolutionary design optimization of water distribution systems

A new multi-directional search approach that aims at maximizing the flow entropy of water distribution systems is investigated. The aim is to develop an efficient and practical maximum entropy based approach. The resulting optimization problem has four objectives, and the merits of objective reduction in the computational solution of the problem are investigated also. The relationship between statistical flow entropy and hydraulic reliability/failure tolerance is not monotonic. Consequently, a large number of maximum flow entropy solutions must be investigated to strike a balance between cost and hydraulic reliability. A multi-objective evolutionary optimization model is developed that generates simultaneously a wide range of maximum entropy values along with clusters of maximum and near-maximum entropy solutions. Results for a benchmark network and a real network in the literature are included that demonstrate the effectiveness of the procedure