An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization

09/02/2020
by   Willian C. S. Martinho, et al.
0

The gravity fed water distribution network design (WDND) optimization problem consists in determining the pipe diameters of a water network such that hydraulic constraints are satisfied and the total cost is minimized. Traditionally, such design decisions are made on the basis of expert experience. When networks increase in size, however, rules of thumb will rarely lead to near optimal decisions. Over the past thirty years, a large number of techniques have been developed to tackle the problem of optimally designing a water distribution network. In this paper, we tackle the NP-hard water distribution network design (WDND) optimization problem in a multi-period setting where time varying demand patterns occur. We propose a new simulation-based iterated local search metaheuristic which further explores the structure of the problem in an attempt to obtain high quality solutions. Computational experiments show that our approach is very competitive as it is able to improve over a state-of-the-art metaheuristic for most of the performed tests. Furthermore, it converges much faster to low cost solutions and demonstrates a more robust performance in that it obtains smaller deviations from the best known solutions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/20/2019

Water Distribution System Design Using Multi-Objective Genetic Algorithm with External Archive and Local Search

Hybridisation of the multi-objective optimisation algorithm NSGA-II and ...
research
09/19/2015

Exploiting Reduction Rules and Data Structures: Local Search for Minimum Vertex Cover in Massive Graphs

The Minimum Vertex Cover (MinVC) problem is a well-known NP-hard problem...
research
08/28/2021

A Visual Analytics System for Water Distribution System Optimization

The optimization of water distribution systems (WDSs) is vital to minimi...
research
02/05/2022

Solution of a Practical Vehicle Routing Problem for Monitoring Water Distribution Networks

In this work, we introduce a generalization of the well-known Vehicle Ro...
research
11/08/2019

Local Search for Group Closeness Maximization on Big Graphs

In network analysis and graph mining, closeness centrality is a popular ...
research
01/09/2019

The Fast Heuristic Algorithms and Post-Processing Techniques to Design Large and Low-Cost Communication Networks

It is challenging to design large and low-cost communication networks. I...
research
12/08/2019

ILS-SUMM: Iterated Local Search for Unsupervised Video Summarization

In recent years, there has been an increasing interest in building video...

Please sign up or login with your details

Forgot password? Click here to reset