A Novel Lazy Serpent Algorithm for the Prioritization of Leak Repairs in Water Networks

Maximizing benefit from budget allocation is a major challenge for municipalities in the modern era. This is especially significant when it comes to infrastructure network management such as water distribution networks. The main challenges of water distribution networks are leakage and leak repairs. Municipalities commonly use first-in-first-out approaches to determine which leaks to allocate budget for first. Yet, the deterioration of leaks is not linear through time and requires a more in-depth assessment of the condition of the leak. Therefore, this article presents two prioritization approaches for the scheduling of leaks while incorporating deterioration over time. This paper proposes and compares two optimization techniques: (1) a well-known genetic algorithm and (2) a novel approach named the Lazy Serpent Algorithm. The Lazy Serpent Algorithm has proved capable of surpassing the genetic algorithm in determining a more optimal order by using much less computation time. The Lazy Serpent Algorithm helps municipalities better distribute their resources to maximize their desired benefits.