A Memetic Algorithm with a New Split Scheme for Solving Dynamic Capacitated Arc Routing Problems

Capacitated arc routing problems (CARPs) are usually modeled as static problems, where all information about the problem is known in advance and assumed to remain constant during the course of optimization. However, in practice, many factors such as demand, road accessibility, vehicle availability etc. change during the course of a mission and the routes of each vehicle must be reconfigured dynamically. This problem is referred to as dynamic capacitated arc routing problem (DCARP). In this study, a memetic algorithm with a new split scheme for DCARPs is proposed. This algorithm is capable to solve DCARPs with variations in vehicle availability, road accessibility, added/canceled tasks or demands and traffic congestions. The algorithm is also capable of solving static CARPs. The performance of the algorithm is reported on a 10-node and three 100-node examples in order to demonstrate the efficacy of the algorithm in solving static and dynamic problems.