Future aircraft networks and schedules

Show full item record

Please use this identifier to cite or link to this item: http://hdl.handle.net/1853/41221

Title: Future aircraft networks and schedules
Author: Shu, Yan
Abstract: This thesis has focused on an aircraft schedule and network design problem that involves multiple types of aircraft and flight service. First, this thesis expands a business model for integrating on-demand flight services with the traditional scheduled flight services. Then, this thesis proposes a three-step approach to the design of aircraft schedules and networks from scratch. After developing models in the three steps and creating large-scale instances of these models, this dissertation develops iterative algorithms and subproblem approaches to solving these instances, and it presents computational results of these large-scale instances. To validate the models and solution algorithms developed, this thesis compares the daily flight schedules that it designed with the schedules of the existing airlines. In addition, it discusses the implication of using new aircraft in the future flight schedules. Finally, future research in three areas--model, computational method, and simulation for validation--is proposed.
Type: Dissertation
URI: http://hdl.handle.net/1853/41221
Date: 2011-07-08
Publisher: Georgia Institute of Technology
Subject: Timetable model
Fleet assignment model
Frequency assignment model
Scheduling
Transportation engineering
Scheduling
Mathematical optimization
Algorithms
Department: Mathematics
Advisor: Committee Chair: Johnson, Ellis; Committee Co-Chair: Clarke, John-Paul; Committee Member: Ergun, Ozlem; Committee Member: Nemirovski, Arkadi; Committee Member: Smith, Barry
Degree: Ph.D.

All materials in SMARTech are protected under U.S. Copyright Law and all rights are reserved, unless otherwise specifically indicated on or in the materials.

Files in this item

Files Size Format View
Shu_Yan_201108_Phd.pdf 3.594Mb PDF View/ Open

This item appears in the following Collection(s)

Show full item record