Evolving efficient airline schedules
Name
49094545-MIT.pdf
Description
Full printable version
Size
3.53 MB
Format
Adobe PDF
Checksum (MD5)
40825a54e0eebea0d487bd8e0eea674e
Author(s)
Lewis, Damon Marcus, 1977-
Advisor(s)
Patrick Henry Winston.
Date Issued
2000
Publisher
Massachusetts Institute of Technology
Abstract
This project is to solve the fleet scheduling problem for a large airline. This requires matching each fight in a schedule to a plane in the fleet that will fly the scheduled flight on a particular day. This thesis shows how to use the network flow model of a flight schedule in order to find the smallest fleet required to fly a schedule without dropping any flights. This is done by pruning the whole network to a smaller set of more relevant arcs. It is also the goal of the project to perform these tasks without requiring a large powerful computer or workstation.
Description
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.
Includes bibliographical references (p. 59).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
