Hosny, Manar I. and Mumford, Christine Lesley ![]() Item availability restricted. |
![]() |
Text
- Accepted Post-Print Version
Restricted to Repository staff only Download (445kB) |
Abstract
To the best of our knowledge, only a few researchers have experimented with genetic algorithms (GAs) to tackle the single vehicle pickup and delivery problem with time windows, possibly due to the large number of constraints involved and the difficulty in handling them. In particular, there is the difficulty in designing an appropriate genetic representation and intelligent genetic operators that are able to transfer the ordering characteristic of the parents to the offspring, while preserving the feasibility of the solution. In this research, we will experiment with a genetic encoding and operators specially designed to deal with the problem in hand. We will present a duplicate gene encoding that guarantees the satisfaction of the the precedence constraint, between the pickup and the delivery requests, throughout the search. We aim to show that GAs, if guided by some problem-specific information, will be able to handle this hard problem and possibly other similarly highly constrained problems.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Date Type: | Publication |
Status: | Published |
Schools: | Computer Science & Informatics |
Subjects: | Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software |
Publisher: | ACM |
ISBN: | 978-1-59593-698-1 |
Date of First Compliant Deposit: | 30 March 2016 |
Last Modified: | 20 Oct 2022 09:25 |
URI: | https://orca.cardiff.ac.uk/id/eprint/31888 |
Citation Data
Cited 9 times in Scopus. View in Scopus. Powered By ScopusĀ® Data
Actions (repository staff only)
![]() |
Edit Item |