Dynamic Vehicle Routing Problem with Simultaneous Delivery and Pickup: Formulation and Resolution

This article treat a fundamental optimization problem encountered by most distribution companies. The Dynamic Vehicle Routing Problem with Simultaneous Delivery and Pickup (DVRPSDP) is a special variant of the VRP, in which new clients comes when the working day has already begun, and a number of vehicles have started their tours, in a way that each customer requires simultaneous delivery and pickup. These new customers must be included in the planned tours as early as possible with a minimum total travel distance. A rich literature review of the problem is carried out. A mathematical model has been formulated for the DVRPSDP, and it is tested with Cplex to provide optimal solutions for small instances. A memetic algorithm has been used to resolve the problem, the proposed algorithm is a combination of the genetic algorithm with a local search method.