Abstract
Approximating the Pareto fronts (PFs) of multiobjective optimization problems (MOPs) with a population of nondominated solutions is a common strategy in evolutionary multiobjective optimization (EMO). In the case of two or three objectives, the PFs of MOPs can be well approximated by the populations including several dozens or hundreds of nondominated solutions. However, this is not the case when approximating the PFs of many-objective optimization problems (MaOPs). Due to the high dimensionality in the objective space, almost all EMO algorithms with Pareto dominance encounter the difficulty in converging towards the PFs of MaOPs. In contrast, most of efficient EMO algorithms for many-objective optimization use the idea of decomposition in fitness assignment. It should be pointed out that small population size is often used in these many-objective optimization algorithms, which focus on the approximation of PFs along some specific search directions. In this paper, we studied the extensions of two well-known algorithms (i.e., NSGA-II and MOEA/D) with the ability to find a large population of nondominated solutions with good spread. A region-based archiving method is also suggested to reduce the computational complexity of updating external population. Our experimental results showed that these two extensions have good potential to find the PFs of MaOPs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Miettinen, K.: Nonlinear Multiobjective Optimization. Kluwer Academic Publishers, Amsterdam (1999)
Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. Wiley, Hoboken (2001)
Zhou, A.M., et al.: Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol. Comput. 1(1), 32–49 (2011)
Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)
Zhang, Q., Li, H.: MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712–731 (2007)
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)
Jaszkiewicz, A.: On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment. IEEE Trans. Evol. Comput. 6(4), 402–412 (2002)
Ishibuchi, H., Yoshida, T., Murata, T.: Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans. Evol. Comput. 7(2), 204–223 (2003)
Fred, G., Gary, K.: Handbook of Metaheuristics. Kluwer Academic Publishers, Boston (2003)
Li, H., Zhang, Q.: Multiobjective optimization problems with complicated pareto sets, MOEA/D and NSGA-II. IEEE Trans. Evol. Comput. 13(2), 284–302 (2009)
Dai, C., Wang, Y.P., Ye, M.: A new multi-objective particle swarm optimization algorithm based on decomposition. Inf. Sci. 325, 541–557 (2015)
Ke, L.J., Zhang, Q., Battiti, R.: MOEA/D-ACO: a multiobjective evolutionary algorithm using decomposition and antcolony. IEEE Trans. Cybern. 43, 1845–1859 (2013)
Li, H., Zhang, Q., Deng, J.: Biased multiobjective optimization and decomposition algorithm. IEEE Trans. Cybern. 47(1), 52–66 (2017)
Ishibuchi, H., Sakane, Y., Tsukamoto, N., Nojima, Y.: Evolutionary many-objective optimization by NSGA-II and MOEA/D with large populations. In: 2009 IEEE International Conference on Systems, Man and Cybernetics, pp. 1758–1763 (2009)
Tan, K.C., Lee, T.H., Khor, E.F.: Evolutionary algorithms with dynamic population size and local exploration for multiobjective optimization. IEEE Trans. Evol. Comput. 5(6), 565–588 (2001)
Li, H., Landa-Silva, D.: An adaptive evolutionary multi-objective approach based on simulated annealing. Evol. Comput. 19(4), 561–595 (2011)
Li, H., Deng, J.D., Zhang, Q., Sun, J.Y.: Adaptive epsilon dominance in decomposition-based multiobjective evolutionary algorithm. Swarm Evol. Comput. 45, 52–67 (2019)
Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: empirical results. Evol. Comput. 8(2), 173–195 (2000)
Acknowledgment
The authors would like to thank the anonymous reviewers for their insightful comments. This work was supported by National Natural Science Foundation of China (NSFC) grants 11991023, 62072364, and 62076197.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Li, H., Shui, Y., Sun, J., Zhang, Q. (2021). Approximating Pareto Fronts in Evolutionary Multiobjective Optimization with Large Population Size. In: Ishibuchi, H., et al. Evolutionary Multi-Criterion Optimization. EMO 2021. Lecture Notes in Computer Science(), vol 12654. Springer, Cham. https://doi.org/10.1007/978-3-030-72062-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-72062-9_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-72061-2
Online ISBN: 978-3-030-72062-9
eBook Packages: Computer ScienceComputer Science (R0)