Fleet Assignment Problem Study Based on Branch-and-bound Algorithm
Donghua Wu, Yongjun Fan, Hongshan Xia, Jinyuan Zhang
Available Online March 2014.
- https://doi.org/10.2991/mce-14.2014.4How to use a DOI?
- Branch-and-bound algorithm; fleet assignment problem; genetic algorithm; building mode;
- In this paper, a strategy based on Branch-and-bound 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 graph’s depth-first search and Branch-and -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.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Donghua Wu AU - Yongjun Fan AU - Hongshan Xia AU - Jinyuan Zhang PY - 2014/03 DA - 2014/03 TI - Fleet Assignment Problem Study Based on Branch-and-bound Algorithm BT - 2014 International Conference on Mechatronics, Control and Electronic Engineering (MCE-14) PB - Atlantis Press SP - 16 EP - 20 SN - 1951-6851 UR - https://doi.org/10.2991/mce-14.2014.4 DO - https://doi.org/10.2991/mce-14.2014.4 ID - Wu2014/03 ER -