Heuristic approach for the optimization of the dynamic multi-vehicle pickup and delivery problem with Time Windows

The PDPTW (Pickup and delivery problem with Time Windows) is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints. In this paper, we present an approach based on genetic algorithm, aggregation method and minimum values for optimization of the dynamic multi-pickup and delivery problem with time windows. We propose in this sense a brief literature review of the PDPTW, present our approach to give a satisfying solution to the m-PDPTW, minimizing the compromise between the total travel cost and the total tardiness time.