Conference Proceeding Article
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.
Pickup and delivery problem, vehicle routing problem, tabu search, test case generation
Artificial Intelligence and Robotics | Operations Research, Systems Engineering and Industrial Engineering
Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence ICTAI 2001, November 7-9, Dallas, Texas
City or Country
LAU, Hoong Chuin and LIANG, Zhe.
Pickup and delivery problem with time windows: Algorithms and test case generation. (2001). Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence ICTAI 2001, November 7-9, Dallas, Texas. 333-340. Research Collection School Of Computing and Information Systems.
Available at: https://ink.library.smu.edu.sg/sis_research/1119
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.