×

Minimum penalty for constrained evolutionary optimization. (English) Zbl 1311.90191

Summary: Penalty function methods are popular in dealing with the constrained optimization problems. How to choose reasonable penalty coefficients is a crucial problem which usually poses great influence on the quality of the final solution found. In this paper, the definition of the minimum penalty coefficient is proposed and the calculation formulas are established. Then a penalty coefficient value slightly larger than the minimum penalty coefficient is considered suitable. Furthermore, a minimum penalty algorithm (MP) is derived by combining the minimum penalty with a simple differential evolution. The presented method does not require parameter tuning. Experimental results on the 22 well-known benchmark test functions and 5 engineering design problems indicate that MP can achieve very competitive results compared with other state-of-the-art approaches.
In addition, extra experiments are carried out to further verify the effectiveness of the proposed method for selecting proper penalty coefficients.

MSC:

90C59 Approximation methods and heuristics in mathematical programming
Full Text: DOI

References:

[1] Barbosa, H.J., Lemonge, A.C.C.: An adaptive penalty scheme in genetic algorithms for constrained optimization problems. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), pp. 287-294 (2002)
[2] Brest, J., Zumer, V., Maucec, M.S.: Self-adaptive differential evolution algorithm in constrained real-parameter optimization. In: IEEE Congress on Evolutionary Computation (CEC 2006), pp. 215-222. IEEE, Vancouver (2006)
[3] Cai, Z., Wang, Y.: A multiobjective optimization-based evolutionary algorithm for constrained optimization. IEEE Trans. Evol. Comput. 10(6), 658-675 (2006) · doi:10.1109/TEVC.2006.872344
[4] 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), 1245-1287 (2002) · Zbl 1026.74056 · doi:10.1016/S0045-7825(01)00323-1
[5] Costa, L., Santo, I.E., Oliveira, P.: An adaptive constraint handling technique for evolutionary algorithms. Optimization 62(2), 241-253 (2013) · Zbl 1269.49061 · doi:10.1080/02331934.2011.590486
[6] Das, S., Suganthan, P.N.: Differential evolution: a survey of the state-of-the-art. IEEE Trans. Evol. Comput. 15(1), 4-31 (2011) · doi:10.1109/TEVC.2010.2059031
[7] Deb, K.: An efficient constraint handling method for genetic algorithms. Comput. Methods Appl. Mech. Eng. 186(2), 311-338 (2000) · Zbl 1028.90533 · doi:10.1016/S0045-7825(99)00389-8
[8] Deb, K., Datta, R.: A fast and accurate solution of constrained optimization problems using a hybrid bi-objective and penalty function approach. In: IEEE Congress on Evolutionary Computation (CEC 2010), pp. 1-8. IEEE, New York (2010)
[9] Farmani, R., Wright, J.A.: Self-adaptive fitness formulation for constrained optimization. IEEE Trans. Evol. Comput. 7(5), 445-455 (2003) · doi:10.1109/TEVC.2003.817236
[10] Homaifar, A., Qi, C.X., Lai, S.H.: Constrained optimization via genetic algorithms. Simulation 62(4), 242-253 (1994) · doi:10.1177/003754979406200405
[11] Huang, Fz, Wang, L., He, Q.: An effective co-evolutionary differential evolution for constrained optimization. Appl. Math. Comput. 186(1), 340-356 (2007) · Zbl 1114.65061 · doi:10.1016/j.amc.2006.07.105
[12] Huang, V., Qin, A., Suganthan, P.: Self-adaptive differential evolution algorithm for constrained real-parameter optimization. In: IEEE Congress on Evolutionary Computation (CEC 2006), pp. 17-24. IEEE, Vancouver (2006)
[13] Joines, J.A., Houck, C.R.: On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with ga’s. In: Proceedings of the First IEEE Conference on Evolutionary Computation, pp. 579-584. IEEE, Piscataway (1994) · Zbl 0890.90161
[14] Kukkonen, S., Lampinen, J.: Constrained real-parameter optimization with generalized differential evolution. In: IEEE Congress on Evolutionary Computation (CEC 2006), pp. 207-214. IEEE, Vancouver (2006)
[15] Liang, J., Runarsson, T.P., Mezura-Montes, E., Clerc, M., Suganthan, P., Coello, C.C., Deb, K.: Problem definitions and evaluation criteria for the CEC 2006 special session on constrained real-parameter optimization. Technical report, Nanyang Technological University, Singapore (2006)
[16] Mallipeddi, R., Suganthan, P.N.: Ensemble of constraint handling techniques. IEEE Trans. Evol. Comput. 14(4), 561-579 (2010) · doi:10.1109/TEVC.2009.2033582
[17] Mezura-Montes, E., Coello, C.C.: A simple multimembered evolution strategy to solve constrained optimization problems. IEEE Trans. Evol. Comput. 9(1), 1-17 (2005) · doi:10.1109/TEVC.2004.836819
[18] Mezura-Montes, E., Coello Coello, C.A.: Constraint-handling in nature-inspired numerical optimization: past, present and future. Swarm Evol. Comput. 1(4), 173-194 (2011) · doi:10.1016/j.swevo.2011.10.001
[19] Mezura-Montes, E., Velázquez-Reyes, J., Coello Coello, C.: Modified differential evolution for constrained optimization. In: IEEE Congress on Evolutionary Computation (CEC 2006), pp. 25-32. IEEE, Vancouver (2006)
[20] Michalewicz, Z., Schoenauer, M.: Evolutionary algorithms for constrained parameter optimization problems. Evol. Comput. 4(1), 1-32 (1996) · doi:10.1162/evco.1996.4.1.1
[21] Powell, D., Skolnick, M.M.: Using genetic algorithms in engineering design optimization with non-linear constraints. In: Proceedings of the 5th International Conference on Genetic Algorithms, pp. 424-431. Morgan Kaufmann, San Francisco (1993)
[22] Ray, T., Liew, K.M.: Society and civilization: an optimization algorithm based on the simulation of social behavior. IEEE Trans. Evol. Comput. 7(4), 386-396 (2003) · doi:10.1109/TEVC.2003.814902
[23] Ray, T.; Singh, HK; Isaacs, A.; Smith, W., Infeasibility driven evolutionary algorithm for constrained optimization, 145-165 (2009), Sydney · doi:10.1007/978-3-642-00619-7_7
[24] Runarsson, T.P., Yao, X.: Stochastic ranking for constrained evolutionary optimization. IEEE Trans. Evol. Comput. 4(3), 284-294 (2000) · doi:10.1109/4235.873238
[25] Runarsson, T.P., Yao, X.: Search biases in constrained evolutionary optimization. IEEE Trans. Syst. Man. Cybern. C 35(2), 233-243 (2005) · doi:10.1109/TSMCC.2004.841906
[26] Storn, R.: System design by constraint adaptation and differential evolution. IEEE Trans. Evol. Comput. 3(1), 22-34 (1999) · doi:10.1109/4235.752918
[27] Storn, R., Price, K.: Differential evolution-a simple and efficient adaptive scheme for global optimisation over continuous spaces. Technical report, International Computer Science Institute, Berkley (1995) · Zbl 0888.90135
[28] Storn, R., Price, K.: Differential evolution: a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341-359 (1997) · Zbl 0888.90135 · doi:10.1023/A:1008202821328
[29] Surry, P.D., Radcliffe, N.J.: The comoga method: constrained optimisation by multi-objective genetic algorithms. Control Cybern. 26, 391-412 (1997) · Zbl 0890.90161
[30] Takahama, T., Sakai, S.: Constrained optimization by applying the \[\alpha\] α constrained method to the nonlinear simplex method with mutations. IEEE Trans. Evol. Comput. 9(5), 437-451 (2005) · doi:10.1109/TEVC.2005.850256
[31] Takahama, T., Sakai, S.: Constrained optimization by the \[\varepsilon\] ε constrained differential evolution with gradient-based mutation and feasible elites. In: IEEE Congress on Evolutionary Computation (CEC 2006), pp. 1-8. IEEE, Vancouver (2006) · Zbl 1269.49061
[32] Tasgetiren, M.F., Suganthan, P.: A multi-populated differential evolution algorithm for solving constrained optimization problem. In: IEEE Congress on Evolutionary Computation (CEC 2006), pp. 33-40. IEEE, Vancouver (2006) · Zbl 1026.74056
[33] Tessema, B., Yen, G.G.: An adaptive penalty formulation for constrained evolutionary optimization. IEEE Trans. Syst. Man Cybern. A 39(3), 565-578 (2009) · doi:10.1109/TSMCA.2009.2013333
[34] Venkatraman, S., Yen, G.G.: A generic framework for constrained optimization using genetic algorithms. IEEE Trans. Evol. Comput. 9(4), 424-435 (2005) · doi:10.1109/TEVC.2005.846817
[35] Wang, J., Yin, Z.: A ranking selection-based particle swarm optimizer for engineering design optimization problems. Struct. Multidiscip. Optim. 37(2), 131-147 (2008) · doi:10.1007/s00158-007-0222-3
[36] Wang, Y., Cai, Z.: Constrained evolutionary optimization by means of \[(\mu + \lambda\] μ+λ)-differential evolution and improved adaptive trade-off model. Evol. Comput. 19(2), 249-285 (2011) · doi:10.1162/EVCO_a_00024
[37] Wang, Y., Cai, Z.: Combining multiobjective optimization with differential evolution to solve constrained optimization problems. IEEE Trans. Evol. Comput. 16(1), 117-134 (2012) · doi:10.1109/TEVC.2010.2093582
[38] Wang, Y., Cai, Z., Zhou, Y.: Accelerating adaptive trade-off model using shrinking space technique for constrained evolutionary optimization. Int. J. Numer. Methods Eng. 77(11), 1501-1534 (2009) · Zbl 1158.74442 · doi:10.1002/nme.2451
[39] Wang, Y., Cai, Z., Zhou, Y., Fan, Z.: Constrained optimization based on hybrid evolutionary algorithm and adaptive constraint-handling technique. Struct. Multidiscip. Optim. 37(4), 395-413 (2009) · doi:10.1007/s00158-008-0238-3
[40] 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) · doi:10.1109/TEVC.2007.902851
[41] Zhang, M., Luo, W., Wang, X.: Differential evolution with dynamic stochastic selection for constrained optimization. Inf. Sci. 178(15), 3043-3074 (2008) · doi:10.1016/j.ins.2008.02.014
[42] Zielinski, K., Laur, R.: Constrained single-objective optimization using differential evolution. In: IEEE Congress on Evolutionary Computation (CEC 2006), pp. 223-230. IEEE, Vancouver (2006)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.