Abstract
NSGA-II and its contemporary EMO algorithms were found to be vulnerable in solving many-objective optimization problems having four or more objectives. It is not surprising that EMO researchers have been concentrating in developing efficient algorithms for many-objective optimization problems. Recently, authors suggested an extension of NSGA-II (NSGA-III) which is based on the supply of a set of reference points and demonstrated its working in three to 15-objective optimization problems. In this paper, NSGA-III’s reference point allocation task is made adaptive so that a better distribution of points can be found. The approach is compared with NSGA-III and a previous adaptive approach on a number of constrained and unconstrained many-objective optimization problems. NSGA-III and its adaptive extension proposed here open up new directions for research and development in the area of solving many-objective optimization problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Deb, K.: Multi-objective optimization using evolutionary algorithms. Wiley, Chichester (2001)
Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)
Deb, K., Jain, H.: An improved NSGA-II procedure for many-objective optimization Part I: Problems with box constraints. Technical Report KanGAL Report Number 2012009, Indian Institute of Technology Kanpur (2012)
Deb, K., Jain, H.: An improved NSGA-II procedure for many-objective optimization, Part II: Handling constraints and extending to an adaptive approach. Technical Report KanGAL Report Number 2012010, Indian Institute of Technology Kanpur (2012)
Deb, K., Jain, H.: Handling many-objective problems using an improved NSGA-II procedure. In: Proceedings of World Congress on Computational Intelligence, WCCI 2012, Brisbane, Auatralia, June 10-15, pp. 10–15 (2012) (in press)
Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable test problems for evolutionary multi-objective optimization. In: Abraham, A., Jain, L., Goldberg, R. (eds.) Evolutionary Multiobjective Optimization, pp. 105–145. Springer, London (2005)
Hughes, E.J.: Evolutionary many-objective optimisation: Many once or one many? In: IEEE Congress on Evolutionary Computation, CEC 2005, pp. 222–227 (2005)
Ishibuchi, H., Tsukamoto, N., Nojima, Y.: Evolutionary many-objective optimization: A short review. In: Proceedings of Congress on Evolutionary Computation, CEC 2008, pp. 2424–2431 (2008)
Liao, X., Li, Q., Zhang, W., Yang, X.: Multiobjective optimization for crash safety design of vehicle using stepwise regression model. Structural and Multidisciplinary Optimization 35, 561–569 (2008)
López, J.A., Coello, C.A.C.: Some techniques to deal with many-objective problems. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference, pp. 2693–2696. ACM, New York (2009)
Zhang, Q., Li, H.: MOEA/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Transactions on Evolutionary Computation 11(6), 712–731 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jain, H., Deb, K. (2013). An Improved Adaptive Approach for Elitist Nondominated Sorting Genetic Algorithm for Many-Objective Optimization. In: Purshouse, R.C., Fleming, P.J., Fonseca, C.M., Greco, S., Shaw, J. (eds) Evolutionary Multi-Criterion Optimization. EMO 2013. Lecture Notes in Computer Science, vol 7811. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37140-0_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-37140-0_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37139-4
Online ISBN: 978-3-642-37140-0
eBook Packages: Computer ScienceComputer Science (R0)