Title :
A metaheuristic for the pickup and delivery problem with time windows
Author :
Li, Haibing ; Lim, Andrew
Author_Institution :
Dept. of Comput. Sci., Nat. Univ. of Singapore, Singapore
Abstract :
In this paper, we propose a metaheuristic to solve the pickup and delivery problem with time windows. Our approach is a tabu-embedded simulated annealing algorithm which restarts a search procedure from the current best solution after several non-improving search iterations. The computational experiments on the six newly-generated different data sets marked our algorithm as the first approach to solve large multiple-vehicle PDPTW problem instances with various distribution properties
Keywords :
computational complexity; genetic algorithms; heuristic programming; planning (artificial intelligence); search problems; simulated annealing; delivery problem; distribution properties; large multiple-vehicle PDPTW problem instances; metaheuristic; pickup problem; search iterations; search procedure; tabu-embedded simulated annealing algorithm; time windows; Computational modeling; Computer science; Distributed computing; Job shop scheduling; Logistics; Read only memory; Routing; Simulated annealing; Transportation; Vehicles;
Conference_Titel :
Tools with Artificial Intelligence, Proceedings of the 13th International Conference on
Conference_Location :
Dallas, TX
Print_ISBN :
0-7695-1417-0
DOI :
10.1109/ICTAI.2001.974461
