Abstract
This paper proposes a new evolutionary algorithm with adaptive penalty coefficient. Firstly, the crossover operator of the new algorithm searches a lower-dimensional neighbor of the parent points, so that the algorithm converges fast, especially for high-dimensional problems. Secondly, the violation values of all constraint functions and the value of the objective function are normalized, and therefore, only one penalty coefficient is needed in the scheme. The penalty coefficient is selected adaptively. It is not too big, so as the algorithm can converge fast, and it is not too small so as the algorithm can avoid local optimal as much as possible. Thirdly, the standard deviation of violation values of the constraint functions is added to the violation item in the penalty function, and therefore, the individuals in the population can evenly approach the feasible region from the infeasible space. We have used the 24 constrained benchmark problems to test the new algorithm. The experimental results show it works better than or competitive to a known effective algorithm [7]
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Michalewicz, Z., Nazhiyath, G.: Genocop III: A co-evolutionary algorithm for numerical optimization with nonlinear constraints. In: Proceedings of the Second IEEE International Conference on Evolutionary Computation, pp. 647–651. IEEE Press, Los Alamitos (1995)
El-Gallad, A.I., El-Hawary, M.E., Sallam, A.A.: Swarming of intelligent particles for solving the nonlinear constrained optimization problem. Engineering Intelligent Systems for Electrical Engineering and Communications 9(3), 155–163 (2001)
Deb, K.: An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering 186(2/4), 311–338 (2000)
Runarsson, T.P., Yao, X.: Stochastic ranking for constrained evolutionary optimization. IEEE Transactions on Evolutionary Computation 4(3), 284–294 (2000)
Mezura-Montes, E., Coello, C.A.C.: A simple multimembered evolution strategy to solve constrained optimization problems. IEEE Trans. on Evolutionary Computation 9(1), 1–17 (2005)
Venkatraman, S., Yen, G.G.: A generic framework for constrained optimization using genetic algorithms. IEEE Trans. on Evolutionary Computation 9(4), 424–435 (2005)
Takahama, T., Sakai, S.: Constrained Optimization by the ε- Constrained Differential Evolution with Gradient-Based Mutation and Feasible Elites. In: Proceedings of the 2006 Congress on Evolutionary Computatoin (CEC 2006), Canada, pp. 308–315 (2006)
Takahama, T., Sakai, S.: Learning fuzzy control rules by αconstrained powell’s method. In: Proceedings of 1999 IEEE International Fuzzy Systems Conference, Seoul, Korea, vol. 2, pp. 650–655 (August 1999)
Camponogara, E., Talukdar, S.N.: A genetic algorithm for constrained and multiobjective optimization. In: Alander, J.T. (ed.) 3rd Nordic Workshop on Genetic Algorithms and Their Applications (3NWGA), pp. 49–62. University of Vaasa, Vaasa (August 1997)
Surry, P.D., Radcliffe, N.J.: The COMOGA method: Constrained optimisation by multiobjective genetic algorithms. Control and Cybernetics 26(3), 391–412 (1997)
Runarsson, T.P., Yao, X.: Evolutionary search and constraint violations. In: Proceedings of the 2003 Congress on Evolutionary Computation, vol. 2, pp. 1414–1419. IEEE Service Center, Piscataway (2003)
Aguirre, A.H., Rionda, S.B., Coello, C.A.C., Lizárraga, G.L., Montes, E.M.: Handling constraints using multiobjective optimization concepts. International Journal for Numerical Methods in Engineering 59(15), 1989–2017 (2004)
Schwefel, H.P.: Evolution and Optimum Seeking. John Wiley & Sons, New York (1995)
Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial Intelligence through Simulated Evolution. John Wiley, New York (1966)
Storn, R., Price, K.: Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization 11, 341–359 (1997)
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proc. IEEE Int. Conf. Neural Networks, pp. 1942–1948. IEEE Press, Piscataway (1995)
Hamida, S.B., Schoenauer, M.: ASCHEA: New results using adaptive segregational constraint handling. In: Proc. Congr. Evolutionary Computation, vol. 1, pp. 884–889 (2002)
Liang, J.J., Runarsson, T.P., Mezura-Montes, E., Clerc, M., Suganthan, P.N., Coello, C.A.C., Deb, K.: Problem definitions and evaluation criteria for the CEC2006 special session on constrained real-parameter optimization (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xiao, B., Yu, D., Zhang, L., Tian, X., Gao, S., Zeng, S. (2008). A Constrained Dynamic Evolutionary Algorithm with Adaptive Penalty Coefficient. In: Corchado, E., Abraham, A., Pedrycz, W. (eds) Hybrid Artificial Intelligence Systems. HAIS 2008. Lecture Notes in Computer Science(), vol 5271. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87656-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-87656-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87655-7
Online ISBN: 978-3-540-87656-4
eBook Packages: Computer ScienceComputer Science (R0)