Ant Colony Optimization and Genetic Algorithm Approaches to Solving the Split Delivery Vehicle Routing Problem

摘要

The Split Delivery Vehicle Routing Problem (SDVRP) allows customers to be visited by more than one vehicle. Two solution approaches are presented and computational results are provided for benchmark problems from the literature. The first solution method is an Ant Colony Optimization method, and the second solution method is a hybrid Genetic Algorithm method. The computational results indicate that the two approaches are competitive in both solution quality and solution time. In some instances, the Ant Colony Optimization method achieves the best known results to date for the benchmark problems.