Improved Tabu Search In An Hybrid Evolutionary Approach For The Pickup And Delivery Problem With Time Windows

摘要

In This paper we present an unproved tabu search in an nybrid evolutionary approach for the single-vehicle Pickup and Delivery Problem with Time Windows (1-PDPTW). In the 1-PDPTW a vehicle must serve a collection of transportation requests by taking loads from providers to customers satisfying precedence, capacity and time constraints. This paper purposes a brief review the scientific literature of the 1-PDPTW, presents the hybrid evolutionary approach to solve this problem and details the improved tabu search. Our hybrid evolutionary approach use evolutionary algorithm, with special genetic operators, tabu search, construction heuristics. Pareto dominance method to provide a set of satisfying and feasible solutions to the 1-PDPTW minimizing total traveled distance, total waiting time and total tardiness time.