Solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization

One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common ant colony optimization (ACO). ACO is a meta-heuristic algorithm inspired by the foraging behavior of real ants. Artificial ants are used to build a solution for the problem by using the pheromone information from previously generated solutions. An extensive numerical experiment is performed on 68 benchmark problem instances involving up to 200 customers available in the literature. The computational result shows that EACO not only presented a very satisfying scalability, but also was competitive with other meta-heuristic algorithms such as tabu search, large neighborhood search, particle swarm optimization and genetic algorithm for solving VRPSPD problems