Skip to main content

On Constraint Handling in Surrogate-Assisted Evolutionary Many-Objective Optimization

  • Conference paper
  • First Online:
Parallel Problem Solving from Nature – PPSN XIV (PPSN 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9921))

Included in the following conference series:

Abstract

Surrogate-assisted evolutionary multiobjective optimization algorithms are often used to solve computationally expensive problems. But their efficacy on handling constrained optimization problems having more than three objectives has not been widely studied. Particularly the issue of how feasible and infeasible solutions are handled in generating a data set for training a surrogate has not received much attention. In this paper, we use a recently proposed Kriging-assisted evolutionary algorithm for many-objective optimization and investigate the effect of infeasible solutions on the performance of the surrogates. We assume that constraint functions are computationally inexpensive and consider different ways of handling feasible and infeasible solutions for training the surrogate and examine them on different benchmark problems. Results on the comparison with a reference vector guided evolutionary algorithm show that it is vital for the success of the surrogate to properly deal with infeasible solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Jin, Y.: A comprehensive survey of fitness approximation in evolutionary computation. Soft. Comput. 9, 3–12 (2005)

    Article  Google Scholar 

  2. Chugh, T., Sindhya, K., Hakanen, J., Miettinen, K.: Handling computationally expensive multiobjective optimization problems with evolutionary algorithms - a survey. Reports of the Department of Mathematical Information Technology, Series B, Scientific Computing no. B 4/2015, University of Jyvaskyla (2015)

    Google Scholar 

  3. Chugh, T., Jin, Y., Miettinen, K., Hakanen, J., Sindhya, K.: K-RVEA: a Kriging-assisted evolutionary algorithm for many-objective optimization. Reports of the Department of Mathematical Information Technology, Series B, Scientific Computing no. B 2/2016, University of Jyvaskyla (2016)

    Google Scholar 

  4. Singh, H.K., Ray, T., Smith, W.: Surrogate assisted simulated annealing (SASA) for constrained multi-objective optimization. In: Proceedings of IEEE Congress on Evolutionary Computation, pp. 1–8. IEEE (2010)

    Google Scholar 

  5. Chen, G., Han, X., Liu, G., Jiang, C., Zhao, Z.: An efficient multi-objective optimization method for black-box functions using sequential approximate technique. Appl. Soft Comput. 12, 14–27 (2012)

    Article  Google Scholar 

  6. Singh, P., Couckuyt, I., Ferranti, F., Dhaene, T.: A constrained multi-objective surrogate-based optimization algorithm. In: Proceedings of IEEE Congress on Evolutionary Computation, pp. 3080–3087. IEEE (2014)

    Google Scholar 

  7. Martinez-Frutos, J., Herrero-Perez, D.: Kriging-based infill sampling criterion for constraint handling in multi-objective optimization. J. Glob. Optim. 64, 97–115 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  8. Cheng, R., Jin, Y., Olhofer, M., Sendhoff, B.: A reference vector guided evolutionary algorithm for many objective optimization. IEEE Trans. Evol. Comput. (2016, accepted). doi:10.1109/TEVC.2016.2519378

    Google Scholar 

  9. Mckay, M.D., Beckman, R.J., Conover, W.J.: A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 42, 55–61 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  10. Jain, H., Deb, K.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part II: Handling constraints and extending to an adaptive approach. IEEE Trans. Evol. Comput. 18, 602–622 (2014)

    Article  Google Scholar 

  11. Deb, K.: An efficient constraint handling method for genetic algorithms. Comput. Methods Appl. Mech. Eng. 186, 311–338 (2000)

    Article  MATH  Google Scholar 

  12. Miettinen, K., Makela, M.M., Toivanen, J.: Numerical comparison of some penalty-based constraint handling techniques in genetic algorithms. J. Glob. Optim. 27, 427–446 (2003)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgement

This work was supported by the FiDiPro project DeCoMo funded by TEKES, The Finnish Funding Agency for Innovation.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tinkle Chugh .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Chugh, T., Sindhya, K., Miettinen, K., Hakanen, J., Jin, Y. (2016). On Constraint Handling in Surrogate-Assisted Evolutionary Many-Objective Optimization. In: Handl, J., Hart, E., Lewis, P., López-Ibáñez, M., Ochoa, G., Paechter, B. (eds) Parallel Problem Solving from Nature – PPSN XIV. PPSN 2016. Lecture Notes in Computer Science(), vol 9921. Springer, Cham. https://doi.org/10.1007/978-3-319-45823-6_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45823-6_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45822-9

  • Online ISBN: 978-3-319-45823-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics