The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms

Hosny, Manar Ibrahim and Mumford, Christine Lesley ORCID: https://orcid.org/0000-0002-4514-0272 2010. The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms. Journal of Heuristics 16 (3) , pp. 417-439. 10.1007/s10732-008-9083-1

Full text not available from this repository.

Abstract

The single vehicle pickup and delivery problem with time windows is an important practical problem, yet only a few researchers have tackled it. In this research, we compare three different approaches to the problem: a genetic algorithm, a simulated annealing approach, and a hill climbing algorithm. In all cases, we adopt a solution representation that depends on a duplicate code for both the pickup request and its delivery. We also present an intelligent neighborhood move, that is guided by the time window, aiming to overcome the difficult problem constraints efficiently. Results presented herein improve upon those that have been previously published.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Uncontrolled Keywords:	Pickup and delivery problem with time windows; Dial-a-ride; Vehicle routing; Genetic algorithms; Simulated annealing; Hill climbing
Additional Information:	From the issue entitled "Special Issue on Recent Advances in Metaheuristics. Guest Editors: Teodor Gabriel Crainic, Michel Gendreau, and Louis-Martin Rousseau"
Publisher:	Springer
ISSN:	1381-1231
Last Modified:	18 Oct 2022 13:29
URI:	https://orca.cardiff.ac.uk/id/eprint/14120

Citation Data

Cited 23 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item