Taxiway Aircraft Traffic Scheduling: A Model and Solution Algorithms

dc.contributorWang, Xiu
dc.creatorTian, Chunyu
dc.date.accessioned2012-10-19T15:29:17Z
dc.date.accessioned2012-10-22T17:59:52Z
dc.date.accessioned2017-04-07T20:00:37Z
dc.date.available2012-10-19T15:29:17Z
dc.date.available2012-10-22T17:59:52Z
dc.date.available2017-04-07T20:00:37Z
dc.date.created2011-08
dc.date.issued2012-10-19
dc.description.abstractWith the drastic increase in the demand for air travel, taxiway aircraft traffic scheduling is becoming increasingly important in managing air traffic. In order to reduce traffic congestion on taxiways, this thesis proposes a tool for air traffic controllers to use in decision making: a taxiway air traffic model developed using Mixed Integer Programming (MIP) that can be applied to a rolling time horizon. The objective of this model is to minimize the total taxi time, and the output is a schedule and route for each aircraft. This MIP model assumes that only the origin and destination of each aircraft is fixed; due to some uncertain factors in the air arrival and departure process, it allows for the departure time and arrival time to vary within a certain time window. This MIP model features aircraft type, and also incorporates runway crossings and runway separations. The model is programmed using C++ and Solved in CPLEX 12.1. Runways 26R and 26L of George Bush International Airport are used to find solutions. The author presents a rolling horizon method by dividing the large scheduling issue into smaller time interval problems according to the scheduled times of departure or arrival. A bound is also proposed based on the discretized time interval problems. By using partial data from George Bush International Airport (IAH), solutions are obtained. The results are compared with the bound and show fairly high optimality. Compared with the previous research, this thesis presents a model with more flexibility by considering different operations. By using the rolling horizon method, the problem is broken into smaller units that can be solved efficiently without losing much optimality.
dc.identifier.urihttp://hdl.handle.net/1969.1/ETD-TAMU-2011-08-10036
dc.language.isoen_US
dc.subjectTaxiway Planning
dc.subjectMixed Integer Programming
dc.titleTaxiway Aircraft Traffic Scheduling: A Model and Solution Algorithms
dc.typeThesis

Files