Abstract
The preselection aims to choose promising offspring solutions from a candidate set in evolutionary algorithms. Usually the preselection process is based on the real or estimated objective values, which might be expensive. It is arguable that the preselection is doing classification in nature, which requires to know a solution is good or not instead of knowing how good it is. In this paper we apply a classification based preselection (CPS) to a multiobjective evolutionary algorithm based on decomposition (MOEA/D). In each generation, a set of candidate solutions are generated for each subproblem and only a good one is chosen as the offspring by the CPS. The modified MOEA/D, denoted as MOEA/D-CPS, is applied to a set of test instances, and the experimental results suggest that the CPS can successfully improve the performance of MOEA/D.
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
Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester (2001)
Zhou, A., Qu, B.Y., Li, H., Zhao, S.Z., Suganthanb, P.N., Zhang, Q.: Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol. Comput. 1, 32–49 (2011)
Knowles, J., Corne, D.: Approximating the nondominated front using the pareto archived evolution strategy. Evol. Comput. 8, 149–172 (2000)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182–197 (2002)
Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength pareto evolutionary algorithm. In: Evolutionary Methods for Design Optimisation and Control, pp. 95–100 (2001)
Basseur, M., Zitzler, E.: Handling uncertainty in indicator-based multiobjective optimization. Int. J. Comput. Intell. Res. 2, 255–272 (2006)
Zitzler, E., Künzli, S.: Indicator-based selection in multiobjective search. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 832–842. Springer, Heidelberg (2004)
Bader, J., Zitzler, E.: HypE: an algorithm for fast hypervolume-based manyobjective optimization. Technical report TIK 286, Computer Engineering and Networks Laboratory, ETH Zurich 19, pp. 45–76 (2010)
Zhang, Q., Li, H.: MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11, 712–731 (2007)
Li, H., Zhang, Q.: Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II. IEEE Trans. Evol. Comput. 13, 284–302 (2009)
Li, Y., Zhou, A., Zhang, G.: An MOEA/D with multiple differential evolution mutation operators. In: 2014 IEEE Congress on Evolutionary Computation (CEC), pp. 397–404 (2014)
Zhang, Q., Zhou, A., Jin, Y.: RM-MEDA: a regularity model-based multiobjective estimation of distribution algorithm. IEEE Trans. Evol. Comput. 12, 41–63 (2008)
Zhou, A., Zhang, Q., Zhang, G.: A multiobjective evolutionary algorithm based on decomposition and probability model. In: 2012 IEEE Congress on Evolutionary Computation (CEC), pp. 1–8 (2012)
Zhou, A., Zhang, Y., Zhang, G., Gong, W.: On neighborhood exploration and subproblem exploitation in decomposition based multiobjective evolutionary algorithms. In: 2015 IEEE Congress on Evolutionary Computation (CEC) (2015)
Zhang, J., Zhou, A., Zhang, G.: A classification based preselection for evolutionary algorithms. Swarm and Evolutionary Computation (2015, under review)
Zhang, J., Zhou, A., Zhang, G.: A classification and pareto domination based multiobjective evolutionary algorithm. In: 2015 IEEE Congress on Evolutionary Computation (CEC) (2015)
Bishop, C.: Pattern Recognition and Machine Learning. Springer, New York (2006)
Weiss, S.M., Kapouleas, I.: An empirical comparison of pattern recognition, neural nets, and machine learning classification methods. In: Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pp. 781–787 (1989)
Michie, D., Spiegelhalter, D.J., Taylor, C.: Machine Learning, Neural and Statistical Classification. Ellis Horwood, Upper Saddle River (1994)
Coomans, D., Massart, D.: Alternative k-nearest neighbour rules in supervised pattern recognition: Part 1. k-Nearest neighbour classification by using alternative voting rules. Anal. Chim. Acta 136, 15–27 (1982)
Wang, Y., Cai, Z., Qingfu, Z.: Differential evolution with composite trial vector generation strategies and control parameters. IEEE Trans. Evol. Comput. 15, 55–66 (2011)
Zhou, A., Zhang, Q., Jin, Y.: Approximating the set of Pareto-optimal solutions in both the decision and objective spaces by an estimation of distribution algorithm. IEEE Trans. Evol. Comput. 13, 1167–1189 (2009)
Acknowledgment
This work is supported by China National Instrumentation Program under Grant No.2012YQ180132, the National Natural Science Foundation of China under Grant No.61273313, and the Science and Technology Commission of Shanghai Municipality under Grant No.14DZ2260800.
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
Zhang, J., Zhou, A., Zhang, G. (2015). A Multiobjective Evolutionary Algorithm Based on Decomposition and Preselection. 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_56
Download citation
DOI: https://doi.org/10.1007/978-3-662-49014-3_56
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)