General Edge Assembly Crossover-Driven Memetic Search for Split Delivery Vehicle Routing

The split delivery vehicle routing problem is a variant of the well-known vehicle routing problem, where each customer can be visited by several vehicles. The problem has many practical applications, but it is computationally challenging. This paper presents an effective memetic algorithm for solving the problem with a fleet of limited or unlimited vehicles. The algorithm features a general edge assembly crossover to generate promising offspring solutions from the perspective of assembling suitable edges and an effective local search to improve each offspring solution. The algorithm is further reinforced by a feasibility restoring procedure, a diversification-oriented mutation, and a quality-and-distance pool updating technique. Extensive experiments on 324 benchmark instances indicate that our algorithm is able to update 143 best upper bounds in the literature and match the best results for 156 other instances. Additional experiments are presented to obtain insight into the roles of the key search ingredients of the algorithm. The method was ranked second in the SDVRP track at the 12th DIMACS Implementation Challenge on Vehicle Routing Problems.

Automated summary

This paper presents a memetic algorithm for solving the split delivery vehicle routing problem with limited or unlimited vehicles. The algorithm generates and improves solutions using strategies such as edge assembly crossover and local search, and is enhanced by various techniques. Extensive experiments show that the algorithm achieves optimal results on multiple instances. Additional experiments are conducted to study the key components of the algorithm.