GENETIC ALGORITHM APPROACH TO AIRCRAFT GATE REASSIGNMENT PROBLEM

The aircraft gate reassignment problem occurs when the departure of an incoming aircraft is delayed or a delay occurs in flight. If the delay is significant enough to delay the arrival of subsequent incoming aircraft at the assigned gate, the airline must revise the gate assignments to minimize extra delay times. This paper describes a genetic algorithm approach to solving the gate reassignment problem. By using a global search technique on quantified information, this genetic algorithm approach can efficiently find minimum extra delayed time solutions that are as effective or more effective than solutions generated by experienced gate managers.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/oclc/8674831
• Corporate Authors:

  American Society of Civil Engineers

  1801 Alexander Bell Drive
  Reston, VA  United States  20191-4400
• Authors:
  • Gu, Y
  • Chung, C A
• Publication Date: 1999-9

Language

• English

Media Info

• Features: Appendices; Figures; References; Tables;
• Pagination: p. 384-389
• Serial:
  • Journal of Transportation Engineering
  • Volume: 125
  • Issue Number: 5
  • Publisher: American Society of Civil Engineers
  • ISSN: 0733-947X
  • Serial URL: https://ascelibrary.org/journal/jtepbs

Subject/Index Terms

• TRT Terms: Aircraft gates; Airlines; Airport operations; Arrivals and departures; Genetic algorithms; Mathematical models; Optimization; Schedules and scheduling; Simulation
• Uncontrolled Terms: Reassignment
• Subject Areas: Aviation; Terminals and Facilities;

Filing Info

• Accession Number: 00767862
• Record Type: Publication
• Contract Numbers: NSF-DMS 9313013, RP910666
• Files: TRIS
• Created Date: Sep 1 1999 12:00AM