Abstract
In evolutionary multi-objective optimization, achieving a balance between convergence speed and population diversity remains a challenging topic especially for many-objective optimization problems (MaOPs). To accelerate convergence toward the Pareto front and maintain a high degree of diversity for MaOPs, we propose a new many-objective dynamical evolutionary algorithm based on E-dominance and adaptive-grid strategies (EDAGEA). In EDAGEA, it incorporates the E_dominance and adaptive strategies to enhance the search ability. Instead of the Pareto dominance mechanism in the traditional dynamical evolutionary algorithm, EDAGEA employs the E-dominance strategy to improve the selective pressure and to accelerate the convergence speed. Moreover, EDAGEA incorporates the adaptive-grid strategy to promote the uniformity and diversity of the population. In the experiments, the proposed EDAGEA algorithm is tested on DTLZ series problems under 3–8 objectives with diverse characteristics and is compared with two excellent many-objective evolutionary algorithms. Experimental results demonstrate that the proposed EDAGEA algorithm exhibits competitive performance in terms of both convergence speed and diversity of population.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Adra S, Fleming P (2011) Diversity management in evolutionary many-objective optimization. IEEE Trans Evolut Comput 15(2):183–195
Chen BJ, Shu HZ, Coatrieux G, Chen G, Sun XM, Coatrieux JL (2014) Color image analysis by quaternion-type moments. J Math Imaging Vis 51(1):124–144
Chikumbo O, Goodman ED, Deb K (2012) Approximating a multidimensional Pareto front for a land use management problem: a modified MOEA with an epigenetic silencing metaphor. In: IEEE Congress on evolutionary computation (CEC), vol 22, no 10, pp 1–9
Coello CAC, Pulido GT, Lechuga MS (2004) Handing multiple objectives with particle swarm optimization. IEEE Trans Evol Comput 8(3):256–279
Corne DW, Knowles JD, Oates MJ, Jerram NR (2002) PESA-II: region-based selection in evolutionary multi-objective optimization. In: Proceedings of the genetic and evolutionary computation conference, pp 283–290
Deb K, Jain H (2012) Handling many-objective problems using an improved NSGA-II procedure. In: IEEE Congress on evolutionary computation(CEC), pp 1–8
Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197
Deb K, Thiele L, Laumanns M, Zitzler E (2002) Scalable multi-objective optimization test problems. In: Proceedings of IEEE Congress on evolutionary computation, pp 825–830
Deb K, Thiele L, Laumanns M, Zitzler E (2005) Scalable test problems for evolutionary multi-objective optimization. In: Theoretical advances and applications, Evolutionary multi-objective optimization, Springer, London, pp 105–145
Fleming PJ, Purshouse RC, Lygoe RJ (2005) Many-objective optimization: an engineering design perspective. In: Evolutionary multi criterion optimization of lecture notes in computer science, pp 14–32
Freire H, Oliveira PBDM, Pires EJS, Bessa M (2014) Corner based many-objective optimization. Nat Inspired Coop Strateg Optim 512:125–139
Garc’ıa S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behavior: a case study on the CEC’2005 special session on real parameter optimization. J Heuristics 15(6):617–644
Garcia S, Herrera F (2008) An extension on statistical comparisons of classifiers over multiple data sets for all pairwise comparisons. J Mach Learn Res 9:2677–2694
Gu B, Sheng VS, Tay KY, Romano W, Li S (2014) Incremental support vector learning for ordinal regression. IEEE Trans Neural Netw Learn Syst 26(7):1403–1416
Guo T, Kang LS (1999) A new evolutionary algorithm for function optimization. Wuhan Univ J Nat Sci 4(4):409–414
Herrero JG, Berlanga A, L’opez JMM (2009) Effective evolutionary algorithms for many specifications attainment: application to air traffic control tracking filters. IEEE Trans Evol Comput 13(1):151–168
Ishibuchi H, Tsukamoto N, Nojima Y (2008) Evolutionary many-objective optimization: a short review. In: IEEE Congress on evolutionary computation (CEC), pp 2419–2426
Kang Z, Kang LS, Zou XF et al (2007) A new evolutionary decision theory for many-objective optimization problems. In: Kang L, Liu Y, Zeng S (eds) Advances in computation and intelligence. Springer, Berlin, pp 1–11
Knowles JD, Corne DW (2000) Approximating the non-dominated front using the Pareto archived evolution strategy. Evol Comput 8(2):149–172
Li YX, Zou XF, Kang LS (2003) A new dynamical evolutionary algorithm from statistical mechanics. Chin J Comput Sci Technol 18(3):361–368
Li KS, Li YX, Kang LS, Wu ZJ (2007) A MOP evolutionary algorithm based on transportation theory. Chin J Comput 5(30):796–805
Li J, Chen XF, Li MQ, Li JW, Lee P, Lou WJ (2014) Secure deduplication with efficient and reliable convergent key management. IEEE Trans Parallel Distrib Syst 25(6):1615–1625
Li BD, Li JL, Tang K, Yao X (2015a) Many-objective evolutionary algorithms: a survey. ACM Comput Surv 48(1):1–35
Li J, Li XL, Yang B, Sun XM (2015b) Segmentation-based image copy-move forgery detection scheme. IEEE Trans Inf Forensics Secur 10(3):507–518
Narukawa K (2013) Effect of dominance balance in many-objective optimization. In: Evolutionary multi-criterion optimization of lecture notes in computer science, vol 7811, pp 276–290
Schott JR (1995) Fault tolerant design using single and multicriteria genetic algorithm optimization. Massachusetts Institute of Technology, Cambridge
Shen J, Tan HW, Wang J, Wang JW, Lee SY (2015) A novel routing protocol providing good transmission reliability in underwater sensor networks. J Internet Technol 16(1):171–178
Shi Z, Chen QW (2011) Multi-objective optimization algorithm based on quantum-behaved particle swarm and adaptive grid. Inf Control 40(2):214–220
Veldhuizen DAV, Lamont GB (2000) On measuring multi-objective evolutionary algorithm performance. In: Proceedings of IEEE Congress on evolutionary computation, vol 1, pp 204–211
Wang H, Sun H, Li C, Rahnamayan S, Pan JS (2013) Diversity enhanced particle swarm optimization with neighborhood search. Inf Sci 223(2):119–135
Wen XZ, Shao L, Xue Y, Fang W (2015) A rapid learning algorithm for vehicle classification. Inf Sci 295:395–406
Xia ZH, Wang XH, Sun XM, Wang BW (2014a) Steganalysis of least significant bit matching using multi-order differences. Secur Commun Netw 7(8):1283–1291
Xia ZH, Wang XH, Sun XM, Liu QS, Xiong NX (2014b) Steganalysis of LSB matching using differences between nonadjacent pixels. Multimedia Tools Appl 75(4):1–16
Xie SD, Wang YX (2014) Construction of tree network with limited delivery latency in homogeneous wireless sensor networks. Wirel Pers Commun 78(1):231–246
Yang SX, Li MQ, Liu XH, Zheng JH (2013) A grid-based evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 17(5):721–736
Zhang QF, Li H (2007) MOEA/D: a multi-objective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731
Zheng JH (2007) Multi-objective evolutionary algorithms and applications. Science Press, Beijing
Zheng YH, Byeungwoo J, Xu DH, Wu QMJ, Zhang H (2015) Image segmentation by generalized hierarchical fuzzy C-means algorithm. J Intell Fuzzy Syst 28(2):4024–4028
Zitzler E, Laumanns M, Thiele L (2001) SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization. In: Proceedings of the 4th international conference on evolutionary methods for design optimization and control with applications to industrial problems, Athens, Greece, 19–21 September 2001, pp 95–100
Zitzler E, Thiele L (1999) Multi-objective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257–271
Zou XF, Li YX, Kang LS (2002) Finding global minima with a new dynamical evolutionary algorithm. Wuhan Univ J Nat Sci 7(2):157–160
Acknowledgments
This work was supported in part by the National Natural Science Foundation of China (Nos. 41561091, 41261093, 61364015 and 61462036), by the Natural Science Foundation of Jiangxi, China (Nos. 20151BAB217010 and 20151BAB201015).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that there is no conflict of interests regarding the publication of this paper.
Additional information
Communicated by V. Loia.
Rights and permissions
About this article
Cite this article
Yue, X., Guo, Z., Yin, Y. et al. Many-objective E-dominance dynamical evolutionary algorithm based on adaptive grid. Soft Comput 22, 137–146 (2018). https://doi.org/10.1007/s00500-016-2314-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-016-2314-8