2024 Volume 15 Pages 1366-1378
The periodic capacitated arc routing problem (PCARP) is a challenging topic city logistics. PCARP is an extension of the well-known capacitated arc routing problem (CARP) to a multi-period horizon. The objective is to minimize the total distance of the trips to serve the required arcs. Due to the PCARP’s NP-hardness, we propose a hybrid iterated local search and randomized variable neighborhood descent (ILS-RVND) to solve it. The proposed ILS-RVND is tested on three sets of PCARP benchmark instances from the literature and compared with the state-of-the-art algorithms. The computational results show that the proposed heuristic is effective to solve the PCARP. We further apply the ILS-RVND to solve the real-world street washing planning problem in Taipei City. The result shows that the travel distance of street washing planning problem can be reduced by arranging and planning the new routes with our algorithm.
