Zhang 2017 Memetic algorithm with route decomposing for periodic.pdf (2.35 MB)

Memetic algorithm with route decomposing for periodic capacitated arc routing problem

Download (2.35 MB)
journal contribution
posted on 31.03.2021, 03:23 by Yuzhou Zhang, Yi Mei, Ke Tang, Keqin Jiang
In this paper, the Periodic Capacitated Arc Routing Problem (PCARP) is investigated. PCARP is an extension of the well-known CARP from a single period to a multi-period horizon. In PCARP, two objectives are to be minimized. One is the number of required vehicles (nv), and the other is the total cost (tc). Due to the multi-period nature, given the same graph or road network, PCARP can have a much larger solution space than the single-period CARP counterpart. Furthermore, PCARP consists of an additional allocation sub-problem (of the days to serve the arcs), which is interdependent with the routing sub-problem. Although some attempts have been made for solving PCARP, more investigations are yet to be done to further improve their performance especially on large-scale problem instances. It has been shown that optimizing nv and tc separately (hierarchically) is a good way of dealing with the two objectives. In this paper, we further improve this strategy and propose a new Route Decomposition (RD) operator thereby. Then, the RD operator is integrated into a Memetic Algorithm (MA) framework for PCARP, in which novel crossover and local search operators are designed accordingly. In addition, to improve the search efficiency, a hybridized initialization is employed to generate an initial population consisting of both heuristic and random individuals. The MA with RD (MARD) was evaluated and compared with the state-of-the-art approaches on two benchmark sets of PCARP instances and a large data set which is based on a real-world road network. The experimental results suggest that MARD outperforms the compared state-of-the-art algorithms, and improves most of the best-known solutions. The advantage of MARD becomes more obvious when the problem size increases. Thus, MARD is particularly effective in solving large-scale PCARP instances. Moreover, the efficacy of the proposed RD operator in MARD has been empirically verified. Graphical abstract https://ars.els-cdn.com/content/image/1-s2.0-S1568494616304768-fx1_lrg.jpg © This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/


Preferred citation

Zhang, Y., Mei, Y., Tang, K. & Jiang, K. (2017). Memetic algorithm with route decomposing for periodic capacitated arc routing problem. Applied Soft Computing, 52, 1130-1142. https://doi.org/10.1016/j.asoc.2016.09.017

Journal title

Applied Soft Computing



Publication date






Publication status


Contribution type