A matheuristic approach for solving the aircraft landing scheduling problem

Please use this identifier to cite or link to this item: http://dspace.lib.uom.gr/handle/2159/24619

Author:	Κυριακίδου, Αναστασία
Title:	A matheuristic approach for solving the aircraft landing scheduling problem
Date Issued:	2020
Department:	Πρόγραμμα Μεταπτυχιακών Σπουδών Ειδίκευσης στην Εφαρμοσμένη Πληροφορική
Supervisor:	Σιφαλέρας, Άγγελος
Abstract:	Aircraft landing scheduling (ALS) is a contemporary NP-hard problem, arising from the continuous growth of the air traffic. The purpose of this thesis is the implementation and application of a matheuristic approach, using VNS algorithm’s variants, BVNS, VND and RVNS, along with interior-point method from mathematical programming, as well as the evaluation of solving the static case of this problem, using the Python programming language.
Keywords:	Aircraft landing scheduling Matheuristics Metaheuristics Optimization Variable Neighborhood Search
Information:	Διπλωματική εργασία--Πανεπιστήμιο Μακεδονίας, Θεσσαλονίκη, 2020.
Rights:	Attribution-NonCommercial-NoDerivatives 4.0 Διεθνές
Appears in Collections:	Π.Μ.Σ. στην Εφαρμοσμένη Πληροφορική (M)

Files in This Item:

File	Description	Size	Format
KyriakidouAnastasiaMsc2020.pdf		1.74 MB	Adobe PDF	View/Open

This item is licensed under a Creative Commons License

PSEPHEDA