An Integrated Assignment Problem Considering Both Airport Gate and Runway Usage
Date Issued
2016
Date
2016
Author(s)
Liu, Meng-Han
Abstract
The assignment of flights over gates and runways can be critical for the operation of an airport, which affects its capacity, scheduling and deployment of the associated airlines, and consequently the level of service to passengers. The assignment problem can be complicated because of numerous possible usage patterns over the spatiotemporal combinations of facility occupation, especially when there exists the dependence between runways and gates and/or runways themselves. However, such dependence has been rarely discussed in the literature. As a result, this study proposed an analytical framework to model comprehensive assignment over both gate assignment and runway usage. The time-space network was designed to present the operation framework. The mathematical binary integer programing was formulated to solve the problem. However, the number of time nodes in the time-space network increases rapidly, causing great computational inefficiency. Therefore, genetic algorithm is approached to solve this problem much more effectively and efficiently. Two case studies on Taipei Songshan Airport (TSA) and Taoyuan International Airport (TPE) are applied to the model in this research. Empirical case studies indicated that the developed model can help airport to assign the flights and find out the idle time on gate to serve more additional flights under current infrastructure layout. For the airport which suffer the congestion or shortage on gate, the model can be also be used to solve the problem.
Subjects
gate assignment
runway capacity
time-space network
genetic algorithm
SDGs
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-105-R03521518-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):b13cb4942aec8477be26ad7d3b80c5c5