Revisit the fairness issues in flight landing scheduling

Yong Wang, Feng Wang, Dan Wang, Zhenghu Gong, Jiangchuan Liu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

2 Citations (Scopus)

Abstract

Flight landing optimization at the terminal area is an ongoing challenge for air traffic controllers. The current schedule scheme is first-come-first- served (FCFS). There are studies focusing on how to minimize the total cost or maximize the throughput. These schemes are short of fairness consideration. In this paper, we start from a real recent example to show that a lack of consideration of long-term fairness may cause significant problems in certain emergency situations. We propose new definitions of fairness between different airlines which consider the history fairness information. We then study the fairness in flight landing problem (FFLP). We show that the problem is NP-hard to solve. Therefore, we develop a fast heuristic. Our experiment results show that our algorithm achieves a 50.4% gain on long-term fairness.

Original languageEnglish
Title of host publication2012 15th International IEEE Conference on Intelligent Transportation Systems, ITSC 2012
Pages1435-1440
Number of pages6
DOIs
Publication statusPublished - 21 Dec 2012
Event2012 15th International IEEE Conference on Intelligent Transportation Systems, ITSC 2012 - Anchorage, AK, United States
Duration: 16 Sep 201219 Sep 2012

Publication series

NameIEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC

Conference

Conference2012 15th International IEEE Conference on Intelligent Transportation Systems, ITSC 2012
CountryUnited States
CityAnchorage, AK
Period16/09/1219/09/12

ASJC Scopus subject areas

  • Automotive Engineering
  • Mechanical Engineering
  • Computer Science Applications

Cite this