An evolutionary algorithm for the over-constrained airport baggage sorting station assignment problem

Citation

Asco A, Atkin JAD & Burke E (2012) An evolutionary algorithm for the over-constrained airport baggage sorting station assignment problem. In: Bui L, Ong Y, Hoai N, Ishibuchi H & Suganthan P (eds.) Simulated Evolution and Learning: 9th International Conference, SEAL 2012, Hanoi, Vietnam, December 16-19, 2012. Proceedings. Lecture Notes in Computer Science, 7673. 9th International Conference, SEAL 2012: Simulated Evolution and Learning, Hanoi, Vietnam, 16.12.2012-19.12.2012. Heidelberg: Springer, pp. 32-41. http://link.springer.com/chapter/10.1007%2F978-3-642-34859-4_4; https://doi.org/10.1007/978-3-642-34859-4_4

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.

Keywords
; Operations Research/Decision Theory; Organization/Planning; Operations research; Business logistics; Economics/Management Science; Operations Research/Decision Theory; Mathematical Programming