A Dynamic Flight Stringbased Ant Colony Algorithm for Fleet Assignment
A mathematical model with the flight string as the decision variables,aiming to minimize the number of the flights and to maximize the maintenance opportunities,is proposed in this paper,and a dynamically constructed flight string based ant colony algorithm is presented to solve the problem.A new mechanism of pheromone update is utilized in the algorithm to fasten the convergence rate.Numerical examples are extended from the small scale scheduling problems with single maintenance base to the large scale scheduling problems with multiple maintenance bases.Simulation results show that the proposed algorithm could not only solve the problem,but also improve the efficiency.
air transportation ant colony algorithm dynamically constructed flight string fleet assignment problem double objectives
Zhang Kang Yu Ying Wang Weijie
Department of automation Shanghai University Shanghai,China
国际会议
重庆
英文
302-306
2016-03-20（万方平台首次上网日期，不代表论文的发表时间）