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

Authors:
Amadeo Ascó;Jason A. D. Atkin;Edmund K. Burke
Affiliations:
School of Computer Science, University of Nottingham, UK;School of Computer Science, University of Nottingham, UK;University of Stirling, UK
Venue:
SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
Year:
2012

Citing 5
Cited 0

Reducing bias and inefficiency in the selection algorithm

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Aircraft and Gate Scheduling Optimization at Airports

HICSS '04 Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3
The over-constrained airport gate assignment problem

Computers and Operations Research
A comparison of selection schemes used in evolutionary algorithms

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

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.