Solving the schedule transition problem using optimization techniques
Name
FTL_R_1989_02.pdf
Size
4.04 MB
Format
Adobe PDF
Checksum (MD5)
fae5ef38d97bba9e52a18d9cde57520e
Author(s)
Fujiwara, Tsuneo
Date Issued
1988
Publisher
[Cambridge, Mass. : Massachusetts Institute of Technology, Flight Transportation Laboratory, 1988]
Series/Report no.
FTL report (Massachusetts Institute of Technology. Flight Transportation Laboratory) ; R89-2
Abstract
A new algorithm is introduced for effectively solving the airline schedule transition problem, which involves efficiently re-routing aircraft in order to balance the number and the types of aircraft at each station at the beginning of a new schedule with minimum cost. An extensive study was performed on using "pre-switches" - changing aircraft types of certain flights on the last day of the current schedule - and "post-switches" - changing aircraft types of certain flights on the first day of the new schedule - to balance the types of aircraft at each station for a pair of aircraft types. Several possibilities for extension to fleets of more than two aircraft types were examined. Airlines may use this algorithm in order to transition smoothly to the new schedule instead of relying on instincts of schedule analysts.
Description
Cover title
May 1989
Also issued as an M.S. thesis, Massachusetts Institute of Technology, Dept. of Civil Engineering, 1989
Includes bibliographical references
Subjects
Airlines
Aeronautics, Commercial
Production scheduling
Timetables
Mathematical models
Passenger traffic
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
