DYNAMIC PROGRAMMING MODEL FOR OPTIMAL LOCATION OF RUNWAY EXITS

The time required by a landing aircraft to clear the runway depends, among other things, on the type and location of runway exits available. For any given runway arrival pattern, in particular the aircraft separation times, the distribution of runway occupancy times determines the probability that the aircraft next in line for landing will be waved off. Horonjeff et al. (1959) prove that in the limit the expected runway acceptance rate is a function of the wave-speed runway exists so as to maximize the expected runway acceptance rate for a bivariate normal distribution of runway deceleration distances and times. This note shows how this optimization can more efficiently be done by the use of dynamic programming for any arbitrary joint probability distribution of deceleration distances and time and any number of exits. The paper also explores several extensions to the basic model.

• Corporate Authors:

  Pergamon Press, Incorporated

  Maxwell House, Fairview Park
  Elmsford, NY  United States  10523
• Authors:
  • Daellenbach, H G
• Publication Date: 1974-8

Media Info

• Pagination: p. 225-232
• Serial:
  • Transportation Research /UK/
  • Volume: 8
  • Issue Number: 3
  • Publisher: Pergamon Press, Incorporated

Subject/Index Terms

• TRT Terms: Acceptance; Aircraft separation; Airport runways; Deceleration; Dynamic programming; Landing; Location; Mathematical models
• Uncontrolled Terms: Models
• Old TRIS Terms: Aircraft landing; Deceleration rate
• Subject Areas: Aviation; Pavements; Terminals and Facilities;

Filing Info

• Accession Number: 00155487
• Record Type: Publication
• Source Agency: Massachusetts Institute of Technology
• Files: TRIS
• Created Date: Aug 15 1977 12:00AM