The aircraft gate reassignment problem occurs when the departure of an inco
ming aircraft is delayed or a delay occurs in flight. If the delay is signi
ficant enough to delay the arrival of subsequent incoming aircraft at the a
ssigned gate, the airline must revise the gate assignments to minimize extr
a delay times. This paper describes a genetic algorithm approach to solving
the gate reassignment problem. By using a global search technique on quant
ified information, this genetic algorithm approach can efficiently find min
imum extra delayed time solutions that are as effective or more effective t
han solutions generated by experienced gate managers.