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

Full metadata record

DC Field	Value	Language
dc.contributor.advisor	Σιφαλέρας, Άγγελος	el
dc.contributor.author	Κυριακίδου, Αναστασία	el
dc.date.accessioned	2020-12-03T09:45:43Z	-
dc.date.available	2020-12-03T09:45:43Z	-
dc.date.issued	2020	el
dc.identifier.uri	http://dspace.lib.uom.gr/handle/2159/24619	-
dc.description	Διπλωματική εργασία--Πανεπιστήμιο Μακεδονίας, Θεσσαλονίκη, 2020.	el
dc.description.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.	en
dc.format.extent	86	el
dc.language.iso	en	en
dc.publisher	Πανεπιστήμιο Μακεδονίας	el
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Διεθνές	el
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	en
dc.subject	Aircraft landing scheduling	en
dc.subject	Matheuristics	en
dc.subject	Metaheuristics	en
dc.subject	Optimization	en
dc.subject	Variable Neighborhood Search	en
dc.title	A matheuristic approach for solving the aircraft landing scheduling problem	en
dc.type	Electronic Thesis or Dissertation	en
dc.type	Text	en
dc.contributor.department	Πρόγραμμα Μεταπτυχιακών Σπουδών Ειδίκευσης στην Εφαρμοσμένη Πληροφορική	el
Appears in Collections:	Π.Μ.Σ. στην Εφαρμοσμένη Πληροφορική (M)

Files in This Item:

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

Show simple item record Recommend this item

This item is licensed under a Creative Commons License

PSEPHEDA

Digital Library and Institutional Repository