DeepAI AI Chat
Log In Sign Up

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

by   Reza Atefi, et al.

In this work, we introduce a generalization of the well-known Vehicle Routing Problem for a specific application in the monitoring of a Water Distribution Network (WDN). In this problem, multiple technicians must visit a sequence of nodes in the WDN and perform a series of tests to check the quality of water. Some special nodes (i.e., wells) require technicians to first collect a key from a key center. The key must then be returned to the same key center after the test has been performed, thus introducing precedence constraints and multiple visits in the routes. To solve the problem, three mathematical models and an Iterated Local Search have been implemented. The efficiency of the proposed methods is demonstrated by means of extensive computational tests on randomly created instances, as well as on instances derived from a real-world case study.


page 1

page 2

page 3

page 4


New instances for maximum weight independent set from a vehicle routing application

We present a set of new instances of the maximum weight independent set ...

Path Planning Algorithms for Robotic Aquaculture Monitoring

Aerial drones have great potential to monitor large areas quickly and ef...

A Multi-label Time Series Classification Approach for Non-intrusive Water End-Use Monitoring

Numerous real-world problems from a diverse set of application areas exi...

Vehicle Routing Problem with Vector Profits (VRPVP) with Max-Min Criterion

This paper introduces a new routing problem referred to as the vehicle r...

Code Repositories


Public repository that makes available the randomly created instances used by Atefi et. al (2022) to solve the Vehicle Routing Problem for Water Distribution Networks (VRPWDN).

view repo