The Library
A ripple-spreading genetic algorithm for the aircraft sequencing problem
Tools
Hu, Xiao-Bing and Di Paolo, Ezequiel A. (2011) A ripple-spreading genetic algorithm for the aircraft sequencing problem. Evolutionary Computation, Vol.19 (No.1). pp. 77-106. doi:10.1162/EVCO_a_00011 ISSN 1063-6560.
|
PDF
WRAP_hu_evco_a_00011.pdf - Published Version - Requires a PDF viewer. Download (1646Kb) |
Official URL: http://dx.doi.org/10.1162/EVCO_a_00011
Abstract
When genetic algorithms (GAs) are applied to combinatorial problems, permutation
representations are usually adopted. Asa result, suchGAsare often confronted with feasibility
and memory-efficiency problems. With the aircraft sequencing problem (ASP)
as a study case, this paper reports on a novel binary-representation-based GA scheme
for combinatorial problems. Unlike existing GAs for the ASP, which typically use
permutation representations based on aircraft landing order, the new GA introduces
a novel ripple-spreading model which transforms the original landing-order-based
ASP solutions into value-based ones. In the new scheme, arriving aircraft are projected
as points into an artificial space. A deterministic method inspired by the natural
phenomenon of ripple-spreading on liquid surfaces is developed, which uses a few
parameters as input to connect points on this space to form a landing sequence. A
traditional GA, free of feasibility and memory-efficiency problems, can then be used to
evolve the ripple-spreading related parameters in order to find an optimal sequence.
Since the ripple-spreadingmodel is the centerpiece of the new algorithm, it is called the
ripple-spreading GA (RSGA). The advantages of the proposed RSGA are illustrated by
extensive comparative studies for the case of the ASP.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics | ||||
Divisions: | Faculty of Science, Engineering and Medicine > Engineering > Engineering | ||||
Library of Congress Subject Headings (LCSH): | Genetic algorithms, Combinatorial enumeration problems | ||||
Journal or Publication Title: | Evolutionary Computation | ||||
Publisher: | M I T Press | ||||
ISSN: | 1063-6560 | ||||
Official Date: | 2011 | ||||
Dates: |
|
||||
Volume: | Vol.19 | ||||
Number: | No.1 | ||||
Page Range: | pp. 77-106 | ||||
DOI: | 10.1162/EVCO_a_00011 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Date of first compliant deposit: | 18 December 2015 | ||||
Date of first compliant Open Access: | 18 December 2015 | ||||
Funder: | Engineering and Physical Sciences Research Council (EPSRC) | ||||
Grant number: | EP/C51632X/1 (EPSRC) |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |
Downloads
Downloads per month over past year