作者: Shan-Huen Huang , Tsan-Hwan Lin
DOI: 10.1080/21681015.2014.980444
关键词:
摘要: This research presents a solution process for Periodic Arc Routing Problem with Refill Points (PARPRP). The is natural extension of (ARP) and classified as an NP-hard problem. street tree watering problem used the case study. study tackles ARP requiring specified time horizon to fulfill it. A refill point in node graph at which vehicle capacity can be recovered long makes stop on strategy solving first transform into Vehicle Problem. Secondly, Ant Colony Optimization algorithm developed solve PARPRP because its remarkable capability establishment network routes. local search method incorporated reach minimum further improvement. Two sets benchmarks are verify computational results provided. outputs indicate that proposed methods yield pro...