:::
Trans. Planning Journal
| Title | Optimized Airport Gate Reassignment for Delayed Flights |
|---|---|
| Author | Hua-An Lu |
| Summary | Many airport operations are disrupted or forced to change their original plan when flights are delayed. Reassigning gates to those airplanes plays a crucial role in recovering the normal situation from the mess, when it is estimated to be going to keep a long time. Ideally, the optimal reassignment plan can reduce the impact to airport operations to the least level. However, their processes also need to take other normal flights into consideration in real-world cases. When necessary, some airplanes can park on remote bays to reduce the congestion of consecutive flights within a specified period. In this research, we discuss the properties of gate reassignment operations and formulate a model for integer programming, constructed from a concept of the time-space network, to minimize the total difference of reassigning cost. Test results show that this model can be efficiently solved directly by the branch-and-bound algorithm under certain problem scale. A heuristics based on the Lagrangian relaxation and subgradient technique is also suggested to treat the large-scale problems. The reasonable gaps of objective values exist between this heuristics and the branch-and-bound algorithm, but less CPU time is spent by the heuristics in larger problems. |
| Vol. | 30 |
| No. | 4 |
| Page | 849 |
| Year | 2001 |
| Month | 12 |
Count Views:410