MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Department of Aeronautics and Astronautics
  • Flight Transportation Laboratory
  • Flight Transportation Laboratory Reports
  • View Item
  • DSpace@MIT Home
  • Department of Aeronautics and Astronautics
  • Flight Transportation Laboratory
  • Flight Transportation Laboratory Reports
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A Dynamic Programming approach to the Aircraft Sequencing problem

Author(s)
Psaraftis, Harilaos Nicholas; Psaraftis, Harilaos Nicholas.
Thumbnail
DownloadFTL_R_1978_04.pdf (7.030Mb)
Alternative title
Dynamic Programming algorithms for specially structured sequencing and routing problems in transportation
Other Contributors
Massachusetts Institute of Technology. Flight Transportation Laboratory
Metadata
Show full item record
Abstract
In this report, a number of Dynamic Programming algorithms for three versions of the Aircraft Sequencing problem are developed. In these, two alternative objectives are considered: How to land all of a prescribed set of airplanes as soon as possible, or alternatively, how to minimize the total passenger waiting time. All these three versions are "static", namely, no intermediate aircraft arrivals are accepted until our initial set of airplanes land. The versions examined are (a) The single runway-unconstrained case, (b) The single runway-Constrained Position Shifting (CPS) case and (c) The two-runway-unconstrained case. In the unconstrained case, no priority considerations exist for the airplanes of our system. By contrast, CPS prohibits the shifting of any particular airplane by more than a prespecified number of positions (MPS) from its initial position in the queue. All three algorithms exploit the fact that the airplanes in our system can be classified into a relatively small number of distinct categories and thus, realize drastic savings in computational effort, which is shown to be a polynomially bounded function of the number of airplanes per category. The CPS problem is formulated in (b) in a recursive way, so that for any value of MPS, the computational effort remains polynomially bounded as described above. All algorithms of this work are tested by various examples and the results are discussed. Implementation issues are considered and suggestions on how this work can be extended are made.
Description
This report is excerpted from the author's Ph. D. dissertation 'Dynamic programming algorithms for specially structured sequencing and routing problems in transportation' (Dept. of Ocean Engineering, M.I.T., September, 1978.)"
 
October 1978
 
Includes bibliographical references (p. 123-126)
 
Date issued
1978
URI
http://hdl.handle.net/1721.1/67911
Publisher
Cambridge, Mass. : Massachusetts Institute of Technology, Flight Transportation Laboratory, [1978]
Other identifiers
05819958
Series/Report no.
FTL report (Massachusetts Institute of Technology. Flight Transportation Laboratory) ; R78-4
Keywords
Dynamic programming, Airports, Air traffic control, Traveling-salesman problem, Traffic control

Collections
  • Flight Transportation Laboratory Reports

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Instagram YouTube

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.