Please use this identifier to cite or link to this item:
|Title:||Pickup and delivery with time windows: Algorithms and test case generation||Authors:||Lau, H.C.
|Issue Date:||2001||Citation:||Lau, H.C.,Liang, Z. (2001). Pickup and delivery with time windows: Algorithms and test case generation. Proceedings of the International Conference on Tools with Artificial Intelligence : 333-340. ScholarBank@NUS Repository.||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.||Source Title:||Proceedings of the International Conference on Tools with Artificial Intelligence||URI:||http://scholarbank.nus.edu.sg/handle/10635/40402||ISSN:||10636730|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 22, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.