Abstract
The typical formulation of a constrained optimization problem (COP), which has the constraint form of \(\mathbf {g}(\mathbf {x})\le \mathbf {0}\), has widely used in evolutionary computation field. However, it is not suitable for Gaussian processes (GPs) based expensive optimization. In this paper, a more general and suitable formulation of the COP, which has the constraint form of \(\mathbf {l_{g}} \le \mathbf {g}(\mathbf {x})\le \mathbf {u_{g}}\), is recommended for the expensive optimization. Modeling a real world COP as a typical formulation will probably introduce additional constraints and dependencies among the objective and constraints while that as a suitable one introduces none additional. In the case of typical formulation, the additional constraints and dependencies have to be handled and the handling would cost additional computational resource, especially, the additional dependencies would lead to degenerating the performance of expensive optimization technologies since most of the technologies are based on the assumption of mutual independency among the objective and constraints. Experiments show that the performance of the expensive optimization technologies in the aspect of precision on solving the problems with suitable formulation is better than that with typical one. However, we could not verify the expense of additional computational resource since there are few expensive optimization technologies dealing with dependent objective and constraints.
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 subscriptionsReferences
Saha, C., Das, S., Pal, K., Mukherjee, S.: A fuzzy rule-based penalty function approach for constrained evolutionary optimization. IEEE Trans. Cybern. 46(12), 2953–2965 (2016)
Runarsson, T.P., Yao, X.: Stochastic ranking for constrained evolutionary optimization. IEEE Trans. Evol. Comput. 4(3), 284–294 (2000)
Maesani, A., Iacca, G., Floreano, D.: Memetic viability evolution for constrained optimization. IEEE Trans. Evol. Comput. 20(1), 125–144 (2015)
Wang, Y., Wang, B., Li, H., Yen, G.G.: Incorporating objective function information into the feasibility rule for constrained evolutionary optimization. IEEE Trans. Cybern. 46(12), 2938–2952 (2016)
Takahama, T., Sakai, S.: Constrained optimization by the constrained differential evolution with an archive and gradient-based mutation. In: Proceedings of IEEE Congress on Evolutionary Computation, Barcelona, Spain, pp. 1–9 (2010)
Zeng, S., Jiao, R., Li, C., Wang, R.: Constrained optimisation by solving equivalent dynamic loosely-constrained multiobjective optimisation problem. Int. J. Bio-Inspired Comput. (2018, to be published)
Zeng, S., Jiao, R., Li, C., Li, X., Alkasassbeh, J.S.: A general framework of dynamic constrained multiobjective evolutionary algorithms for constrained optimization. IEEE Trans. Cybern. 47(9), 2678–2688 (2017)
Sarker, R.A., Elsayed, S.M., Ray, T.: Differential evolution with dynamic parameters selection for optimization problems. IEEE Trans. Evol. Comput. 18(5), 689–707 (2014)
Hamza, N.M., Essam, D.L., Sarker, R.A.: Constraint consensus mutation-based differential evolution for constrained optimization. IEEE Trans. Evol. Comput. 20(3), 447–459 (2015)
Mallipeddi, R., Suganthan, P.N.: Ensemble of constraint handling techniques. IEEE Trans. Evol. Comput. 14(4), 561–579 (2010)
Bu, C., Luo, W., Yue, L.: Continuous dynamic constrained optimization with ensemble of locating and tracking feasible regions strategies. IEEE Trans. Evol. Comput. 21(1), 14–33 (2016)
Guo, D., Jin, Y., Ding, J., Chai, T.: Heterogeneous ensemble based infill criterion for evolutionary multi-objective optimization of expensive problems. IEEE Trans. Cybern. PP(99), 1–14 (2018)
Zhang, Q., Liu, W., Tsang, E., Virginas, B.: Expensive multiobjective optimization by MOEA/D with gaussian process model. IEEE Trans. Evol. Comput. 14(3), 456–474 (2010)
Liu, B., Zhang, Q., Gielen, G.G.: A gaussian process surrogate model assisted evolutionary algorithm for medium scale expensive optimization problems. IEEE Trans. Evol. Comput. 18(2), 180–192 (2014)
Cheng, R., Jin, Y., Narukawa, K., Sendhoff, B.: A multiobjective evolutionary algorithm using gaussian process-based inverse modeling. IEEE Trans. Evol. Comput. 19(6), 838–856 (2015)
Svenson, J., Santner, T.: Multiobjective optimization of expensive-to-evaluate deterministic computer simulator models. Comput. Stat. Data Anal. 94, 250–264 (2016)
Zhan, D., Cheng, Y., Liu, J.: Expected improvement matrix-based infill criteria for expensive multiobjective optimization. IEEE Trans. Evol. Comput. 21(6), 956–975 (2017)
Ohno, H.: Empirical studies of Gaussian process based Bayesian optimization using evolutionary computation for materials informatics. Expert. Sys. Appl. 96, 25–48 (2018)
Liu, H., Ong, Y.S., Cai, J., Wang, Y.: Cope with diverse data structures in multi-fidelity modeling: a Gaussian process method. Eng. Appl. Artif. Intel. 67, 211–225 (2018)
Jones, D.R., Schonlau, M., Welch, W.J.: Efficient global optimization of expensive black-box functions. J. Global Optim. 13(4), 455–492 (1998)
Schonlau, M., Welch, W.J., Jones, D.R.: Global versus local search in constrained optimization of computer models. Lect. Notes Monogr. Ser. 34, 11–25 (1998)
Audet, C., Dennis Jr., J., Moore, D.W., Booker, A., Frank, P.D.: A surrogate model-based method for constrained optimization. In: Proceedings of the 8th Symposium Multidisciplinary Analysis and Optimization, Long Beach, CA, USA, pp. 1–8 (2000)
Durantin, C., Marzat, J., Balesdent, M.: Analysis of multi-objective Kriging-based methods for constrained global optimization. Comput. Optim. Appl. 63(3), 903–926 (2016)
Santner, T.J., Williams, B.J., Notz, W.I.: The Design and Analysis of Computer Experiments. Springer Series in Statistics. Springer, New York (2003). https://doi.org/10.1007/978-1-4757-3799-8
Storn, R., Price, K.V.: Differential evolution a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341–359 (1997)
Stein, M.: Large sample properties of simulations using latin hypercube sampling. Technometrics 29(2), 143–151 (1987)
Zitzler, E., Laumanns, M., Thiele, L.: SPEA 2: Improving the strength pareto evolutionary algorithm for multiobjective optimization. In: Proceedings of the Evolutionary Methods for Design, Optimization and Control with Applications to to Industrial Problems, pp. 95–100 (2001)
Acknowledgments
This work was supported by the National Science Foundation of China (No.s: 61673355, 61271140 and 61203306).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Zeng, S. et al. (2018). Typical Constrained Optimization Formulation in Evolutionary Computation Not Suitable for Expensive Optimization. In: Li, K., Li, W., Chen, Z., Liu, Y. (eds) Computational Intelligence and Intelligent Systems. ISICA 2017. Communications in Computer and Information Science, vol 873. Springer, Singapore. https://doi.org/10.1007/978-981-13-1648-7_20
Download citation
DOI: https://doi.org/10.1007/978-981-13-1648-7_20
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-1647-0
Online ISBN: 978-981-13-1648-7
eBook Packages: Computer ScienceComputer Science (R0)