 A heuristic approach for solving an integrated gate reassignment and taxi scheduling problemChuhang Yu, Dong Zhang and H.Y.K. Henry Lau Journal of Air Transport Management, 2017, vol. 62, issue C, 189-196 Abstract: Capacity limitation of airport ground operation is one of the major limiting factors in air traffic operation. The congestion on the gate and taxiway causes severe delay and propagate effect on the flight schedule. This paper considers the problem of integrated gate reassignment and taxiway scheduling, in which complex constraints related to runway restriction, gate allocation and taxiway conflict are all incorporated when determining the schedule. To solve this problem, we propose a novel heuristic approach. First, all possible aircraft schedules are enumerated by disretizing the waiting time along the path. Then, the cost is evaluated for each schedule and the conflict detection is conducted to generate constraint sets. Finally, we propose a set partition model, in which each decision variable denotes a candidate schedule that takes into account the possible constraints when generated. This method is compared with a sequential method that solves gate reassignment and taxiway scheduling problem separately. Computational results highlight the strength of our method. Keywords: Gate reassignment; Taxiway scheduling; Set partition model; Heuristics (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:jaitra:v:62:y:2017:i:c:p:189-196 DOI: 10.1016/j.jairtraman.2017.04.006 Access Statistics for this article Journal of Air Transport Management is currently edited by Anne Graham More articles in Journal of Air Transport Management from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.