Solving the Aircraft Assigning Problem by the Ant Colony Algorithm
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.
KeywordsAircraft assigning flight string ant colony optimization (ACO) vehicle routing problem (VRP)
Unable to display preview. Download preview PDF.
- 5.Sriram, C., Haghani, A.: An optimization model for aircraft maintenance scheduling and re-assignment. Transportation Research Part A 37, 29–48 (2003)Google Scholar
- 10.Du, Y.: A Optimal Method of Scheduled Flights for Civil Aircraft. Systems Engineering- Theory & Practice 8, 75–80 (1995)Google Scholar
- 11.Li, Y., Tan, N., Hao, G.: Study on flight string model and algorithm in flight scheduling. Journal of System Simulation 20, 612–615 (2008)Google Scholar
- 14.Stutzle, T., Hoos, H.: Max-min ant system and local search for the traveling salesman problem. In: Proceedings of IEEE International Conference on Evolutionary Computation and Evolutionary Programming Conference. IEEE Press, New York (1997)Google Scholar