Abstract
We propose a new evolutionary multi-objective optimization (EMO) algorithm based on chaotic evolution optimization framework, which is called as multi-objective chaotic evolution (MOCE). It extends the optimization application of chaotic evolution algorithm to multi-objective optimization field. The non-dominated sorting and tournament selection using crowding distance are two techniques to ensure Pareto dominance and solution diversity in EMO algorithm. However, the search capability of multi-objective optimization algorithm is a serious issue for its practical application. Chaotic evolution algorithm presents a strong search capability for single objective optimization due to the ergodicity of chaotic system. Proposed algorithm is a promising multi-objective optimization algorithm that composes a search algorithm with strong search capability, dominant sort for keeping Pareto dominance, and tournament selection using crowding distance for increasing the solution diversity. We evaluate our proposed MOCE by comparing with NSGA-II and an algorithm using the basic framework of chaotic evolution but different mutation strategy. From the evaluation results, the MOCE presents a strong optimization performance for multi-objective optimization problems, especially in the condition of higher dimensional problems. We also analyse, discuss, and present some research subjects, open topics, and future works on the MOCE.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
Farina, M., Amato, P.: On the optimal solution definition for many-criteria optimization problems. In: Proceedings of the NAFIPS-FLINT international conference, pp. 233–238 (2002)
Karush, W.: Minima of functions of several variables with inequalities as side constraints. Master’s thesis, Department of Mathematics, University of Chicago (1939)
Li, B., Li, J., Tang, K., Yao, X.: Many-objective evolutionary algorithms: a survey. ACM Comput. Surv. (CSUR) 48(1), 13 (2015)
Pei, Y.: Chaotic evolution: fusion of chaotic ergodicity and evolutionary iteration for optimization. Nat. Comput. 13(1), 79–96 (2014)
Pei, Y.: From determinism and probability to chaos: chaotic evolution towards philosophy and methodology of chaotic optimization. Sci. World J., Article ID 704587 (2015)
Srinvas, N., Deb, K.: Multi-objective function optimization using non-dominated sorting genetic algorithms. Evol. Comput. 2(3), 221–248 (1994)
Zar, J.H.: Biostatistical Analysis. Pearson Education, India (1999)
Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: empirical results. Evol. Comput. 8(2), 173–195 (2000)
Acknowledgements
The author, Jia Hao, would like to thank the strong support provided by Beijing Natural Science Foundation (BJNSF 3172028).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Pei, Y., Hao, J. (2017). Non-dominated Sorting and Crowding Distance Based Multi-objective Chaotic Evolution. In: Tan, Y., Takagi, H., Shi, Y., Niu, B. (eds) Advances in Swarm Intelligence. ICSI 2017. Lecture Notes in Computer Science(), vol 10386. Springer, Cham. https://doi.org/10.1007/978-3-319-61833-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-61833-3_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-61832-6
Online ISBN: 978-3-319-61833-3
eBook Packages: Computer ScienceComputer Science (R0)