Fleet Assignment Problem Study Based on Branch-and-bound Algorithm
In this paper,a strategy based on Branch-andbound algorithm for an optimization problem was proposed,a scheduling method solving airliner fleet assignment problem was analyzed. By building a model,the requirement of balanced application of airplanes was transformed to optimizing schemes. The graphs depthfirst search and Branch-artd -bound algorithm were presented. The algorithm was used in an example. As the result,the time cost of the optimized fleet assignment for 70 flights a day with 12 A320 aircrafts was less than 0.3 second,which was one order of magnitude less than that of the genetic algorithm. The experiment results show that the method is an effective way for fleet assignment problem and has high practical application value.
Branch-and-bound algorithm fleet assignment problem genetic algorithm building mode
Wu Donghua Xia Hongshan
College of Civil Aviation,Nanjing University of Aeronautics and Astronautics,Nanjing 210016,China
国际会议
南宁
英文
128-131
2010-12-10（万方平台首次上网日期，不代表论文的发表时间）