In recent years, a large number of approaches to constrained multi-objective optimization problems(CMOPs) have been proposed, focusing on developing tweaked strategies and techniques for handling constraints. However,...In recent years, a large number of approaches to constrained multi-objective optimization problems(CMOPs) have been proposed, focusing on developing tweaked strategies and techniques for handling constraints. However, an overly finetuned strategy or technique might overfit some problem types,resulting in a lack of versatility. In this article, we propose a generic search strategy that performs an even search in a promising region. The promising region, determined by obtained feasible non-dominated solutions, possesses two general properties.First, the constrained Pareto front(CPF) is included in the promising region. Second, as the number of feasible solutions increases or the convergence performance(i.e., approximation to the CPF) of these solutions improves, the promising region shrinks. Then we develop a new strategy named even search,which utilizes the non-dominated solutions to accelerate convergence and escape from local optima, and the feasible solutions under a constraint relaxation condition to exploit and detect feasible regions. Finally, a diversity measure is adopted to make sure that the individuals in the population evenly cover the valuable areas in the promising region. Experimental results on 45 instances from four benchmark test suites and 14 real-world CMOPs have demonstrated that searching evenly in the promising region can achieve competitive performance and excellent versatility compared to 11 most state-of-the-art methods tailored for CMOPs.展开更多
With the increasing demand for electrical services,wind farm layout optimization has been one of the biggest challenges that we have to deal with.Despite the promising performance of the heuristic algorithm on the rou...With the increasing demand for electrical services,wind farm layout optimization has been one of the biggest challenges that we have to deal with.Despite the promising performance of the heuristic algorithm on the route network design problem,the expressive capability and search performance of the algorithm on multi-objective problems remain unexplored.In this paper,the wind farm layout optimization problem is defined.Then,a multi-objective algorithm based on Graph Neural Network(GNN)and Variable Neighborhood Search(VNS)algorithm is proposed.GNN provides the basis representations for the following search algorithm so that the expressiveness and search accuracy of the algorithm can be improved.The multi-objective VNS algorithm is put forward by combining it with the multi-objective optimization algorithm to solve the problem with multiple objectives.The proposed algorithm is applied to the 18-node simulation example to evaluate the feasibility and practicality of the developed optimization strategy.The experiment on the simulation example shows that the proposed algorithm yields a reduction of 6.1% in Point of Common Coupling(PCC)over the current state-of-the-art algorithm,which means that the proposed algorithm designs a layout that improves the quality of the power supply by 6.1%at the same cost.The ablation experiments show that the proposed algorithm improves the power quality by more than 8.6% and 7.8% compared to both the original VNS algorithm and the multi-objective VNS algorithm.展开更多
Optimizing Flow Path Design(FPD)is a popular research area in transportation system design,but its application to Overhead Transportation Systems(OTSs)has been limited.This study focuses on optimizing a double-spine f...Optimizing Flow Path Design(FPD)is a popular research area in transportation system design,but its application to Overhead Transportation Systems(OTSs)has been limited.This study focuses on optimizing a double-spine flow path design for OTSs with 10 stations by minimizing the total travel distance for both loaded and empty flows.We employ transportation methods,specifically the North-West Corner and Stepping-Stone methods,to determine empty vehicle travel flows.Additionally,the Tabu Search(TS)algorithm is applied to branch the 10 stations into two main layout branches.The results obtained from our proposed method demonstrate a reduction in the objective function value compared to the initial feasible solution.Furthermore,we explore howchanges in the parameters of the TS algorithm affect the optimal result.We validate the feasibility of our approach by comparing it with relevant literature and conducting additional tests on layouts with 20 and 30 stations.展开更多
Deep neural networks often outperform classical machine learning algorithms in solving real-world problems.However,designing better networks usually requires domain expertise and consumes significant time and com-puti...Deep neural networks often outperform classical machine learning algorithms in solving real-world problems.However,designing better networks usually requires domain expertise and consumes significant time and com-puting resources.Moreover,when the task changes,the original network architecture becomes outdated and requires redesigning.Thus,Neural Architecture Search(NAS)has gained attention as an effective approach to automatically generate optimal network architectures.Most NAS methods mainly focus on achieving high performance while ignoring architectural complexity.A myriad of research has revealed that network performance and structural complexity are often positively correlated.Nevertheless,complex network structures will bring enormous computing resources.To cope with this,we formulate the neural architecture search task as a multi-objective optimization problem,where an optimal architecture is learned by minimizing the classification error rate and the number of network parameters simultaneously.And then a decomposition-based multi-objective stochastic fractal search method is proposed to solve it.In view of the discrete property of the NAS problem,we discretize the stochastic fractal search step size so that the network architecture can be optimized more effectively.Additionally,two distinct update methods are employed in step size update stage to enhance the global and local search abilities adaptively.Furthermore,an information exchange mechanism between architectures is raised to accelerate the convergence process and improve the efficiency of the algorithm.Experimental studies show that the proposed algorithm has competitive performance comparable to many existing manual and automatic deep neural network generation approaches,which achieved a parameter-less and high-precision architecture with low-cost on each of the six benchmark datasets.展开更多
Shenvi et al.have proposed a quantum algorithm based on quantum walking called Shenvi-Kempe-Whaley(SKW)algorithm,but this search algorithm can only search one target state and use a specific search target state vector...Shenvi et al.have proposed a quantum algorithm based on quantum walking called Shenvi-Kempe-Whaley(SKW)algorithm,but this search algorithm can only search one target state and use a specific search target state vector.Therefore,when there are more than two target nodes in the search space,the algorithm has certain limitations.Even though a multiobjective SKW search algorithm was proposed later,when the number of target nodes is more than two,the SKW search algorithm cannot be mapped to the same quotient graph.In addition,the calculation of the optimal target state depends on the number of target states m.In previous studies,quantum computing and testing algorithms were used to solve this problem.But these solutions require more Oracle calls and cannot get a high accuracy rate.Therefore,to solve the above problems,we improve the multi-target quantum walk search algorithm,and construct a controllable quantum walk search algorithm under the condition of unknown number of target states.By dividing the Hilbert space into multiple subspaces,the accuracy of the search algorithm is improved from p_(c)=(1/2)-O(1/n)to p_(c)=1-O(1/n).And by adding detection gate phase,the algorithm can stop when the amplitude of the target state becomes the maximum for the first time,and the algorithm can always maintain the optimal number of iterations,so as to reduce the number of unnecessary iterations in the algorithm process and make the number of iterations reach t_(f)=(π/2)(?).展开更多
Multi-objective Evolutionary Algorithm (MOEA) is becoming a hot research area and quite a few aspects of MOEAs have been studied and discussed. However there are still few literatures discussing the roles of search an...Multi-objective Evolutionary Algorithm (MOEA) is becoming a hot research area and quite a few aspects of MOEAs have been studied and discussed. However there are still few literatures discussing the roles of search and selection operators in MOEAs. This paper studied their roles by solving a case of discrete Multi-objective Optimization Problem (MOP): Multi-objective TSP with a new MOEA. In the new MOEA, We adopt an efficient search operator, which has the properties of both crossover and mutation, to generate the new individuals and chose two selection operators: Family Competition and Population Competition with probabilities to realize selection. The simulation experiments showed that this new MOEA could get good uniform solutions representing the Pareto Front and outperformed SPEA in almost every simulation run on this problem. Furthermore, we analyzed its convergence property using finite Markov chain and proved that it could converge to Pareto Front with probability 1. We also find that the convergence property of MOEAs has much relationship with search and selection operators.展开更多
In this paper, a new hybrid multi-objective evolutionary algorithm (MOEA), the niched Pareto tabu search combined with a genetic algorithm (NPTSGA), is proposed for the management of groundwater resources under va...In this paper, a new hybrid multi-objective evolutionary algorithm (MOEA), the niched Pareto tabu search combined with a genetic algorithm (NPTSGA), is proposed for the management of groundwater resources under variable density conditions. Relatively few MOEAs can possess global search ability contenting with intensified search in a local area. Moreover, the overall searching ability of tabu search (TS) based MOEAs is very sensitive to the neighborhood step size. The NPTSGA is developed on the thought of integrating the genetic algorithm (GA) with a TS based MOEA, the niched Pareto tabu search (NPTS), which helps to alleviate both of the above difficulties. Here, the global search ability of the NPTS is improved by the diversification of candidate solutions arising from the evolving genetic algorithm population. Furthermore, the proposed methodology coupled with a density-dependent groundwater flow and solute transport simulator, SEAWAT, is developed and its performance is evaluated through a synthetic seawater intrusion management problem. Optimization results indicate that the NPTSGA offers a tradeoff between the two conflicting objectives. A key conclusion of this study is that the NPTSGA keeps the balance between the intensification of nondomination and the diversification of near Pareto-optimal solutions along the tradeoff curves and is a stable and robust method for implementing the multi-objective design of variable-density groundwater resources.展开更多
By considering the eigenratio of the Laplacian matrix as the synchronizability measure, this paper presents an efficient method to enhance the synchronizability of undirected and unweighted networks via rewiring. The ...By considering the eigenratio of the Laplacian matrix as the synchronizability measure, this paper presents an efficient method to enhance the synchronizability of undirected and unweighted networks via rewiring. The rewiring method combines the use of tabu search and a local greedy algorithm so that an effective search of solutions can be achieved. As demonstrated in the simulation results, the performance of the proposed approach outperforms the existing methods for a large variety of initial networks, both in terms of speed and quality of solutions.展开更多
目的挖掘喜炎平注射液治疗儿童肺炎核心联用药物方案的临床应用规律,为探索临床不同诊疗思路、用药经验和提高中医药临床证据的循证等级提供参考。方法本研究基于全国29家医院信息管理系统(Hospital Information System,HIS)儿童肺炎的...目的挖掘喜炎平注射液治疗儿童肺炎核心联用药物方案的临床应用规律,为探索临床不同诊疗思路、用药经验和提高中医药临床证据的循证等级提供参考。方法本研究基于全国29家医院信息管理系统(Hospital Information System,HIS)儿童肺炎的用药数据,运用Tabu禁忌搜索算法,对真实世界喜炎平注射液治疗儿童肺炎人群的联合用药情况进行回顾性数据挖掘分析。结果在核心联用西药方面,抗感染治疗可以联用青霉素/美洛西林/阿莫西林、头孢呋辛/头孢曲松/头孢替安、阿奇霉素等;对症治疗可以联用对乙酰氨基酚/布洛芬、氨溴索+布地奈德+沙丁胺醇等;并发症治疗可以联用水合氯醛+苯巴比妥、磷酸肌酸+抗坏血酸等。在核心联用中药方面,可以联用小柴胡颗粒/小儿柴桂退热颗粒+鼻渊通窍颗粒、热毒宁注射液/蓝芩口服液/连花清瘟胶囊+开喉剑喷雾剂/口腔炎喷雾剂/双料喉风散、小儿肺咳颗粒+醒脾养儿颗粒/四磨汤口服液等。结论本研究的喜炎平注射液核心联用中西药方案,基本符合相关指南及诊疗规范,为优化临床联合用药、合理用药提供了一定的指导和参考。建议临床实际应用过程中,根据患儿的疾病进展情况,合理评估临床联合用药方案的疗效及安全性,注意用药配伍禁忌。展开更多
Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS)...Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS), a near optimal polygonal approximation was obtained. Compared to the famous Teh chin algorithm, our algorithms have obtained the approximated polygons with less number of vertices and less approximation error. Compared to the dynamic programming algorithm, the processing time of our algorithms are much less expensive.展开更多
The Traveling Salesman Problem (TSP) and its allied problems like Vehicle Routing Problem (VRP) are one of the most widely studied problems in combinatorial optimization. It has long been known to be NP-hard and hence...The Traveling Salesman Problem (TSP) and its allied problems like Vehicle Routing Problem (VRP) are one of the most widely studied problems in combinatorial optimization. It has long been known to be NP-hard and hence research on developing algorithms for the TSP has focused on approximate methods in addition to exact methods. Tabu search is one of the most widely applied metaheuristic for solving the TSP. In this paper, we review the tabu search literature on the TSP and its variations, point out trends in it, and bring out some interesting research gaps in this literature.展开更多
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 techniqu...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.展开更多
基金partly supported by the National Natural Science Foundation of China(62076225)。
文摘In recent years, a large number of approaches to constrained multi-objective optimization problems(CMOPs) have been proposed, focusing on developing tweaked strategies and techniques for handling constraints. However, an overly finetuned strategy or technique might overfit some problem types,resulting in a lack of versatility. In this article, we propose a generic search strategy that performs an even search in a promising region. The promising region, determined by obtained feasible non-dominated solutions, possesses two general properties.First, the constrained Pareto front(CPF) is included in the promising region. Second, as the number of feasible solutions increases or the convergence performance(i.e., approximation to the CPF) of these solutions improves, the promising region shrinks. Then we develop a new strategy named even search,which utilizes the non-dominated solutions to accelerate convergence and escape from local optima, and the feasible solutions under a constraint relaxation condition to exploit and detect feasible regions. Finally, a diversity measure is adopted to make sure that the individuals in the population evenly cover the valuable areas in the promising region. Experimental results on 45 instances from four benchmark test suites and 14 real-world CMOPs have demonstrated that searching evenly in the promising region can achieve competitive performance and excellent versatility compared to 11 most state-of-the-art methods tailored for CMOPs.
基金supported by the Natural Science Foundation of Zhejiang Province(LY19A020001).
文摘With the increasing demand for electrical services,wind farm layout optimization has been one of the biggest challenges that we have to deal with.Despite the promising performance of the heuristic algorithm on the route network design problem,the expressive capability and search performance of the algorithm on multi-objective problems remain unexplored.In this paper,the wind farm layout optimization problem is defined.Then,a multi-objective algorithm based on Graph Neural Network(GNN)and Variable Neighborhood Search(VNS)algorithm is proposed.GNN provides the basis representations for the following search algorithm so that the expressiveness and search accuracy of the algorithm can be improved.The multi-objective VNS algorithm is put forward by combining it with the multi-objective optimization algorithm to solve the problem with multiple objectives.The proposed algorithm is applied to the 18-node simulation example to evaluate the feasibility and practicality of the developed optimization strategy.The experiment on the simulation example shows that the proposed algorithm yields a reduction of 6.1% in Point of Common Coupling(PCC)over the current state-of-the-art algorithm,which means that the proposed algorithm designs a layout that improves the quality of the power supply by 6.1%at the same cost.The ablation experiments show that the proposed algorithm improves the power quality by more than 8.6% and 7.8% compared to both the original VNS algorithm and the multi-objective VNS algorithm.
基金funded by Ho Chi Minh City University of Technology(HCMUT),VNU-HCM under Grant Number B2021-20-04.
文摘Optimizing Flow Path Design(FPD)is a popular research area in transportation system design,but its application to Overhead Transportation Systems(OTSs)has been limited.This study focuses on optimizing a double-spine flow path design for OTSs with 10 stations by minimizing the total travel distance for both loaded and empty flows.We employ transportation methods,specifically the North-West Corner and Stepping-Stone methods,to determine empty vehicle travel flows.Additionally,the Tabu Search(TS)algorithm is applied to branch the 10 stations into two main layout branches.The results obtained from our proposed method demonstrate a reduction in the objective function value compared to the initial feasible solution.Furthermore,we explore howchanges in the parameters of the TS algorithm affect the optimal result.We validate the feasibility of our approach by comparing it with relevant literature and conducting additional tests on layouts with 20 and 30 stations.
基金supported by the China Postdoctoral Science Foundation Funded Project(Grant Nos.2017M613054 and 2017M613053)the Shaanxi Postdoctoral Science Foundation Funded Project(Grant No.2017BSHYDZZ33)the National Science Foundation of China(Grant No.62102239).
文摘Deep neural networks often outperform classical machine learning algorithms in solving real-world problems.However,designing better networks usually requires domain expertise and consumes significant time and com-puting resources.Moreover,when the task changes,the original network architecture becomes outdated and requires redesigning.Thus,Neural Architecture Search(NAS)has gained attention as an effective approach to automatically generate optimal network architectures.Most NAS methods mainly focus on achieving high performance while ignoring architectural complexity.A myriad of research has revealed that network performance and structural complexity are often positively correlated.Nevertheless,complex network structures will bring enormous computing resources.To cope with this,we formulate the neural architecture search task as a multi-objective optimization problem,where an optimal architecture is learned by minimizing the classification error rate and the number of network parameters simultaneously.And then a decomposition-based multi-objective stochastic fractal search method is proposed to solve it.In view of the discrete property of the NAS problem,we discretize the stochastic fractal search step size so that the network architecture can be optimized more effectively.Additionally,two distinct update methods are employed in step size update stage to enhance the global and local search abilities adaptively.Furthermore,an information exchange mechanism between architectures is raised to accelerate the convergence process and improve the efficiency of the algorithm.Experimental studies show that the proposed algorithm has competitive performance comparable to many existing manual and automatic deep neural network generation approaches,which achieved a parameter-less and high-precision architecture with low-cost on each of the six benchmark datasets.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.11975132 and 61772295)the Natural Science Foundation of Shandong Province,China(Grant No.ZR2019YQ01)the Project of Shandong Provincial Higher Educational Science and Technology Program,China(Grant No.J18KZ012)。
文摘Shenvi et al.have proposed a quantum algorithm based on quantum walking called Shenvi-Kempe-Whaley(SKW)algorithm,but this search algorithm can only search one target state and use a specific search target state vector.Therefore,when there are more than two target nodes in the search space,the algorithm has certain limitations.Even though a multiobjective SKW search algorithm was proposed later,when the number of target nodes is more than two,the SKW search algorithm cannot be mapped to the same quotient graph.In addition,the calculation of the optimal target state depends on the number of target states m.In previous studies,quantum computing and testing algorithms were used to solve this problem.But these solutions require more Oracle calls and cannot get a high accuracy rate.Therefore,to solve the above problems,we improve the multi-target quantum walk search algorithm,and construct a controllable quantum walk search algorithm under the condition of unknown number of target states.By dividing the Hilbert space into multiple subspaces,the accuracy of the search algorithm is improved from p_(c)=(1/2)-O(1/n)to p_(c)=1-O(1/n).And by adding detection gate phase,the algorithm can stop when the amplitude of the target state becomes the maximum for the first time,and the algorithm can always maintain the optimal number of iterations,so as to reduce the number of unnecessary iterations in the algorithm process and make the number of iterations reach t_(f)=(π/2)(?).
基金Supported by the National Natural Science Foundation of China(60133010,70071042,60073043)
文摘Multi-objective Evolutionary Algorithm (MOEA) is becoming a hot research area and quite a few aspects of MOEAs have been studied and discussed. However there are still few literatures discussing the roles of search and selection operators in MOEAs. This paper studied their roles by solving a case of discrete Multi-objective Optimization Problem (MOP): Multi-objective TSP with a new MOEA. In the new MOEA, We adopt an efficient search operator, which has the properties of both crossover and mutation, to generate the new individuals and chose two selection operators: Family Competition and Population Competition with probabilities to realize selection. The simulation experiments showed that this new MOEA could get good uniform solutions representing the Pareto Front and outperformed SPEA in almost every simulation run on this problem. Furthermore, we analyzed its convergence property using finite Markov chain and proved that it could converge to Pareto Front with probability 1. We also find that the convergence property of MOEAs has much relationship with search and selection operators.
基金funded by the National Basic Research Program of China(the 973 Program,No.2010CB428803)the National Natural Science Foundation of China(Nos.41072175,40902069 and 40725010)
文摘In this paper, a new hybrid multi-objective evolutionary algorithm (MOEA), the niched Pareto tabu search combined with a genetic algorithm (NPTSGA), is proposed for the management of groundwater resources under variable density conditions. Relatively few MOEAs can possess global search ability contenting with intensified search in a local area. Moreover, the overall searching ability of tabu search (TS) based MOEAs is very sensitive to the neighborhood step size. The NPTSGA is developed on the thought of integrating the genetic algorithm (GA) with a TS based MOEA, the niched Pareto tabu search (NPTS), which helps to alleviate both of the above difficulties. Here, the global search ability of the NPTS is improved by the diversification of candidate solutions arising from the evolving genetic algorithm population. Furthermore, the proposed methodology coupled with a density-dependent groundwater flow and solute transport simulator, SEAWAT, is developed and its performance is evaluated through a synthetic seawater intrusion management problem. Optimization results indicate that the NPTSGA offers a tradeoff between the two conflicting objectives. A key conclusion of this study is that the NPTSGA keeps the balance between the intensification of nondomination and the diversification of near Pareto-optimal solutions along the tradeoff curves and is a stable and robust method for implementing the multi-objective design of variable-density groundwater resources.
基金Project supported by the grant from City University of Hong Kong (Grant No. 7008105)
文摘By considering the eigenratio of the Laplacian matrix as the synchronizability measure, this paper presents an efficient method to enhance the synchronizability of undirected and unweighted networks via rewiring. The rewiring method combines the use of tabu search and a local greedy algorithm so that an effective search of solutions can be achieved. As demonstrated in the simulation results, the performance of the proposed approach outperforms the existing methods for a large variety of initial networks, both in terms of speed and quality of solutions.
文摘目的挖掘喜炎平注射液治疗儿童肺炎核心联用药物方案的临床应用规律,为探索临床不同诊疗思路、用药经验和提高中医药临床证据的循证等级提供参考。方法本研究基于全国29家医院信息管理系统(Hospital Information System,HIS)儿童肺炎的用药数据,运用Tabu禁忌搜索算法,对真实世界喜炎平注射液治疗儿童肺炎人群的联合用药情况进行回顾性数据挖掘分析。结果在核心联用西药方面,抗感染治疗可以联用青霉素/美洛西林/阿莫西林、头孢呋辛/头孢曲松/头孢替安、阿奇霉素等;对症治疗可以联用对乙酰氨基酚/布洛芬、氨溴索+布地奈德+沙丁胺醇等;并发症治疗可以联用水合氯醛+苯巴比妥、磷酸肌酸+抗坏血酸等。在核心联用中药方面,可以联用小柴胡颗粒/小儿柴桂退热颗粒+鼻渊通窍颗粒、热毒宁注射液/蓝芩口服液/连花清瘟胶囊+开喉剑喷雾剂/口腔炎喷雾剂/双料喉风散、小儿肺咳颗粒+醒脾养儿颗粒/四磨汤口服液等。结论本研究的喜炎平注射液核心联用中西药方案,基本符合相关指南及诊疗规范,为优化临床联合用药、合理用药提供了一定的指导和参考。建议临床实际应用过程中,根据患儿的疾病进展情况,合理评估临床联合用药方案的疗效及安全性,注意用药配伍禁忌。
文摘Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS), a near optimal polygonal approximation was obtained. Compared to the famous Teh chin algorithm, our algorithms have obtained the approximated polygons with less number of vertices and less approximation error. Compared to the dynamic programming algorithm, the processing time of our algorithms are much less expensive.
文摘The Traveling Salesman Problem (TSP) and its allied problems like Vehicle Routing Problem (VRP) are one of the most widely studied problems in combinatorial optimization. It has long been known to be NP-hard and hence research on developing algorithms for the TSP has focused on approximate methods in addition to exact methods. Tabu search is one of the most widely applied metaheuristic for solving the TSP. In this paper, we review the tabu search literature on the TSP and its variations, point out trends in it, and bring out some interesting research gaps in this literature.
基金The National Natural Science Foundationof China (No.60134010)
文摘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.