|Appears in Collections:||Computing Science and Mathematics Book Chapters and Sections|
|Title:||An evolutionary algorithm for the over-constrained airport baggage sorting station assignment problem|
Atkin, Jason A D
|Citation:||Asco A, Atkin JAD & Burke E (2012) An evolutionary algorithm for the over-constrained airport baggage sorting station assignment problem In: Bui LT, Ong YS, Hoai NX, Ishibuchi H, Suganthan PN (ed.) Simulated Evolution and Learning: 9th International Conference, SEAL 2012, Hanoi, Vietnam, December 16-19, 2012. Proceedings, Heidelberg: Springer. 9th International Conference, SEAL 2012: Simulated Evolution and Learning, 16.12.2012 - 19.12.2012, Hanoi, Vietnam, pp. 32-41.|
|Series/Report no.:||Lecture Notes in Computer Science, 7673|
|Abstract:||Airport baggage sorting stations are the places at which the baggage for each flight accumulates for loading into containers or directly onto the aircraft. In this paper the multi-objective and multi-constraint problem of assigning Baggage Sorting Stations in an Airport is defined and an Evolutionary Algorithm is presented, which uses a number of different operators to find good solutions to the problem. The contributions of these different operators are studied, giving insights into how the appropriate choice may depend upon the specifics of the problem at the time.|
|Rights:||The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.|
|An evolutionary algorithm for the over-constrained airport baggage sorting station.pdf||847.77 kB||Adobe PDF||Under Embargo until 31/12/2999 Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependant on the depositor still being contactable at their original email address.
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.