Dynamic Tabu Search Algorithm for Solving Departure Scheduling Problem

作     者：王来军 史忠科 雷秀娟 

作者机构：School of Automatization Northwestern Polytechnical University 

出 版 物：《Journal of Southwest Jiaotong University(English Edition)》 (西南交通大学学报（英文版）)

年 卷 期：2007年第15卷第2期

页      面：132-137页

学科分类：08[工学] 0825[工学-航空宇航科学与技术] 

基　　金：The National Natural Science Foundationof China (No.60134010) 

主　　题：Departure scheduling Wake vortex separation Global optimality Tabu search 

摘      要：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 lime, 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.