Airport Gate Scheduling with Time Windows

Publication Type

Journal Article

Publication Date

9-2005

Abstract

In contrast to the existing airport gate assignment studies where flight have fixed schedules, we consider the more realistic situation where flight arrival and departure times can change. Although we minimize walking distances (or travel time) in our objective function, the model is easily adapted for other material handling costs including baggage and cargo costs. Our objectives are achieved through gate assignments, where time slots alloted to aircraft at gates deviate from scheduled slots minimally. Further, the model can be applied to cross-docking optimization in areas other than airports, such as freight terminals where material arrival times (via trucks, ships) can fluctuate. The solution approach uses insert and interval exchange moves together with a time shift algorithm. We then use these neighborhood moves in Tabu Search and Memetic Algorithms. Computational results are provided and verify that our heuristics work well in small cases and much better in large cases when compared with CPLEX solver.

Keywords

aircraft gate scheduling, tabu search, memetic algorithm

Discipline

Operations and Supply Chain Management

Research Areas

Operations Management

Publication

Artificial Intelligence Review

Volume

24

Issue

1

First Page

5

Last Page

31

ISSN

0269-2821

Identifier

10.1007/s10462-004-7190-4

Publisher

Springer Verlag

Additional URL

https://doi.org/10.1007/s10462-004-7190-4

Link to Full Text

Share

COinS