Hybrid Metaheuristics to Aid Runway Scheduling at London Heathrow Airport

Published Online:https://doi.org/10.1287/trsc.1060.0163

References

  • Abela J., Abramson D., Krishnamoorthy M., de Silva A., Mills G. Computing optimal schedules for landing aircraft. Twelfth National Conf. Australian Soc. Oper. Res. (1993) Adelaide, AustraliaGoogle Scholar
  • Anagnostakis I., Clarke J.-P. Runway operations planning, a two-stage heuristic algorithm. AIAA Aircraft, Tech., Integration Oper. Forum (2002) Los Angeles, CAGoogle Scholar
  • Anagnostakis I., Clarke J.-P. Runway operations planning: A two-stage solution methodology. Thirty Sixth Hawaii Internat. Conf. System Sciences (HICSS-36) (2003) HIGoogle Scholar
  • Anagnostakis I., Clarke J.-P., Böhme D., Völckers U. Runway operations planning and control, sequencing and scheduling. Thirty Fourth Hawaii Internat. Conf. System Sciences (HICSS-34) (2001) Maui, HawaiiGoogle Scholar
  • Anagnostakis I., Idris H. R., Clarke J.-P., Feron E., Hansman R. J., Odoni A. R., Hall W. D. Computing optimal schedules for landing aircraft. Third FAA/Eurocontrol Internat. Air Traffic Management R&D Seminar (ATM2000) (2000) Naples, ItalyGoogle Scholar
  • Atkin J. A. D., Burke E. K., Greenwood J. S., Reeson D. A meta-heuristic approach to departure scheduling at London Heathrow Airport. Ninth Internat. Conf. Comput.-Aided Scheduling Public Transport (CASPT2004) (2004) San Diego, CAGoogle Scholar
  • Beasley J. E., Sonander J., Havelock P. Scheduling aircraft landings at London Heathrow using a population heuristic. J. Oper. Res. Soc. (2001) 52:483–493CrossrefGoogle Scholar
  • Beasley J. E., Krishnamoorthy M., Sharaiha Y. M., Abramson D. Scheduling aircraft landings—The static case. Transportation Sci. (2000) 34:180–197LinkGoogle Scholar
  • Bianco L., Dell’Olma P., Giordani S. Minimizing total completion time subject to release dates and sequence-dependent processing times. Ann. Oper. Res. (1999) 86:393–415CrossrefGoogle Scholar
  • Burke E. K., Kendall G.Search Methodologies (2005) (Springer, New York) CrossrefGoogle Scholar
  • Craig A., Ketzscer R., Leese R. A., Noble S. D., Parrott K., Preater J., Wilson R. E., Wood D. A. The sequencing of aircraft departures. Fortieth Eur. Study Group with Indust. (2001) (Keele, UK)Google Scholar
  • Ernst A. T., Krishnamoorthy M., Storer R. H. Heuristic and exact algorithms for scheduling aircraft landings. Networks (1999) 34:229–241CrossrefGoogle Scholar
  • Gendreau M., Potvin J.-Y., Burke E. K., Kendall G. Tabu search. Search Methodologies (2005) (Springer, New York) 165–186Ch. 6.CrossrefGoogle Scholar
  • Glover F. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. (1986) 13:533–549CrossrefGoogle Scholar
  • Glover F., Kochenberger G.Handbook of Metaheuristics (2003) (Kluwer Academic Publishers, Boston/Dordrecht/London) CrossrefGoogle Scholar
  • Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Boston/Dordrecht/London) CrossrefGoogle Scholar
  • Idris H. R., Clarke J.-P., Bhuva R., Kang K. Queuing model for taxi-out time estimation. Air Traffic Control Quart. (2002) 10:1–21Google Scholar
  • Idris H. R., Delcaire B., Anagnostakis I., Hall W. D., Pujet N., Feron E., Hansman R. J., Clarke J.-P., Odoni A. Identification of flow constraint and control points in departure operations at airport systems. AIAA Guidance, Navigation Control Conf. (1998) Boston, MAGoogle Scholar
  • Idris H. R., Delcaire B., Anagnostakis I., Hall W. D., Pujet N., Feron E., Hansman R. J., Clarke J.-P., Odoni A. R. Observations of departure processes at Logan Airport to support the development of departure planning tools. Air Traffic Control Quart. (1999) 7:229–257Google Scholar
  • Newell G. F. Airport capacity and delays. Transportation Sci. (1979) 13:201–241LinkGoogle Scholar
  • Trivizas D. A. Optimal scheduling with maximum position shift (mps) constraints: A runway scheduling application. J. Navigation (1998) 51:250–266CrossrefGoogle Scholar
  • van Leeuwen P., Hesselink H., Rohling J. Scheduling aircraft using constraint satisfaction. Electronic Notes in Theoret. Comput. Sci. (2002) 76Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.