Abstract
Penalty function methods have been widely used for handling constraints, but it’s still a challenge about how to set the penalty parameter effectively though many related methods have been proposed. In this paper, the penalty parameter is firstly analyzed systematically by introducing four rules. Based on this analysis, a new Dynamic Penalty Function (DyPF) is proposed by adjusting penalty parameter in three different situations during the evolution (i.e., the infeasible situation, the semi-feasible situation, and the feasible situation). The experiments are designed to verify the effectiveness of our newly proposed DyPF. The results show that DyPF presents a better overall performance than other five dynamic or adaptive state-of-the-art methods in the community of constrained evolutionary optimization.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Michalewicz, Z., Schoenauer, M.: Evolutionary algorithm for constrained parameter optimization problems. Evol. Comput. 4(1), 1–32 (1996)
Coello Coello, C.A.: Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art. Comput. Methods Appl. Mech. Eng. 191(11/12), 1245–1287 (2002)
Cai, Z., Wang, Y.: A multiobjective optimization-based evolutionary algorithm for constrained optimization. IEEE Trans. Evol. Comput. 10(6), 658–675 (2006)
Wang, Y., Cai, Z.: A dynamic hybrid framework for constrained evolutionary optimization. IEEE Trans. Syst. Man Cybern. B Cybern. 42(1), 203–217 (2012)
Mezura-Montes, E., Coello Coello, C.A.: A simple multimembered evolution strategy to solve constrained optimization problems. IEEE Trans. Evol. Comput. 9(1), 1–17 (2005)
Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Trans. Evol. Comput. 2(2), 124–141 (1999)
Deb, K.: An efficient constraint handling method for genetic algorithms. Comput. Methods Appl. Mech. Eng. 186(2–4), 311–338 (2000)
Runarsson, T.P., Yao, X.: Stochastic ranking for constrained evolutionary optimization. IEEE Trans. Evol. Comput. 4(3), 284–294 (2000)
Runarsson, T.P., Yao, X.: Search bias in constrained evolutionary optimization. IEEE Trans. Syst. Man Cybern. C Appl. Rev. 35(2), 233–243 (2005)
Wang, Y., Cai, Z., Zhou, Y., Zeng, W.: An adaptive tradeoff model for constrained evolutionary optimization. IEEE Trans. Evol. Comput. 12(1), 80–92 (2008)
Wang, Y., Cai, Z.: Constrained evolutionary optimization by means of (μ+λ)-differential evolution and improved adaptive trade-off model. Evol. Comput. 19(2), 249–285 (2011)
Jia, G., Wang, Y., Cai, Z., Jin, Y.: An improved (μ+λ)-constrained differential evolution for constrained optimization. Inform. Sci. 222, 302–322 (2013)
Zhan, Z., Zhang, J., Li, Y., Chung, H.S.: Adaptive particle swarm optimization. IEEE Trans. Syst. Man Cybern. B Cybern. 39(6), 1362–1381 (2009)
Gong, W., Cai, Z., Ling, C.X., Li, H.: Enhanced differential evolution with adaptive strategies for numerical optimization. IEEE Trans. Syst. Man Cybern. B Cybern. 41(2), 397–413 (2011)
Minhazul, I.S., Das, S., Ghosh, S., Roy, S., Suganthan, P.N.: An adaptive differential evolution algorithm with novel mutation and crossover strategies for global numerical optimization. IEEE Trans. Syst. Man Cybern. B Cybern. 42(2), 482–500 (2012)
Zhao, S.Z., Suganthan, P.N., Das, S.: Self-adaptive differential evolution with multi-trajectory search for large scale optimization. Soft Comput. 15(11), 2175–2185 (2011)
Farmani, R., Wright, J.A.: Self-adaptive fitness formulation for constrained optimization. IEEE Trans. Evol. Comput. 7(5), 445–455 (2003)
Venkatraman, S., Yen, G.G.: A generic framework for constrained optimization using genetic algorithms. IEEE Trans. Evol. Comput. 9(4), 424–435 (2005)
Zhang, M., Luo, W., Wang, X.: Differential evolution with dynamic stochasitc selection for constrained optimization. Inform. Sci. 178(15), 3043–3074 (2008)
Tessema, B., Yen, G.G.: An adaptive penalty formulation for constrained evolutionary optimization. IEEE Trans. Syst., Man, Cybern. A Syst. Hum. 39(3), 565–578 (2009)
Si, C., Lan, T., Hu, J., Wang, L., Wu, Q.: Penalty parameter of the penalty function method. Control Decis. 29(9), 1707–1710 (2014)
Das, S., Suganthan, P.N.: Differential evolution: A Survey of the state-of-the-art. IEEE Trans. Evol. Comput. 15(1), 4–31 (2011)
Liang, J.J., Runarsson, T.P., Mezura-Montes, E., Clerc, M., Suganthan, P.N., Coello Coello, C.A., Deb, K.: Problem definitions and evaluation criteria for the CEC 2006. Technical report, Special Session on Constrained Real-Parameter Optimization (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Si, C., Shen, J., Zou, X., Duo, Y., Wang, L., Wu, Q. (2015). A Dynamic Penalty Function for Constrained Optimization. In: Tan, Y., Shi, Y., Buarque, F., Gelbukh, A., Das, S., Engelbrecht, A. (eds) Advances in Swarm and Computational Intelligence. ICSI 2015. Lecture Notes in Computer Science(), vol 9141. Springer, Cham. https://doi.org/10.1007/978-3-319-20472-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-20472-7_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20471-0
Online ISBN: 978-3-319-20472-7
eBook Packages: Computer ScienceComputer Science (R0)