供水管网监控车辆路径问题的求解
Solution of a Practical Vehicle Routing Problem for Monitoring Water Distribution Networks
摘要：
在这项工作中，我们介绍了一个推广的著名的车辆路径问题的一个特定的应用程序中的供水管网（WDN）的监测。在这个问题中，多个技术人员必须访问WDN中的一系列节点，并执行一系列测试来检查水质。一些特殊节点（即，井）需要技术人员首先从密钥中心收集密钥。在测试完成后，密钥必须返回到相同的密钥中心，因此在路由中引入了优先约束和多次访问。为了解决这个问题，三个数学模型和迭代局部搜索已经实现。通过对随机创建的实例以及来自真实案例研究的实例进行广泛的计算测试，证明了所提出的方法的效率。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
