Abstract
In the classical multi-objective algorithm, after sorting all the solutions of population, the non-dominant sorting method selects the better half of the solutions to enter the next generation. In solving the many objective optimization problem, due to the small environmental selection pressure, there will be a lot of redundancy when the selection solution enters the next generation. In order to solve this problem, a fuzzy non-dominant sorting method is proposed to sort the individual population. This method can determine the dominant relationship between the two individuals by comparing to three objectives just, which makes the calculation cost of many-objective approximate to three objectives. Meanwhile, the proposed method increases the selection pressure and improves the computational efficiency. In addition, due to the number of objectives is large, the traditional methods cannot accurately calculate the congestion distance. We design a method based on inflection point and hyperplane to calculate the congestion distance; thus, the selected individuals are evenly distributed by means of sparse individuals. A many-objective evolution algorithm is obtained by using the differential evolution search framework and combining the proposed methods of fuzzy non-dominant sorting and sparse individuals. Finally, the proposed algorithm is used to solve the standard test function DTLZ1-DTLZ6. The simulation results show that the performance of our algorithm on the IGD is similar with the famous comparison algorithms, and that is better than the famous comparison algorithm in running time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Herrero, J.G., Berlang, A., et al.: Effective evolutionary algorithms for many-specifications attainment: application to air traffic control tracking filters. IEEE Trans. Evol. Comput. 13(1), 151–168 (2009)
Ishibuchi, H., Murata, T.: A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans. Syst. Man Cybern. Part C Appl. Rev. 28(3), 392–403 (1998)
Yeung, S.H., Man, K.F., et al.: A trapeizform U-slot folded patch feed antenna design optimized with jumping genes evolutionary algorithm. IEEE Trans. Antennas Propag. 56(2), 571–577 (2008)
Handl, J., Kell, D.B., et al.: Multi-objective optimization in bioinformatics and computational biology. IEEE/ACM Trans. Comput. Biol. Bioinf. 4(2), 279–292 (2007)
Ponsich, A., Jaimes, A.L., et al.: A survey on multi-objective evolutionary algorithms for the solution of the portfolio optimization problem and other finance and economics applications. IEEE Trans. Evol. Comput. 17(3), 321–344 (2013)
Coello, C.C., Gary, B.L., et al.: Evolutionary Algorithms for Solving Multi-Objective Problems, pp. 1–140. Springer, Heidelberg (2007). https://doi.org/10.1007/978-0-387-36797-2
Zhang, X., Tian, Y., et al.: Approximate non-dominated sorting for evolutionary many-objective optimization. Inf. Sci. 369, 14–33 (2016)
Yang, S., Li, M., et al.: A grid-based evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 17(5), 721–736 (2013)
Gomez, R.H., Coello, C.A.C.: MOMBI: a new metaheuristic for many-objective optimization based on the R2 indicator. In: Proceedings of IEEE Congress on Evolutionary Computation, pp. 2488–2495. IEEE, New York (2013)
Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference point based non-dominated sorting approach, part I: solving problems with box constraints. IEEE Trans. Evol. Comput. (2014). https://doi.org/10.1109/tevc.2013.2281535
Zhang, Q., Li, H.: MOEA/D: a multi-objective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712–731 (2007)
Jaimes, A.L., Coello, C., et al.: Objective space partitioning using conflict information for solving many-objective problems. Inf. Sci. 268, 305–327 (2014)
Tan, Y., Jiao, Y., et al.: MOEA/D uniform design: a new version of MOEA/D for optimization problems with many objectives. Comput. Oper. Res. 40, 1648–1660 (2013)
Xu, Y., Pan, X.: A method of efficient three-objective differential Evolution using Pareto non-dominant relation. Res. Comput. Appl. 36(03), 817–823+828 (2019)
Xu, Y., Fang, J.: A fast multi-objective differential evolutionary algorithm based on non-dominant solution ordering. Res. Comput. Appl. 34(9), 2547–2551 (2014)
Das, S., Mullick, S.S., et al.: Recent advances in differential evolution-an updated survey. Swarm Evol. Comput. 4(27), 1–30 (2016)
Xie, T., Chen, H., et al.: An evolutionary algorithm for multi-objective optimization. Comput. J. 26(8), 173–181 (2003)
Deb, K., Pratap, A., et al.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Xu, Y., Pan, X., Jiao, X., Lv, Y., Song, T. (2020). Based on Fuzzy Non-dominant and Sparse Individuals to Improve Many-Objective Differential Evolutionary. In: Pan, L., Liang, J., Qu, B. (eds) Bio-inspired Computing: Theories and Applications. BIC-TA 2019. Communications in Computer and Information Science, vol 1159. Springer, Singapore. https://doi.org/10.1007/978-981-15-3425-6_55
Download citation
DOI: https://doi.org/10.1007/978-981-15-3425-6_55
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-3424-9
Online ISBN: 978-981-15-3425-6
eBook Packages: Computer ScienceComputer Science (R0)