Abstract
Constrained optimization is an active area of research where attempts are being regularly made to improve the efficiency of the underlying optimization algorithms. While population based stochastic algorithms such as evolutionary algorithms, differential evolution (DE), particle swarm optimization etc. have been the popular choice as the underlying optimization scheme, adaptive strategies are usually employed to deal with constraints. Most of such approaches adopt a complete evaluation policy, i.e., all constraints and objectives corresponding to a solution is always evaluated for every solution under consideration. However, in a typical constrained optimization problem, one or more constraints are often difficult to satisfy and it might be beneficial to evaluate the constraints in a sequence. Evaluation of subsequent constraints and objective function can be skipped whenever a constraint is violated. In this paper, a self adaptive differential evolution algorithm is introduced which maintains multiple subpopulations, each of which is assigned a prescribed constraint sequence based on a ring topology. Solutions are ranked in each subpopulation and a migration scheme is employed to transfer feasible solutions to a subpopulation of feasible individuals. The performance of the proposed scheme is compared with a single sequence approach and other state of the art DE forms using the standard g-series test functions having inequality constraints. The results clearly indicate the potential savings in the computational cost. Apart from savings in computational cost, the paper also makes an important contribution as it provides useful physical insights on the search trajectories and their effect in various forms of constrained optimization problems.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brest, J.: Self-adaptive differential evolution algorithm in constrained real-parameter optimization. In: 2006 IEEE Congress on Evolutionary Computation (CEC 2006), July 16-21, pp. 215–222. IEEE Press, Vancouver (2006)
Coello, C.A.C.: Theoretical and numerical constraint handling techniques used with evolutionary algorithms: A survey of the state of the art. Computer Methods in Applied Mechanics and Engineering 191(11-12), 1245–1287 (2002)
Coit, D.W., Smith, A.E.: Penalty guided genetic search for reliability design optimization. Computers and Industrial Engineering 30(4), 895–904 (1996)
FitzGerald, A., O’Donoghue, D.P.: Genetic Repair for Optimization under Constraints Inspired by Arabidopsis Thaliana. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 399–408. Springer, Heidelberg (2008)
Hinterding, R., Michalewicz, Z.: Your brains and my beauty: Parent matching for constrained optimisation. In: Proceedings of the 5th International Conference on Evolutionary Computation, Anchorage, Alaska, pp. 810–815 (May 1998)
Huang, V.L., Qin, A.K., Suganthan, P.N.: Self-adaptative differential evolution algorithm for constrained real-parameter optimization. In: 2006 IEEE Congress on Evolutionary Computation (CEC 2006), pp. 324–331. IEEE Press, Vancouver (2006)
Koziel, S., Michalewicz, Z.: A Decoder-Based Evolutionary Algorithm for Constrained Parameter Optimization Problems. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 231–240. Springer, Heidelberg (1998)
Liang, J.J., Runarsson, T.P., Mezura-Montes, E., Clerc, M., Suganthan, P., Coello, C.A., Deb, K.: Problem definitions and evaluation criteria for the cec 2006 special session on constrained real-parameter optimization. Technical Report, Nanyang Technological University, Singapore (December 2005), http://www.ntu.edu.sg/home/EPNsugan/
Liu, J., Fan, Z., Goodman, E.: Srde: An improved differential evolution based on stochastic ranking. In: 2009 ACM SIGEVO Summit on Genetic and Evolutionary Computation (GEC 2009), June 12-14, pp. 345–352. ACM Press, Shanghai (2009)
Michalewicz, Z., Schoenauer, M.: Evolutionary algorithms for constrained parameter optimization problems. Evolutionary Computation 4(1), 1–32 (1996)
Powell, D., Skolnick, M.M.: Using genetic algorithms in engineering design optimization with non-linear constraints. In: Forrest, S. (ed.) Proceedings of the Fifth International Conference on Genetic Algorithms (ICGA 1993), pp. 424–431. Morgan Kaufmann Publishers, San Mateo (1993)
Qu, B.Y., Suganthan, P.N.: Constrained multi-objective optimization algorithm with an ensemble of constraint handling methods. Engineering Optimization 43(4), 403–416 (2011)
Schoenauer, M., Xanthakis, S.: Constrained GA optimization. In: Forrest, S. (ed.) Proceedings of the Fifth International Conference on Genetic Algorithms (ICGA 1993), pp. 573–580. Morgan Kauffman Publishers, San Mateo (1993)
Takahama, T., Sakai, S.: Constrained optimization by the ε constrained differential evolution with an archive and gradient-based mutation. In: 2010 IEEE Congress on Evolutionary Computation (CEC 2010), July 18-23, pp. 1680–1688. IEEE Press, Barcelona (2010)
Zavala, A.E.M., Aguirre, A.H., Diharce, E.R.V.: Continuous Constrained Optimization with Dynamic Tolerance Using the COPSO Algorithm. In: Mezura-Montes, E. (ed.) Constraint-Handling in Evolutionary Optimization. SCI, vol. 198, pp. 1–23. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asafuddoula, M., Ray, T., Sarker, R. (2012). A Self-adaptive Differential Evolution Algorithm with Constraint Sequencing. In: Thielscher, M., Zhang, D. (eds) AI 2012: Advances in Artificial Intelligence. AI 2012. Lecture Notes in Computer Science(), vol 7691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35101-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-35101-3_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35100-6
Online ISBN: 978-3-642-35101-3
eBook Packages: Computer ScienceComputer Science (R0)