Constructive and evolutionary algorithms for airport baggage sorting station and gate assignment problems

Asco, Amadeo (2013) Constructive and evolutionary algorithms for airport baggage sorting station and gate assignment problems. PhD thesis, University of Nottingham.

[img]
Preview
PDF (Amadeo Asco Signes' thesis) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (43MB) | Preview

Abstract

Correct assignment of airport resources can greatly affect the quality of service which airlines and airports provide to their customers. Good assignments can help airlines and airports to keep to published schedules, by minimising changes in these schedules and reducing delays. Given the expected increases in civil air traffic, 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.

The assignment of baggage sorting stations to flights is one of the resource assignment problems at an airport, and like many other real world optimisation problems, it naturally has several objectives, which conflict with each other. A model of the problem is presented, different approaches to obtaining good solutions are looked at and studied to gain an insight into their qualities. Furthermore, algorithms are studied to improve the already good solutions obtained by the approaches considered and their performance is studied where some characteristics of the problem change, such as the number of baggage sorting stations or the topology of the airport.

Changes to the flight schedule on the day of operation may invalidate previous assignments of flights to resources. These perturbations may not only affect the disrupted flights but also other flights already assigned. Some existing approaches are looked at, and others are suggested to take account of these potential perturbations at the time the assignments are generated with the aim of mitigating their detrimental effect on the day of operation.

The constructive search algorithms and robustness methods are potentially important in a wider variety of problems other than the Airport Baggage Sorting Station Assignment Problem (ABSSAP). By way of illustration, the same techniques are applied to the widely studied Airport Gate Assignment Problem (AGAP).

Item Type: Thesis (University of Nottingham only) (PhD)
Supervisors: Atkin, J.A.D.
Burke, E.K.
Landa-Silva, D.
Keywords: constructive, evolutionary, algorithms, baggage, airport, airports, sorting, gate, assignment, scheduling, data processing, luggage
Subjects: T Technology > TL Motor vehicles. Aeronautics. Astronautics
Faculties/Schools: UK Campuses > Faculty of Science > School of Computer Science
Item ID: 13784
Depositing User: EP, Services
Date Deposited: 13 Mar 2014 13:02
Last Modified: 26 Oct 2016 13:38
URI: http://eprints.nottingham.ac.uk/id/eprint/13784

Actions (Archive Staff Only)

Edit View Edit View