Abstract
The complexity of multi-objective evolutionary algorithms based on the non-dominated principles mainly depends on finding non-dominated fronts. In order to reduce complexity and improve construction efficiency, this paper introduces a non-dominated set construction algorithm based on Two Dimensional Sequence (TSNS). When the non-dominated set closes to the Pareto optimal front, it always maintains one dimension by ascending order while the other dimension by descending order. In order to verify the effectiveness of the proposed algorithm, we integrate the algorithm into GA, DE, PSO, then we tested and compared it with classical benchmark functions. The experimental results indicate that the proposed algorithm performs better than NSGA-II in terms of the quality of solutions and the speed of convergence.
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
Ansgar, K., Dieter, H.: Multi-objective ant colony optimisation-based routing in WSNs. Int. J. Bio-Inspired Comput. (IJBIC) 6(5), 322–332 (2014)
Saeideh, S., Mathias, S., Drechsler, R.: Multi-objective BDD optimization with evolutionary algorithms. In: Proceedings of the 2015 on Genetic and Evolutionary Computation Conference, pp. 751–758. ACM, New York (2015)
Giagkiozis, I., Fleming, P.J.: Methods for multi-objective optimization: an analysis. Inf. Sci. 293, 338–350 (2015)
von Lucken, C., Barán, B., Brizuela, C.: A survey on multi-objective evolutionary algorithms for many-objective problems. Comput. Optim. Appl. 58(3), 707–756 (2014)
Zeng, S., Zhou, D., Li, H.: Non-dominated sorting genetic algorithm with decomposition to solve constrained optimisation problems. Int. J. Bio-Inspired Comput. 5(3), 150–163 (2013)
Deb, K., Pratap, A., Agarwal, S., et al.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)
Zitzler, E., Laumanns, M., Thiele, L.: Improving the strength pareto evolutionary algorithm for multiobjective optimization, optimization and control with applications to industrial problems, pp. 95–100 (2002)
Knowles, J, Corne, D: The pareto archived evolution strategy: a new baseline algorithm for pareto multiobjective optimization. In: Proceedings of the Congress on Evolutionary Computation, pp. 98–105. IEEE Press, Washington (1999)
Zhou, C., Chen, Z., He, Z.: Survey of many-objective optimization algorithms. Comput. Sci. 41(z1), 57–60 (2014)
Li, M., Zhang, J.: An indicator for assessing the spread of solutions in muti-objective evolution. Chin. J. Comput. 34(4), 647–664 (2011)
Liu, M., Zeng, W., Zhao, J.: A fast Bi-objective non-dominated sorting algorithm. Pattern Recog. Artif. Intell. 24(4), 538–547 (2011)
Li, Z., Lin, X.: Research advance of multi-objective optimization non-dominated set construction methods. Comput. Eng. Appl. 49(19), 31–35 (2013)
Drozdik, M., Aguirre, H., Tanaka, K.: Attempt to reduce the computational complexity in multi-objective differential evolution algorithms. In: Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, pp. 599–606. ACM, New York (2013)
Jensen, M.T.: Reducing the run-time complexity of multiobjective EAs: the NSGA-II and other algorithms. IEEE Trans. Evol. Comput. 7(5), 503–515 (2003)
Kukkonen, S, Deb, K: Improved pruning of non-dominated solutions based on crowding distance for Bi-objective optimization problems. In: Proceedings of the World Congress on Computational Intelligence, pp. 1179–1186 (2006)
Kukkonen, S., Deb, K.: A fast and effective method for pruning of non-dominated solutions in many-objective problems. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 553–562. Springer, Heidelberg (2006)
Qi, Y., Liu, F., Chang, W., Ma, X., Jiao, L.: Memetic immune algorithm for multiobjective optimization. J. Softw. 24(7), 1529–1544 (2013)
Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: empirical results. Evol. Comput. 8(2), 173–195 (2000)
Fonseca, C.M., Fleming, P.J.: Multiobjective optimization and multiple constraint handling with evolutionary algorithms. Part II: application example. Trans. Syst. Man Cybern. Part A: Syst. Hum. 28, 38–47 (1998)
Acknowledgments
This work is partially supported by Guangdong Provincial Key Laboratory of Petrochemical Equipment Fault Diagnosis, Guangdong University of Petrochemical Technology.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fu, Y., Huang, H., Ye, S., Lv, L., Zhang, H., Shao, L. (2015). An Algorithm for Finding Non-dominated Set Based on Two-Dimension Sorting. In: Gong, M., Linqiang, P., Tao, S., Tang, K., Zhang, X. (eds) Bio-Inspired Computing -- Theories and Applications. BIC-TA 2015. Communications in Computer and Information Science, vol 562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49014-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-662-49014-3_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-49013-6
Online ISBN: 978-3-662-49014-3
eBook Packages: Computer ScienceComputer Science (R0)