Premium
An airline tail routing algorithm for periodic schedules
Author(s) -
Wollmer Richard D.
Publication year - 1990
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230200105
Subject(s) - schedule , computer science , routing (electronic design automation) , mathematical optimization , time horizon , set (abstract data type) , algorithm , mathematics , computer network , programming language , operating system
This paper gives a tail routing algorithm that meets a flight schedule with a minimum number of aircraft. The flight segments are identical from period to period and form a partially ordered set. The algorithm takes advantage of the periodic nature of the schedule to reduce the problem size. For a domestic airline whose schedule is identical each week, one may solve two problems, each with a seven and one half day time horizon instead of one larger problem over the entire time horizon which may be several months.