An Evolutionary Algorithm and operators for the Airport Baggage Sorting Station Problem
Taking into consideration the constraints and objectives to appropriately assigning the available airport resources throughout the period of time an airport provides its services can greatly affect the quality of service which airlines and airports provide to their customers. The appropriate assignments can help airlines and airports to keep to published schedules, by minimising changes in these schedules, reducing delays and considering customers preferences when assigning the resources. Given the expected increases in civil air traffic, and the variety of resources, the complexities of resource scheduling and assignment continue to increase. For this reason, as well as the dynamic nature of the problems, scheduling and assignment are becoming increasingly more difficult.
An Evolutionary Algorithm (EA) is presented together with some different operators, which are used to find good solutions to the Airport Baggage Sorting Station Assignment Problem (ABSSAP) for when there are not sufficient resources up to when the number of resources is sufficient to full fill the demand on these resources. The contributions of these different operators are studied and compared to other approaches, giving insights into how the appropriate choice may depend upon the specifics of the problem at the time.
Ascó, A. (2019). An Evolutionary Algorithm and operators for the Airport Baggage Sorting Station Problem. Soft Computing, 23(20), 10055–10083. https://doi.org/10.1007/s00500-018-3561-7
|Journal Article Type||Article|
|Acceptance Date||Sep 27, 2018|
|Online Publication Date||Oct 13, 2018|
|Publication Date||Oct 1, 2019|
|Deposit Date||Oct 11, 2018|
|Publicly Available Date||Oct 15, 2018|
|Peer Reviewed||Peer Reviewed|
|Keywords||Airport baggage sorting station problem; Scheduling; Heuristics; Evolutionary algorithms|
An Evolutionary Algorithm and operators for the Airport Baggage
Publisher Licence URL