Abstract
When missiles attack the group targets, the selection of their optimal aiming points is a nonlinear, multi-dimensional and multimodal multiobjective optimization problem. To effectively address this problem, an affinity propagation-based multiobjective evolutionary algorithm called APMO is proposed in this article by introducing an affinity propagation and reproduction utility-based adaptive mating selection strategy named as AMS. In AMS, at each generation, an affinity propagation approach is firstly utilized to discover the neighborhood relationship of solutions. Afterward, parent selections for recombination are conducted on the neighborhoods or the whole population based on a mating restriction probability. Moreover, the mating restriction probability is updated at each generation according to the reproduction utility of the neighborhoods and the whole population over the last certain generations. Comprehensive experiments on benchmark instances denote that the proposed APMO significantly outperforms five popular multiobjective evolutionary algorithms, MOEA/D-DE, RM-MEDA, NSGA-II, SPEA2 and MOEA/D-STM. Practical application proves that APMO is promising to select the better optimal aiming points for missiles.
Similar content being viewed by others
References
Bardanis F, Bardanis F (2004) Kill vehicle effectiveness for boost phase interception of ballistic missiles. Ph.D. thesis, Naval Postgraduate School, Monterey, California
Ben Said L, Bechikh S, Ghédira K (2010) The r-dominance: a new dominance relation for interactive evolutionary multicriteria decision making. IEEE Trans Evol Comput 14(5):801–818
Beume N, Naujoks B, Emmerich M (2007) SMS-EMOA: multiobjective selection based on dominated hypervolume. Eur J Oper Res 181(3):1653–1669
Brockhoff D, Zitzler E (2006) Are all objectives necessary? on dimensionality reduction in evolutionary multiobjective optimization. In: Proceedings of the 9th workshop on parallel problem solving from nature (PPSN IX), pp 533–542. Springer
Bueno MLP, Oliveira GMB (2013) A dynamic multiobjective evolutionary algorithm for multicast routing problem. In: Proceedings of the 25th IEEE international conference on tools with artificial intelligence (ICTAI), IEEE, pp 344–350
Coello Coello CA (2006) Evolutionary multi-objective optimization: a historical view of the field. IEEE Comput Intell Mag 1(1):28–36
Corne D, Jerram N, Knowles J, Oates M (2001) PESA-II: region-based selection in evolutionary multiobjective optimization. In: Proceedings of the genetic and evolutionary computation conference (GECCO-2001), pp 283–290. Morgan Kaufmann Publishers
Corne DW, Knowles JD, Oates MJ (2000) The pareto envelope-based selection algorithm for multiobjective optimization. In: Proceedings of the 6th workshop on parallel problem solving from nature (PPSN VI), pp 839–848. Springer
Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197
Fonseca CM, Fleming PJ, et al. (1993) Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization. In: Proceedings of the 5th conference on genetic algorithms, pp 416–423. Morgan Kaufmann Publisher
Frey BJ, Dueck D (2007) Clustering by passing messages between data points. Science 315(5814):972–977
Gao J, Fang L, Wang J (2010) A weight-based multiobjective immune algorithm: WBMOIA. Eng Optim 42(8):719–745
Gu F, Liu HL, Tan KC (2012) A multiobjective evolutionary algorithm using dynamic weight design method. Int J Innov Comput Inf Control 8(5B):3677–3688
He G, Gao J, Hu L (2010) An improved immune genetic algorithm for multiobjective optimization. Lect Notes Comput Sci 6145:643–650
Hernndez-Daz AG, Santana-Quintero LV, Coello Coello CA, Molina J (2007) Pareto-adaptive epsilon-dominance. Evol Comput 15(4):493C–517
Hiroyasu T, Miki M (2003) NCGA: neighborhood cultivation genetic algorithm for multi-objective optimization problems. GECCO Late Break Pap 43:198–202
Horn J, Nafpliotis N, Goldberg DE (1994) A niched pareto genetic algorithm for multiobjective optimization. In: Proceedings of the 1st IEEE conference on evolutionary computation, IEEE, pp 82–87
Huang H, Wang Z, Wu F (2010) Optimal selection method for aiming points of system target. J Ballist 22(1):1–6
Ishibuchi H, Narukawa K (2008) An empirical study on similarity-based mating for evolutionary multiobjective combinatorial optimization. Eur J Oper Res 188(1):57–75
Ishibuchi H, Shibata Y (2003) A similarity-based mating scheme for evolutionary multiobjective optimization. Lect Notes Comput Sci 2723:1065–1076
Jaszkiewicz A (2002) Genetic local search for multi-objective combinatorial optimization. Eur J Oper Res 137(1):50–71
Kim M, Hiroyasu T, Miki M, Watanabe S (2004) Spea2+: improving the performance of the strength pareto evolutionary algorithm 2. Lect Notes Comput Sci 3242:742–751
Knowles JD, Corne DW (2000) Approximating the nondominated front using the Pareto archived evolution strategy. Evol Comput 8(2):149–172
Laumanns M, Thiele L, Deb K, Zitzler E (2002) Combining convergence and diversity in evolutionary multiobjective optimization. Evol Comput 10(3):263–282
Le K, Landa-Silva D (2008) Adaptive and assortative mating scheme for evolutionary multi-objective algorithms. Lect Notes Comput Sci 4926:172–183
Lei N, Zhang Y (2004) Optimizing method for aim points of mix-related targets. Syst Eng Electron 26(9):1234–1235
Li H, Zhang Q (2009) Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II. IEEE Trans Evol Comput 13(2):284–302
Li K, Kwong S (2014) A general framework for evolutionary multiobjective optimization via manifold learning. Neurocomputing 146:65–74
Li K, Zhang Q, Kwong S, Li M, Wang R (2014) Stable matching-based selection in evolutionary multiobjective optimization. IEEE Trans Evol Comput 18(6):909–923
Mashwani WK, Salhi A (2014) Multiobjective memetic algorithm based on decomposition. Appl Soft Comput 21:221–243
Mei Y, Tang K, Yao X (2011) Decomposition-based memetic algorithm for multi-objective capacitated arc routing problem. IEEE Trans Evol Comput 15(2):151–165
Miettinen K (1999) Nonlinear multiobjective optimization. Kluwer Academic Publisher, Dordrecht
Miller BL, Goldberg DE (1995) Genetic algorithms, tournament selection, and the effects of noise. Complex Syst 9(3):193–212
Phan DH, Suzuki J (2013) R2-IBEA: R2 indicator based evolutionary algorithm for multiobjective optimization. In: Proceedings of the IEEE congress on evolutionary computation (CEC 2013), IEEE, pp 1836–1845
Price K, Storn RM, Lampinen JA (2005) Differential evolution: a practical approach to global optimization. Springer, New York
Qi Y, Liu F, Liu M, Gong M, Jiao L (2012) Multi-objective immune algorithm with Baldwinian learning. Appl Soft Comput 12(8):2654–2674
Quirino T, Kubat M, Bryan NJ (2009) Instinct-based mating in genetic algorithms applied to the tuning of 1-nn classifiers. IEEE Trans Knowl Data Eng 22(12):1724–1737
Ren W, Tan S, Zhang Y, Shi S (2011) Method for aimming points of system target based on function tree. Command Control Simul 33(5):91–94
Salam A, Defersha FM, Bhuiyan N, Chen M (2010) A case study on target cost estimation using a genetic algorithm and a back-propagation based neural network. In: Proceedings of the 2nd international conference on engineering systems management and its applications (ICESMA), pp 1–5
Schaffer JD (1985) Multiple objective optimization with vector evaluated genetic algorithms. In: Proceedings of the 1st international conference on genetic algorithms, pp 93–100. Lawrence Erlbaum Associates Inc
Shu J, Jian W, Wang S, Liu B (2009) Aim points of command’s construction based on PSO algorithm. J Southwest Univ Sci Technol 24(4):70–74
Srinivas N, Deb K (1994) Multiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221–248
Wang G, Duan X, Wang Z (2008) Optimal selection method of aim points based on hitting vital index of area target. Acta Aeronaut Et Astronaut Sin 29(5):1258–1263
Wang J, Wang M (2010) The research of selecting aim-points for penetration cluster warhead attacking runway based on genetic algorithms and monte carlo. In: Proceedings of the 2nd international conference on computer engineering and technology (ICCET), vol 2, pp 344–347
Wang M (2003) Research on a new type of multiple objective genetic optimization algorithm and its applications. Comput Technol Autom 22(2):5–7+109
Wang M, Fang M (2014) Intelligence optimization algorithm for attacking efficiency of missile attacking surface target. Comput Technol Autom 26(1):45–49
Wang M, Bai Y, Yang T (2006) A study of a novel multiple objective genetic algorithm and its applications in optimization of missile-firing effectiveness. J Nav Univ Eng 18(5):5–9
Wang Y, Xiang J, Cai Z (2012) A regularity model-based multiobjective estimation of distribution algorithm with reducing redundant cluster operator. Appl Soft Comput 12(11):3526–3538
Wang Z, Li P, Wang M (2011) An optimizing method for missile’s aim points selection in defeating complex surface target. Tactical Missile Technol 5:86–89
Whitten G (1995) Automated missile aim point selection technology. Technical report AINA300813
Xu J, Bi Y, Li R, Qiao J (2012) Choice for aim point of port target based on quantum genetic algorithm. Syst Eng Electron 34(4):732–736
Yang S (2015) An improved multi-objective optimization evolutionary algorithm based on decomposition for complex pareto fronts. IEEE Trans Cybern. doi:10.1109/TCYB.2015.2403131
Yu X, Gen M (2010) Introduction to evolutionary algorithms. Springer, London
Zhang Q, Li H (2007) MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731
Zhang Q, Zhou A, Jin Y (2008) RM-MEDA: a regularity model based multiobjective estimation of distribution algorithm. IEEE Trans Evol Comput 12(1):41–63
Zhou A, Zhang Q, Zhang G (2014) Multiobjective evolutionary algorithm based on mixture gaussian models. J Softw 25(5):913– 928
Zhu M, Li H (2008) Missile aim-point choice based on analytic hierarchy process. In: Proceedings of the international symposium on computer science and computational technology, pp 663–666
Zitzler E, Künzli S (2004) Indicator-based selection in multiobjective search. In: Proceedings of the 8th international conference on parallel problem solving from nature (PPSN VIII), pp 832–842. Springer
Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257–271
Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength Pareto evolutionary algorithm. Technical report, Computer Engineering and Communication Networks Lab (TIK), Swiss Federal Institute of Technology (ETH), Zurich
Acknowledgments
The authors would like to thank Aimin Zhou for his helpful comments and suggestions on the original manuscripts. This work was supported by the National Basic Research Program of China under Grant No. 2012CB821205, Foundation for Creative Research Groups of the National Natural Science Foundation of China under Grant No. 61021002, National Natural Science Foundation of China under Grant No. 61174037, and the Innovation Funds of China Academy of Space Technology under Grant No. CAST20120602.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Communicated by V. Loia.
Rights and permissions
About this article
Cite this article
Zhang, H., Zhang, X., Song, S. et al. An affinity propagation-based multiobjective evolutionary algorithm for selecting optimal aiming points of missiles. Soft Comput 21, 3013–3031 (2017). https://doi.org/10.1007/s00500-015-1986-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-015-1986-9