Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/40404
| Title: | A metaheuristic for the pickup and delivery problem with time windows | Authors: | Li, H. Lim, A. |
Issue Date: | 2001 | Citation: | Li, H.,Lim, A. (2001). A metaheuristic for the pickup and delivery problem with time windows. Proceedings of the International Conference on Tools with Artificial Intelligence : 160-167. ScholarBank@NUS Repository. | 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. | Source Title: | Proceedings of the International Conference on Tools with Artificial Intelligence | URI: | http://scholarbank.nus.edu.sg/handle/10635/40404 | ISSN: | 10636730 |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.