A two-stage taxi scheduling strategy at airports with multiple independent runways |
| |
| Institution: | 1. Institute of Navigation and Control, Department of Automation, Tsinghua University, Beijing 100084, PR China;2. The Second Research Institute of Civil Aviation Administration of China, Chengdu 610041, PR China;1. Department of Industrial Engineering, University of Miami, Coral Gables, FL, USA;2. NBC Universal Media LLC, New York, NY, USA;1. Technical Innovation Cluster on Aeronautical Management, Universitat Autónoma de Barcelona, Sabadell (Barcelona), Spain;2. School of Aerospace Transport and Manufacturing (SATM), Cranfield University, Cranfield (Bedfordshire), United Kingdom;3. Department of Research and Innovation, Aslogic, Rubí, Spain;1. College of Civil Aviation, Nanjing University of Aeronautics and Astronautics, 29 Jiangjun Avenue, Nanjing 211106, China;2. School of Engineering and Materials Science, Queen Mary University of London, Mile End Road, London E1 4NS, UK;3. School of Electronic Engineering and Computer Science, Queen Mary University of London, Mile End Road, London E1 4NS, UK;1. School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA 30332, USA;2. School of Aerospace Engineering, Georgia Institute of Technology, 270 Ferst Drive, Atlanta, GA 30332, USA;1. College of Business, University of Nebraska-Lincoln, Lincoln, NE, United States;2. Isenberg School of Management, University of Massachusetts Amherst, Amherst, MA, United States |
| |
| 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. |
| |
| Keywords: | Airport Taxi scheduling Integer programming Runway exit availability |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
