A two-stage taxi scheduling strategy at airports with multiple independent runways. (October 2018)

• Record Type: Journal Article
• Authors: Zou, X.; Cheng, P.; Liu, W.D.; Cheng, N.; Zhang, J.P.
• Is Part Of: Transportation research. Volume 95(2018)
• Page Start: 165
• Page End: 184
• Publication Date: 2018-10
• Subjects: Airport -- Taxi scheduling -- Integer programming -- Runway exit availability; Transportation -- Periodicals; Transportation -- Technological innovations -- Periodicals; 388.011
• DOI: 10.1016/j.trc.2018.07.005
• Languages: English
• ISSNs: 0968-090X

Abstract

Highlights: Introduce a new concept to model the uncertainties of runway arriving operations. Integrated scheduling of arriving, departure and taxiing flights. Present several practical constraints which are neglected before. Refine the Integer Program model's formulation stepwise to reduce computing burden. Significant improvement of our scheduling results against the operations nowadays. Abstract: Long taxiing times at large airports lead to fuel wastage and dissatisfied passengers. This paper investigates the 4D taxi scheduling problem in airports to minimize the taxiing time. We propose an iterative two-stage scheduling strategy. In the first stage, all aircrafts in a current schedule period are assigned initial 4D routes. In the second stage, landing aircrafts that are unavailable to fulfil their initially assigned routes are rescheduled using a shortest path algorithm based approach. In this paper, the simplified model used in most existing literature, that depicts a runway as having a single entrance and a single exit or even sets only one point to represent both of them has been discarded. Instead, we model the fact that a runway has multiple entrance and exit points and use an emerging concept—Runway Exit Availability (REA)—to measure the probability of clearing a runway from a specific exit during a specific time interval so that the taxiing scheduling model can be much higher approximation to the practical operation. An integer programming (IP) model factoring REA is proposed for assigning 4D taxiing routes in the first stage. The IP model covers most practical constraints faced in airport taxiing procedures, such as the rear-end/head-on conflict constraint, runway-crossing constraint, take-off/landing separation constraint, and taxi-out constraint. Besides, flight holding patterns at intersections are much more realistically modelled. Furthermore, to accelerate the solving process of the IP model, we have refined the formulation using several tricks. Simulation results by proposed scheduling approach for operations at the Beijing Capital International Airport (PEK) for an entire day demonstrate a surprising taxiing time saving against the empirical data and simulation results based on a strategy similar to what being used now days while showing an acceptable running time of our approach, which supports that our approach may help in real operation in the future.