Publication Type
Journal Article
Version
submittedVersion
Publication Date
9-2002
Abstract
In the pickup and delivery problem with time windows (PDPTW), vehicles have to transport loads from origins to destinations respecting capacity and time constraints. In this paper, we present a two-phase method to solve the PDPTW. In the first phase, we apply a novel construction heuristics to generate an initial solution. In the second phase, a tabu search method is proposed to improve the solution. Another contribution of this paper is a strategy to generate good problem instances and benchmarking solutions for PDPTW, based on Solomon' s benchmark test cases for VRPTW. Experimental results show that our approach yields very good solutions when compared with the benchmarking solutions.
Keywords
Pickup and delivery problem, vehicle routing problem, tabu search, test case generation
Discipline
Artificial Intelligence and Robotics | Operations Research, Systems Engineering and Industrial Engineering
Publication
International Journal on Artificial Intelligence Tools
Volume
11
Issue
3
First Page
455
Last Page
472
ISSN
0218-2130
Identifier
10.1142/S0218213002000988
Publisher
World Scientific Publishing
Citation
LAU, Hoong Chuin and LIANG, Zhe.
Pickup and delivery problem with time windows: Algorithms and test case generation. (2002). International Journal on Artificial Intelligence Tools. 11, (3), 455-472.
Available at: https://ink.library.smu.edu.sg/sis_research/163
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
http://doi.org/10.1142/S0218213002000988
Included in
Artificial Intelligence and Robotics Commons, Operations Research, Systems Engineering and Industrial Engineering Commons