Articles | Volume 15, issue 1
https://doi.org/10.5194/dwes-15-1-2022
https://doi.org/10.5194/dwes-15-1-2022
Technical note
 | 
17 Jun 2022
Technical note |  | 17 Jun 2022

Technical note: Graph-theory-based heuristics to aid in the implementation of optimized drinking water network sectorization

Marius Møller Rokstad and Karel van Laarhoven

Download

Interactive discussion

Status: closed

Comment types: AC – author | RC – referee | CC – community | EC – editor | CEC – chief editor | : Report abuse
  • RC1: 'Comment on dwes-2021-11', Anonymous Referee #1, 04 Feb 2022
    • AC1: 'Reply on RC1', Marius Rokstad, 24 Mar 2022
  • RC2: 'Comment on dwes-2021-11', Anonymous Referee #2, 09 Feb 2022
    • AC2: 'Reply on RC2', Marius Rokstad, 24 Mar 2022

Peer review completion

AR: Author's response | RR: Referee report | ED: Editor decision | EF: Editorial file upload
ED: Reconsider after major revisions (27 Mar 2022) by Luuk Rietveld
AR by Marius Rokstad on behalf of the Authors (05 May 2022)  Author's response   Author's tracked changes   Manuscript 
ED: Publish subject to technical corrections (23 May 2022) by Luuk Rietveld
AR by Marius Rokstad on behalf of the Authors (26 May 2022)  Author's response   Manuscript 
Download
Short summary
Sectorizing a network into district metered areas is a key technique for water loss reduction. Sectorization is a well-studied problem. Optimization techniques can be used to find solutions to such problems, but doing so within a reasonable time remains a challenge. We introduce two heuristic tricks to modify a basic evolutionary algorithm that solves this problem. The tricks reduce the time needed to find good solutions but also lead to solutions that better match drinking water practice.