Advertisement
Published in:
2011 | OriginalPaper | Chapter
Solving the Aircraft Assigning Problem by the Ant Colony Algorithm
Authors : Tao Zhang, Jing Lin, Biao Qiu, Yizhe Fu
Published in: Information and Management Engineering
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
This paper sums the aircraft assigning problem up as vehicle routing problem, and constructs a mixed integer programming model. This model not only considers the link time and link airport between two consecutive flight strings, but also considers the available flying time for each aircraft. To solve this problem, an Ant Colony System (ACS) combining with the pheromone updating strategy of ASRank (Rank-based Version of Ant System) and MMAS (MAX-MIN Ant System) is proposed. Seven groups of initial flight string sets are used to test the method, and the important parameters of the algorithm are analyzed. The numerical results show that the method of this paper can effectively reduce the total link time between the continuous flight strings, and obtain the satisfactory solution with high convergence speed.