In this paper we present an improved tabu search in an hybrid 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.
Improved tabu search in an hybrid evolutionary approach for the pickup and delivery problem with time windows
2005-01-01
420573 byte
Conference paper
Electronic Resource
English
Solving the pickup and delivery problem with time windows using reactive tabu search
Online Contents | 2000
|Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
Online Contents | 1993
|Freight Consolidation Problem with Time Windows, Pickup and Delivery Sequence
DOAJ | 2019
|