Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/63989
Title: Optimisation of aircrafts during landings - a static case
Authors: Vivek Ravi Sitaraman
Keywords: DRNTU::Engineering::Systems engineering
Issue Date: 2015
Abstract: This paper simulates an aircraft landing problem in which the total deviation cost of actual landing times from the target landing times is minimised under a wide variety of constraints. It is essentially a Mixed Integer zero-one programming where the most optimal landing time is found for a set of planes that possess realistic and predetermined time window periods and the separation times that are strictly adhered to. The programming language used is Python with an addition compiler known as NumPy that aids in mathematical models. The program was compiled in Gurobi. This paper gives a brief introduction of Air Traffic Management as a whole followed by reviewing important definitions and concepts. Previous research undertaken by several authors in the Operations Research field is studied in Chapter 2. Chapter 3 formulates the constraints in a thorough logical manner and the objective function is clearly defined. Chapter 4 implements the problem in Gurobi and important functions of Python are explained. Finally in Chapter 5, the results that have been generated is analysed briefly and several additional constraints and objective functions are discussed as well. All the programming code, results and the data sets used are all provided in the Appendix section at the end of the report.
URI: http://hdl.handle.net/10356/63989
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:MAE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
Vivek_FYP.pdf
  Restricted Access
Main Article2.64 MBAdobe PDFView/Open

Page view(s) 20

160
Updated on Dec 4, 2020

Download(s) 50

27
Updated on Dec 4, 2020

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.