×

Entropy based evolutionary algorithm with adaptive reference points for many-objective optimization problems. (English) Zbl 1441.90154

Summary: Many-objective optimization problems (MaOPs) have attracted more and more attention due to its challenges for multi-objective evolutionary algorithms. Reference points or weight vectors based evolutionary algorithms have been developed successfully for solving MaOPs. However, these algorithms do not solve efficiently the MaOPs with irregular Pareto fronts, such as disconnected, degenerate, and inverted. Although some algorithms with adaptive weight vectors or reference points are designed to handle the problems with irregular shapes of Pareto fronts, they still exist some drawbacks. These adaptive algorithms do not obtain good performance in solving regular problem. For solving regular and irregular Pareto fronts of the problems, a novel entropy based evolutionary algorithm with adaptive reference points, named EARPEA, is proposed to solve regular and irregular many-objective optimization problems. Entropy computed based on reference points and a learning period are employed to control adaptation of the reference points. In addition, in order to maintain diversity of the reference points, a reference point adaptation method based on cosine similarity is designed in the adjusting reference point phase. The proposed algorithm is empirically compared with eight state-of-the-art many-objective evolutionary algorithms on 72 instances of 18 benchmark problems. The comparative results demonstrate that the overall performance of the proposed algorithm is superior to the counterparts on MaOPs with regular and irregular Pareto fronts.

MSC:

90C29 Multi-objective and goal programming
68W50 Evolutionary algorithms, genetic algorithms (computational aspects)
90C59 Approximation methods and heuristics in mathematical programming
94A17 Measures of information, entropy
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] A. Aleti, I. Moser, Entropy-based adaptive range parameter control for evolutionary algorithms, in: Proceedings of the Conference on Genetic & Evolutionary Computation, 2013, pp. 1501-1508.
[2] Asafuddoula, M.; Ray, T.; Sarker, R., A decomposition-based evolutionary algorithm for many objective optimization, IEEE Trans. Evol. Comput., 19, 3, 445-460 (2015)
[3] Asafuddoula, M.; Singh, H. K.; Ray, T., An enhanced decomposition-based evolutionary algorithm with adaptive reference vectors, IEEE Trans. Cybern. (2017)
[4] L. Chen, C. Zhou, G. Dai, Y. Zhang, R. Hu, Entropy determined hybrid two-stage multi-objective evolutionary algorithm combining locally linear embedding, in: Proceedings of the Evolutionary Computation, 2016, pp. 2565-2572.
[5] Cheng, R.; Jin, Y.; Olhofer, M.; Sendhoff, B., A reference vector guided evolutionary algorithm for many-objective optimization, IEEE Trans. Evol. Comput., 20, 5, 773-791 (2016)
[6] Das, I.; Dennis, J. E., Normal-boundary intersection: a new method for generating the pareto surface in nonlinear multicriteria optimization problems, SIAM J. Optim., 8, 3, 631-657 (1998) · Zbl 0911.90287
[7] Deb, K., Multi-Objective Optimization Using Evolutionary Algorithms, 16 (2001), John Wiley & Sons · Zbl 0970.90091
[8] Deb, K.; Goyal, M., A combined genetic adaptive search (geneas) for engineering design, Comput. Sci. Inform., 26, 30-45 (1996)
[9] Deb, K.; Jain, H., An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part i: solving problems with box constraints, IEEE Trans. Evol. Comput., 18, 4, 577-601 (2014)
[10] K. Deb, L. Thiele, M. Laumanns, E. Zitzler, Scalable multi-objective optimization test problems, in: Proceedings of the Congress on Evolutionary Computation, vol. 1, IEEE, 2002, pp. 825-830.
[11] A. Farhang-Mehr, S. Azarm, Diversity assessment of Pareto optimal solution sets: an entropy approach, in: Proceedings of the Congress on Evolutionary Computation, vol. 1, IEEE, 2002, pp. 723-728.
[12] Figueiredo, E. M.N.; Ludermir, T. B.; Bastos-Filho, C. J.A., Many objective particle swarm optimization, Inf. Sci. (NY), 374, 115-134 (2016)
[13] Huband, S.; Hingston, P.; Barone, L.; While, L., A review of multiobjective test problems and a scalable test problem toolkit, IEEE Trans. Evol. Comput., 10, 5, 477-506 (2006)
[14] E.J. Hughes, MSOPS-II: a general-purpose many-objective optimiser, in: Proceedings of the IEEE Congress on Evolutionary Computation, IEEE, 2007, pp. 3944-3951.
[15] K. Ikeda, H. Kita, S. Kobayashi, Failure of Pareto-based MOEAs: does non-dominated really mean near to optimal?, in: Proceedings of the Congress on Evolutionary Computation, 2001, pp. 957-962 vol. 2.
[16] Ishibuchi, H.; Masuda, H.; Nojima, Y., Pareto fronts of many-objective degenerate test problems, IEEE Trans. Evol. Comput., 20, 5, 807-813 (2016)
[17] Ishibuchi, H.; Setoguchi, Y.; Masuda, H.; Nojima, Y., Performance of decomposition-based many-objective algorithms strongly depends on Pareto front shapes, IEEE Trans. Evol. Comput., 21, 2, 169-190 (2017)
[18] Jain, H.; Deb, K., An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, part ii: handling constraints and extending to an adaptive approach., IEEE Trans. Evol. Comput., 18, 4, 602-622 (2014)
[19] Laumanns, M.; Thiele, L.; Deb, K.; Zitzler, E., Combining convergence and diversity in evolutionary multiobjective optimization, Evol. Comput., 10, 3, 263-282 (2014)
[20] Li, B.; Li, J.; Tang, K.; Yao, X., Many-objective evolutionary algorithms: a survey, ACM Comput. Surv. (CSUR), 48, 1, 13 (2015)
[21] Li, B.; Tang, K.; Li, J.; Yao, X., Stochastic ranking algorithm for many-objective optimization based on multiple indicators, IEEE Trans. Evol. Comput., 20, 6, 924-938 (2016)
[22] Li, H.; Landa-Silva, D., An adaptive evolutionary multi-objective approach based on simulated annealing, Evol. Comput., 19, 4, 561-595 (2011)
[23] Li, K.; Deb, K.; Zhang, Q.; Kwong, S., An evolutionary many-objective optimization algorithm based on dominance and decomposition, IEEE Trans. Evol. Comput., 19, 5, 694-716 (2015)
[24] Liu, Y.; Gong, D.; Jing, S.; Jin, Y., A many-objective evolutionary algorithm using a one-by-one selection strategy, IEEE Trans. Cybern., 47, 9, 2689-2702 (2017)
[25] Oliva, D.; Hinojosa, S.; Cuevas, E.; Pajares, G.; Avalos, O.; Glvez, J., Cross entropy based thresholding for magnetic resonance brain images using crow search algorithm, Expert Syst. Appl., 79 (2017)
[26] Qi, Y.; Ma, X.; Liu, F.; Jiao, L.; Sun, J.; Wu, J., MOEA/D with adaptive weight adjustment, Evol. Comput., 22, 2, 231-264 (2014)
[27] Santos, T.; Takahashi, R. H., On the performance degradation of dominance-based evolutionary algorithms in many-objective optimization, IEEE Trans. Evol. Comput. (2016)
[28] D.K. Saxena, K. Deb, Non-linear dimensionality reduction procedures for certain large-dimensional multi-objective optimization problems: employing correntropy and a novel maximum variance unfolding, in: Proceedings of the International Conference on Evolutionary Multi-Criterion Optimization, Springer, 2007, pp. 772-787.
[29] Saxena, D. K.; Sinha, A.; Duro, J. A.; Zhang, Q., Entropy-based termination criterion for multiobjective evolutionary algorithms, IEEE Trans. Evol. Comput., 20, 4, 485-498 (2016)
[30] Seada, H.; Deb, K., A unified evolutionary optimization procedure for single, multiple, and many objectives, IEEE Trans. Evol. Comput., 20, 3, 358-369 (2016)
[31] Shannon, C. E., A mathematical theory of communication, ACM SIGMOBILE Mob. Comput. Commun. Rev., 5, 1, 3-55 (2001)
[32] Tang, K.; Yuan, X.; Sun, T.; Yang, J.; Gao, S., An improved scheme for minimum cross entropy threshold selection based on genetic algorithm, Knowl. Based Syst., 24, 8, 1131-1138 (2011)
[33] Thamaraiselvi, G.; Kaliammal, A., Data Mining: Concepts and Techniques (2004), Ap Professional
[34] Tian, Y.; Cheng, R.; Zhang, X.; Cheng, F.; Jin, Y., An indicator based multi-objective evolutionary algorithm with reference point adaptation for better versatility, IEEE Trans. Evol. Comput. (2017)
[35] Y. Tian, R. Cheng, X. Zhang, Y. Jin, PlatEMO: a MATLAB platform for evolutionary multi-objective optimization, arXiv:1701.00879 (2017).
[36] Y. Tian, X. Zhang, R. Cheng, Y. Jin, A multi-objective evolutionary algorithm based on an enhanced inverted generational distance metric, in: Proceedings of the IEEE Congress on Evolutionary Computation (CEC), IEEE, 2016, pp. 5222-5229.
[37] Wang, H.; Jiao, L.; Yao, X., Two_Arch2: an improved two-archive algorithm for many-objective optimization, IEEE Trans. Evol. Comput., 19, 4, 524-541 (2015)
[38] Wang, R.; Purshouse, R. C.; Fleming, P. J., Preference-inspired coevolutionary algorithms for many-objective optimization, IEEE Trans. Evol. Comput., 17, 4, 474-494 (2013)
[39] Wang, R.; Purshouse, R. C.; Fleming, P. J., Preference-inspired co-evolutionary algorithms using weight vectors, Eur. J. Oper. Res., 243, 2, 423-441 (2015) · Zbl 1346.90755
[40] While, L.; Hingston, P.; Barone, L.; Huband, S., A faster algorithm for calculating hypervolume, IEEE Trans. Evol. Comput., 10, 1, 29-38 (2006)
[41] Wilcoxon, F., Individual comparisons by ranking methods, Biomet. Bull., 1, 6, 80-83 (1945)
[42] Yang, S.; Li, M.; Liu, X.; Zheng, J., A grid-based evolutionary algorithm for many-objective optimization, IEEE Trans. Evol. Comput., 17, 5, 721-736 (2013)
[43] Yuan, Y.; Xu, H.; Wang, B.; Yao, X., A new dominance relation-based evolutionary algorithm for many-objective optimization, IEEE Trans. Evol. Comput., 20, 1, 16-37 (2016)
[44] Zhang, Q.; Li, H., MOEA/D: a multiobjective evolutionary algorithm based on decomposition, IEEE Trans. Evol. Comput., 11, 6, 712-731 (2007)
[45] Zhang, Q.; Zhou, A.; Jin, Y., RM-MEDA: A Regularity Model-Based Multiobjective Estimation of Distribution Algorithm (2008), IEEE Press
[46] Zhang, X.; Tian, Y.; Jin, Y., A knee point-driven evolutionary algorithm for many-objective optimization, IEEE Trans. Evol. Comput., 19, 6, 761-776 (2015)
[47] A. Zhou, Y. Jin, Q. Zhang, B. Sendhoff, E. Tsang, Combining model-based and genetics-based offspring generation for multi-objective optimization using a convergence criterion, in: Proceedings of the IEEE Congress on Evolutionary Computation, IEEE, 2006, pp. 892-899.
[48] Zitzler, E.; Knzli, S., Indicator-based selection in multiobjective search, Lect. Notes Comput. Sci., 3242, 832-842 (2004)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.