On some optimization problems involving NAIA air traffic network

Date of Publication

2018

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics with specialization in Business Applications

College

College of Science

Department/Unit

Mathematics and Statistics

Abstract/Summary

The works of Ganu [21], Pien and et.al [33], and Agustin and et.al. [2] involved formulation of linear programming (LP) models that are focused on maximizing the ow of tra c and minimizing cost of ight delays. This paper intends to formulate similar models that intend to present solutions to problems involving Ninoy Aquino International Airport (NAIA) air tra c network. Speci cally, we consider maximizing tra c ow and minimizing the total ground and air delay cost at the four terminals of NAIA. We present a comparison between the generated solutions from these models and data that were generated from the Civil Aeronautics Board (CAB), Civil Aviation Authority of the Philippines (CAAP), and Manila International Airport Authority (MIAA). The current number of movements per hour in each terminal from the solutions obtained is inadequate which leads to congestion. One of the models assigned a negative or positive delay to con icting ights to satisfy the airport capacity and to minimize the total delay cost. On the other hand, the other model shows that in order to alleviate congestion, additional number of ights must be added. It also yielded solutions that are signicantly correlated with the collected data from MIAA and CAAP.

Abstract Format

html

Language

English

Format

Electronic

Accession Number

CDTU017653

Shelf Location

Archives, The Learning Commons, 12F, Henry Sy Sr. Hall

This document is currently not available here.

Share

COinS