Abstract
The Non-dominated Sorting Genetic Algorithm III (NSGA-III) uses a niche selection strategy based on reference points to maintain the population diversity. However, in an evolutionary process, areas near certain reference points which have no solution attached cannot be searched. To ensure the algorithm searching the entire solution space, and in particular, to avoid some areas not being explored due to no solution existing in the regions currently, we propose a uniform pool reservation strategy based on reference points in this paper. The strategy uses the individuals which are the closest to each reference point to guarantee population diversity. The improved algorithm is compared with classical algorithms based on decomposition and other improved algorithms based on NSGA-III respectively. The performance of each algorithm is evaluated by using inverted generational distance (IGD) and spread. The experimental results show the performance of the improved algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Raja, B.D., Jhala, R., Patel, V.: Many-objective optimization of shell and tube heat exchanger. Therm. Sci. Eng. Prog. 2, 87–101 (2017)
Yuan, Y., Xu, H., Wang, B., Zhang, B., Yao, X.: Balancing convergence and diversity in decomposition-based many-objective optimizers. IEEE Trans. Evol. Comput. 20(2), 180–198 (2016)
Trivedi, A., Srinivasan, D., Sanyal, K., Ghosh, A.: A survey of multiobjective evolutionary algorithms based on decomposition. IEEE Trans. Evol. Comput. 21(3), 440–462 (2017)
Cheng, R., Jin, Y.C., Olhofer, M., Sendhoff, B.: A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 20(5), 773–791 (2016)
Cheng, J., Yen, G.G., Zhang, G.: A many-objective evolutionary algorithm with enhanced mating and environmental selections. IEEE Trans. Evol. Comput. 19(4), 592–605 (2015)
Yu, X., Lu, Y., Yen, G.G., Cai, M.: Differential evolution mutation operators for constrained multi-objective optimization. Appl. Soft Comput. 67, 452–466 (2018)
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)
Seada, H., Deb, K.: A unified evolutionary optimization procedure for single, multiple, and many objectives. IEEE Trans. Evol. Comput. 20(3), 358–369 (2016)
Yuan, Y., Ong, Y.S., Gupta, A., Xu, H.: Objective reduction in many-objective optimization: evolutionary multiobjective approaches and comprehensive analysis. IEEE Trans. Evol. Comput. 22, 189–210 (2018)
Li, F., Cheng, R., Liu, J., Jin, Y.: A two-stage R2 indicator based evolutionary algorithm for many-objective optimization. Appl. Soft Comput. 67, 245–260 (2018)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)
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)
Ibrahim, A., Rahnamayan, S., Martin, M.V., Deb, K.: EliteNSGA-III: an improved evolutionary many-objective optimization algorithm. In: 2016 IEEE Congress on Evolutionary Computation, CEC, pp. 973–982. IEEE Press, New York (2016)
Bi, X., Wang, C.: An improved NSGA-III algorithm based on elimination operator for many-objective optimization. Memet. Comput. 9(4), 361–383 (2017)
Zhang, Q., Li, H.: MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712–731 (2007)
Asafuddoula, M., Ray, T., Sarker, R.: A decomposition-based evolutionary algorithm for many objective optimization. IEEE Trans. Evol. Comput. 19(3), 445–460 (2015)
Khan, B., Johnstone, M., Hanoun, S., Lim, C.P., Creighton, D., Nahavandi, S.: Improved NSGA-III using neighborhood information and scalarization. In: 2016 IEEE International Conference on Systems, Man, and Cybernetics, SMC, pp. 003033–003038. IEEE Press, New York (2016)
Carlos, A., Coello, A., Lamont, G.B., Van Veldhuizen, D.A.: Evolutionary Algorithms for Solving Multi-Objective Problems. Springer, New York (2007). https://doi.org/10.1007/978-0-387-36797-2
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)
Sun, Y., Yen, G.G., Yi, Z.: IGD indicator-based evolutionary algorithm for many-objective optimization problems. IEEE Trans. Evol. Comput. (2018)
Zhou, A., Jin, Y., Zhang, Q., Sendhoff, B.: Combining model-based and genetics-based offspring generation for multi-objective optimization using a convergence criterion. In: IEEE Congress on Evolutionary Computation, CEC 2006, pp. 892–899. IEEE Press, New York (2006)
Tian, Y., Cheng, R., Zhang, X., Jin, Y.: PlatEMO: a MATLAB platform for evolutionary multi-objective optimization [educational forum]. IEEE Comput. Intell. Mag. 12(4), 73–87 (2017)
Acknowledgments
We would like to acknowledge the support from the National Science Foundation of China (61472095), Heilongjiang Province Natural Science Foundation (F2016039) and Research Foundation of Education Department of Heilongjiang (1352MSYYB016). This paper is also funded by the International Exchange Program of Harbin Engineering University for Innovation oriented Talents Cultivation.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Ding, R., Dong, H., He, J., Feng, X., Yu, X., Li, L. (2018). U-NSGA-III: An Improved Evolutionary Many-Objective Optimization Algorithm. In: Qiao, J., et al. Bio-inspired Computing: Theories and Applications. BIC-TA 2018. Communications in Computer and Information Science, vol 951. Springer, Singapore. https://doi.org/10.1007/978-981-13-2826-8_3
Download citation
DOI: https://doi.org/10.1007/978-981-13-2826-8_3
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-2825-1
Online ISBN: 978-981-13-2826-8
eBook Packages: Computer ScienceComputer Science (R0)