A metaheuristic for the pickup and delivery problem with time windows

Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/40404

DC Field	Value
dc.title	A metaheuristic for the pickup and delivery problem with time windows
dc.contributor.author	Li, H.
dc.contributor.author	Lim, A.
dc.date.accessioned	2013-07-04T08:03:32Z
dc.date.available	2013-07-04T08:03:32Z
dc.date.issued	2001
dc.identifier.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.
dc.identifier.issn	10636730
dc.identifier.uri	http://scholarbank.nus.edu.sg/handle/10635/40404
dc.description.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.
dc.source	Scopus
dc.type	Conference Paper
dc.contributor.department	COMPUTER SCIENCE
dc.description.sourcetitle	Proceedings of the International Conference on Tools with Artificial Intelligence
dc.description.page	160-167
dc.description.coden	PCTIF
dc.identifier.isiut	NOT_IN_WOS
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check