Lower Bounds In An Hybrid Evolutionary Approach For The Pickup And Delivery Problem With Time Windows

In the single-vehicle pickup and delivery problem with time windows (1-PDPTW), a vehicle must serve a collection of transportation requests by taking loads from providers to customers satisfying precedence, capacity and time constraints. In this paper, we present a brief scientific literature review on the 1-PDPTW and we propose an evolutionary approach, based on lower bounds, to solve this problem. Our evolutionary approach uses an evolutionary algorithm, with special genetic operators to minimize computing time and Pareto dominance method to provide a set of satisfying and feasible solutions to the 1-PDPTW, minimizing the compromise between total travel distance and total tardiness time