Dynamic Tabu Search Algorithm for Solving Departure Scheduling Problem

The aircraft departure scheduling problem is described comprehensively. A mathematical model is built for solving this problem. Then, a local search algorithm is proposed; based on it, the dynamic tabu search technique is applied, and the related implement techniques are presented. A simulation including condition and results is performed to solve a representative problem. It is concluded that (1) departure aircrafts of each queue keep the same order comparatively all the time, and the distribution of the departure time is well-proportioned, which accords with the “first-come first-serve” principle; (2) the total time costs are minimized, which would economize money and reduce danger; (3) the optimization result is not exclusive, which means that several approaches can be chosen at will; (4) the solution obtained is the global optimal one, which guarantees the validity of the proposed method.