Discrete Fireworks Algorithm for Aircraft Mission Planning
In order to get the optimal aircraft mission planning path, a new solution approach and mathematical formulation of aircraft mission planning is proposed. Firstly, generalized distance is provided to convert aircraft mission planning problem into travelling salesman problem. Secondly, discrete fireworks algorithm (DFW) is proposed to obtain optimal mission path efficiently. At last, 3 typical benchmarks are simulated by DFW and contrast algorithms. Results show that new solution approach with DFW is effective and efficient to aircraft mission planning.
KeywordsMission planning Discrete fireworks algorithm TSP
This work is supported by National Natural Science Foundation of China under Grant No. 71171199 and No. 61472443.
- 4.Zhong-hua, H., Min, Z., Min, Y.: Multi-objective and multi-constrained UAV path plan optimum selection based on GRA. J. Grey Syst. 23, 35–46 (2011)Google Scholar
- 9.Zutong, W., Jiansheng, G., Mingfa, Z., Ying, W.: Uncertain multiobjective travelling salesman problem. Eur. J. Oper. Res. 241, 478–489 (2014)Google Scholar
- 11.Zheng, S., Janecek, A., Tan, Y.: Enhanced fireworks algorithm. In: 2013 IEEE Congress on Evolutionary Computation, pp. 2069–2077 (2013)Google Scholar