Using Evolutionary Optimization Techniques for Scheduling Water Pipe Renewal Considering a Short Planning Horizon
Bibliographic record
Abstract
Abstract: The maintenance and management of underground infrastructures is a growing problem for a majority of municipalities. The maintenance costs are increasing while the financial resources of municipalities remain limited. Water distribution system (WDS) managers therefore need tools to assist them in the elaboration of pipe renewal management plans. In this article, results of a newly developed strategy for pipe renewal based on a cost function are presented. The strategy allows the minimization of a cost function while also considering hydraulic criterion. This strategy was tested on a short planning horizon of five years. The pipe number to be replaced and the optimal moment for renewal are identified using three different optimization techniques: IGA (Island Genetic Algorithm), NPGA-2 (Niched Pareto Genetic Algorithm 2), and NSGA-II (Non-dominated Sorting Genetic Algorithm-II). The proposed approach has five distinctive features: (1) it is coupled with a flexible evolutionary framework that allows the user to select any type of operator for IGA or any kind of multiobjective genetic algorithm; (2) it uses the hydraulic simulator Epanet2.0 which allows steady state or dynamic simulations; (3) it considers a probabilistic break model to evaluate the structural deterioration of pipes; (4) it integrates a Bayesian approach for the estimation of the pipe break model parameters that take into account the influence of inherent uncertainties related to the quality of data during the decision-making process; and (5) it simulates the variation of the pipe's roughness over the years. The developed strategy/model is explained using an example that allows us to elucidate its most important components. Simulation experiments on a small network (100 pipes) are presented. A comparison of three evolutionary algorithm results is provided. Tests showed that IGA performs well, but for networks of larger sizes, we recommend increasing the number of demes to reach better solutions. Higher quality results were achieved with NSGA-II than NPGA-2 on differently sized networks. We recommend the use the NSGA-II to optimize large WDS. Future developments for this strategy are also discussed.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".