Advertisement

Discrete Fireworks Algorithm for Aircraft Mission Planning

  • Jun-Jie XueEmail author
  • Ying Wang
  • Hao Li
  • Ji-yang Xiao
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9712)

Abstract

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.

Keywords

Mission planning Discrete fireworks algorithm TSP 

Notes

Acknowledgments

This work is supported by National Natural Science Foundation of China under Grant No. 71171199 and No. 61472443.

References

  1. 1.
    Nikolos, I.K., Valavanis, K.P., et al.: Evolutionary algorithm based offline/online path planner for UAV navigation. IEEE Trans. Syst. Man Cybern. 6, 898–912 (2003)CrossRefGoogle Scholar
  2. 2.
    Shima, T., Rasmussen, S.: UAV Cooperative Decision and Control: Challenges and Practical Approaches (Advances in Design and Control). Society for Industrial and Applied Mathematics, Philadelphia (2008)zbMATHGoogle Scholar
  3. 3.
    Cela, E., Deineko, V., Woeginger, G.J.: The x-and-y-axes travelling salesman problem. Eur. J. Oper. Res. 223, 333–345 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 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
  5. 5.
    Shi, X.H., Liang, Y.C., Lee, H.P., Lu, C., Wang, Q.X.: Particle swarm optimization-based algorithms for TSP and generalized TSP. Inf. Process. Lett. 103, 169–176 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Contreras-Bolton, C., Parada, V.: Automatic combination of operators in a genetic algorithm to solve the traveling salesman problem. PLoS ONE 10, 1–25 (2015)CrossRefGoogle Scholar
  7. 7.
    Jianyi, Y., Ruifeng, D., et al.: An improved ant colony optimization (I-ACO) method for the quasi travelling salesman problem (Quasi-TSP). Int. J. Geogr. Inf. Sci. 29, 1534–1551 (2015)CrossRefGoogle Scholar
  8. 8.
    Szeto, W., Wu, Y., Ho, S.C.: An artificial bee colony algorithm for the capacitated vehicle routing problem. Eur. J. Oper. Res. 215, 126–135 (2011)CrossRefGoogle Scholar
  9. 9.
    Zutong, W., Jiansheng, G., Mingfa, Z., Ying, W.: Uncertain multiobjective travelling salesman problem. Eur. J. Oper. Res. 241, 478–489 (2014)Google Scholar
  10. 10.
    Tan, Y., Zhu, Y.: Fireworks algorithm for optimization. In: Tan, Y., Shi, Y., Tan, K.C. (eds.) ICSI 2010, Part I. LNCS, vol. 6145, pp. 355–364. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  11. 11.
    Zheng, S., Janecek, A., Tan, Y.: Enhanced fireworks algorithm. In: 2013 IEEE Congress on Evolutionary Computation, pp. 2069–2077 (2013)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Air Force Engineering UniversityXi’anChina
  2. 2.Air Force Early-Warning AcademyWuhanChina

Personalised recommendations