The aim of this master thesis is to analyze the airport gate assignment problem in Copenhagen Airport. Many real-world aspects must be taken into consideration when solving airport optimization problems. The model must be able to meet the needs of the airport, airlines and passengers, to the greatest possible extent. Efficient operational planning in relation to the gate assignment problem is therefor important. The objective of the task is to assign each flight to a suitable gate, while minimizing the total cost. The problem is formulated as a binary integer programming problem with a linear objective function and three constraints. To solve the problem, we suggest two metaheuristics, tabu search and genetic algorithm, since it can be a time-consuming process to solve the problem by binary integer programming. Disruptions such as flight delays and flight cancellations are a frequent occurrence in airport operations, in which case the related flights need to be appropriately reassigned to alternative gates. Therefore, the most effective way to handle gate re-assignments following flight delays is of great interest to the airport. In this master thesis we propose a re-assignment model, in which the objective function is to minimize the number of gate changes. The model is formulated as a multi-commodity-network-flow problem. An efficient plan, that cannot accommodate minor schedule disturbances will cause significant delays and gate re-assignments in the daily operations. An implementation of robustness is therefor presented to accommodate minor schedule disturbance.
|Educations||MSc in Business Administration and Mathematical Business Economics, (Graduate Programme) Final Thesis|
|Number of pages||118|