Abstract
It has been proposed to utilize a rough approximation model, which is an approximation model with low accuracy and without learning process, to reduce the number of function evaluations in unconstrained optimization. Although the approximation errors between true function values and the approximation values estimated by the rough approximation model are not small, the rough model can estimate the order relation of two points with fair accuracy. The estimated comparison, which omits the function evaluations when the result of the comparison can be judged by the approximation values, proposed to use this nature of the rough model. In this chapter, a constrained optimization method is proposed by combining the \(\varepsilon \) constrained method and the estimated comparison, where rough approximation is used not only for an objective function but also for constraint violation. The proposed method is an efficient constrained optimization algorithm that can find near-optimal solutions in a small number of function evaluations. The advantage of the method is shown by solving well-known nonlinear constrained problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aguirre AH, Rionda SB, Coello CAC, Lizárraga GL, Montes EM (2004) Handling constraints using multiobjective optimization concepts. Int J Numer Methods Eng 59(15):1989–2017
Büche D, Schraudolph NN, Koumoutsakos P (2005) Accelerating evolutionary algorithms with Gaussian process fitness function models. EEE Trans Syst, Man, Cybern, Part C: Appl Rev 35(2):183–194
Camponogara E, Talukdar SN (1997) A genetic algorithm for constrained and multiobjective optimization. In: Alander JT (ed) 3rd Nordic workshop on genetic algorithms and their applications (3NWGA), University of Vaasa, Vaasa pp 49–62
Coello CAC (2000a) Constraint-handling using an evolutionary multiobjective optimization technique. Civ Eng Environ Syst 17:319–346
Coello CAC (2000b) Use of a self-adaptive penalty approach for engineering optimization problems. Comput Ind 41(2):113–127
Coello CAC (2002) 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
Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186(2/4):311–338
Farmani R, Wright JA (2003) Self-adaptive fitness formulation for constrained optimization. IEEE Trans Evol Comput 7(5):445–455
Guimarães FG, Wanner EF, Campelo F, Takahashi RH, Igarashi H, Lowther DA, RamÃrez JA (2006) Local learning and search in memetic algorithms. In: Proceedings of the 2006 IEEE congress on evolutionary computation, Vancouver. pp 9841–9848
Homaifar A, Lai SHY, Qi X (1994) Constrained optimization via genetic algorithms. Simulation 62(4):242–254
Jin Y (2005) A comprehensive survey of fitness approximation in evolutionary computation. Soft Comput 9:3–12
Jin Y, Olhofer M, Sendhoff B (2000) On evolutionary optimization with approximate fitness functions. In: Proceedings of the genetic and evolutionary computation conference. Morgan Kaufmann, pp 786–792
Jin Y, Olhofer M, Sendhoff B (2002) A framework for evolutionary optimization with approximate fitness functions. IEEE Trans Evol Comput 6(5):481–494
Jin Y, Sendhoff B (2004) Reducing fitness evaluations using clustering techniques and neural networks ensembles. In: Genetic and evolutionary computation conference. LNCS, vol 3102, Springer, pp 688–699
Joines J, Houck C (1994) On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GAs. In: Fogel D (ed) Proceedings of the first IEEE conference on evolutionary computation. IEEE Press, Orlando, pp 579–584
Mallipeddi R, Suganthan PN (2010) Ensemble of constraint handling techniques. IEEE Trans Evol Comput 14(4):561–579
Mezura-Montes E, Coello CAC (2005) A simple multimembered evolution strategy to solve constrained optimization problems. IEEE Trans Evol Comput 9(1):1–17
Mezura-Montes E, Coello CAC (2011) Constraint-handling in nature-inspired numerical optimization: past, present and future. Swarm Evol Comput 1:173–194
Mezura-Montes E, Palomeque-Ortiz AG (2009) Parameter control in differential evolution for constrained optimization. In: Proceedings of the 2009 IEEE congress on evolutionary computation, pp 1375–1382
Michalewicz Z (1995) A survey of constraint handling techniques in evolutionary computation methods. In: Proceedings of the 4th annual conference on evolutionary programming. The MIT Press, Cambridge, pp 135–155
Michalewicz Z, Attia N (1994) Evolutionary optimization of constrained problems. In: Sebald A, Fogel L (eds) Proceedings of the 3rd annual conference on evolutionary programming. World Scientific Publishing, River Edge, pp 98–108
Ong YS, Zhou Z, Lim D (2006) Curse and blessing of uncertainty in evolutionary algorithm using approximation. In: Proceedings of the 2006 IEEE congress on evolutionary computation. Vancouver, pp 9833–9840
Ray T, Liew KM, Saini P (2002) An intelligent information sharing strategy within a swarm for unconstrained and constrained optimization problems. Soft Comput—Fusion Found, Methodol Appl 6(1):38–44
Runarsson TP, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4(3):284–294
Runarsson TP, Yao X (2003) Evolutionary search and constraint violations. In: Proceedings of the 2003 congress on evolutionary computation, vol 2. IEEE Service Center Piscataway, New Jersey, pp 1414–1419
Sakai S Takahama T (2010) A parametric study on estimated comparison in differential evolution with rough approximation model. In: Kitahara M, Morioka K (eds) Social systems solution by legal informatics. Economic sciences and computer sciences, Kyushu University Press, Fukuoka, pp 112–134
Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11:341–359
Surry PD, Radcliffe NJ (1997) The COMOGA method: constrained optimisation by multiobjective genetic algorithms. Control Cybern 26(3):391–412
Takahama T, Sakai S (2000) Tuning fuzzy control rules by the \(\alpha \) constrained method which solves constrained nonlinear optimization problems. Electron Commun Japan, Part 3: Fundam Electron Sci 83(9):1–12
Takahama T, Sakai S (2005a) Constrained optimization by applying the \(\alpha \) constrained method to the nonlinear simplex method with mutations. IEEE Trans Evol Comput 9(5):437–451
Takahama T, Sakai S (2005b) Constrained optimization by \(\varepsilon \) constrained particle swarm optimizer with \(\varepsilon \)-level control. In: Proceedings of the 4th IEEE international workshop on soft computing as transdisciplinary science and technology (WSTST’05), pp 1019–1029
Takahama T, Sakai, S (2006) Constrained optimization by the \(\varepsilon \) constrained differential evolution with gradient-based mutation and feasible elites. In: Proceedings of the 2006 IEEE congress on evolutionary computation, pp 308–315
Takahama T, Sakai S (2008a) Efficient optimization by differential evolution using rough approximation model with adaptive control of error margin. In: Proceedings of the joint 4th international conference on soft computing and intelligent systems and 9th international symposium on advanced intelligent systems, pp 1412–1417
Takahama T, Sakai S (2008b) Reducing function evaluations in differential evolution using rough approximation-based comparison. In: Proceedings of the 2008 IEEE congress on evolutionary computation, pp 2307–2314
Takahama T, Sakai S (2009a) A comparative study on Kernel smoothers in differential evolution with estimated comparison method for reducing function evaluations. In: Proceedings of the 2009 IEEE congress on evolutionary computation, pp 1367–1374
Takahama T, Sakai S (2009b) Fast and stable constrained optimization by the \(\varepsilon \) constrained differential evolution. Pac J Optim 5(2):261–282
Takahama T, Sakai S (2010a) Constrained optimization by the \(\varepsilon \) constrained differential evolution with an archive and gradient-based mutation. In: Proceedings of the 2010 IEEE congress on evolutionary computation, pp 1680–1688
Takahama, T, Sakai S (2010b) Efficient constrained optimization by the \(\varepsilon \) constrained adaptive differential evolution. In: Proceedings of the 2010 IEEE congress on evolutionary computation, pp 2052–2059
Takahama T, Sakai S (2010c) Reducing function evaluations using adaptively controlled differential evolution with rough approximation model. In: Tenne Y, Goh C-K (eds) Computational intelligence in expensive optimization problems. Adaptation learning and optimization, vol 2. Springer, Berlin, pp 111–129
Takahama T, Saka S (2013) Efficient constrained optimization by the \(\varepsilon \) constrained differential evolution with rough approximation using kernel regression. In: Proceedings of the 2013 IEEE congress on evolutionary computation, pp 62–69
Takahama T, Sakai S, Iwane N (2006) Solving nonlinear constrained optimization problems by the \(\varepsilon \) constrained differential evolution. In: Proceedings of the 2006 IEEE adaptation learning and optimization, pp 2322–2327
Tessema B, Yen G (2006) A self adaptive penalty function based algorithm for constrained optimization. In: Yen GG, Lucas SM, Fogel G, Kendall G, Salomon R, Zhang B-T, Coello CAC, Runarsson TP (eds) Proceedings of the 2006 IEEE congress on evolutionary computation. IEEE Press, Vancouver, pp 246–253
Venkatraman S, Yen GG (2005) A generic framework for constrained optimization using genetic algorithms. IEEE Trans Evol Comput 9(4):424–435
Wang Y, Cai Z, Cuo G, Zhou Z (2007) Multiobjective optimization and hybrid evolutionary algorithm to solve constrained optimization problems. IEEE Trans Syst, Man Cybern, Part B 37(3):560–575
Wang Y, Cai Z, Xhau Y, Zeng W (2008) An adaptive tradeoff model for constrained evolutionary computation. IEEE Trans Evol Comput 12(1):80–92
Acknowledgments
This research is supported in part by Grant-in-Aid for Scientific Research (C) (No. 24500177, 26350443) of Japan society for the promotion of science and Hiroshima City University Grant for Special Academic Research (General Studies).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer India
About this chapter
Cite this chapter
Takahama, T., Sakai, S. (2015). Efficient Constrained Optimization by the \(\varepsilon \) Constrained Differential Evolution with Rough Approximation. In: Datta, R., Deb, K. (eds) Evolutionary Constrained Optimization. Infosys Science Foundation Series(). Springer, New Delhi. https://doi.org/10.1007/978-81-322-2184-5_6
Download citation
DOI: https://doi.org/10.1007/978-81-322-2184-5_6
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2183-8
Online ISBN: 978-81-322-2184-5
eBook Packages: EngineeringEngineering (R0)