Skip to main content

Reference Point Based Constraint Handling Method for Evolutionary Algorithm

  • Conference paper
  • First Online:
Advances in Swarm and Computational Intelligence (ICSI 2015)

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

Included in the following conference series:

Abstract

Many evolutionary algorithms have been proposed to deal with Constrained Optimization Problems (COPs). Penalty functions are widely used in the community of evolutionary optimization when coming to constraint handling. To avoid setting up penalty term, we introduce a new constraint handling method, in which a reference point selection mechanism and a population ranking process based on the distances to the selected reference point are proposed. The performance of our method is evaluated on 24 benchmark instances. Experimental results show that our method is competitive when compared with the state-of-the-art approaches and has improved the solution and the optima value of instance g22.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ben Hamida, S., Schoenauer, M.: Aschea: new results using adaptive segregational constraint handling. In: Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002, vol. 1, pp. 884–889. IEEE (2002)

    Google Scholar 

  2. Cai, Z., Wang, Y.: A multiobjective optimization-based evolutionary algorithm for constrained optimization. IEEE Transactions on Evolutionary Computation 10(6), 658–675 (2006)

    Article  Google Scholar 

  3. Coello, C.A.C.: Use of a self-adaptive penalty approach for engineering optimization problems. Computers in Industry 41(2), 113–127 (2000)

    Google Scholar 

  4. Deb, K.: An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering 186(2), 311–338 (2000)

    Article  MATH  Google Scholar 

  5. Homaifar, A., Qi, C.X., Lai, S.H.: Constrained optimization via genetic algorithms. Simulation 62(4), 242–253 (1994)

    Article  Google Scholar 

  6. 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)

    Chapter  Google Scholar 

  7. Liang, J., Runarsson, T., 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 (2006)

    Google Scholar 

  8. Mallipeddi, R., Suganthan, P.N.: Ensemble of constraint handling techniques. IEEE Transactions on Evolutionary Computation 14(4), 561–579 (2010)

    Article  Google Scholar 

  9. Mezura Montes, E., Coello, C.A.C.: A simple multimembered evolution strategy to solve constrained optimization problems. IEEE Transactions on Evolutionary Computation 9(1), 1–17 (2005)

    Google Scholar 

  10. Mezura-Montes, E., Coello, C.A.C.: Constraint-handling in nature-inspired numerical optimization: past, present and future. Swarm and Evolutionary Computation 1(4), 173–194 (2011)

    Article  Google Scholar 

  11. Michalewicz, Z., Attia, N.: Evolutionary optimization of constrained problems. In: Proceedings of the 3rd Annual Conference on Evolutionary Programming, pp. 98–108. Citeseer (1994)

    Google Scholar 

  12. Runarsson, T.P., Yao, X.: Stochastic ranking for constrained evolutionary optimization. IEEE Transactions on Evolutionary Computation 4(3), 284–294 (2000)

    Article  Google Scholar 

  13. Runarsson, T.P., Yao, X.: Search biases in constrained evolutionary optimization. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews 35(2), 233–243 (2005)

    Article  Google Scholar 

  14. 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 (2006)

    Google Scholar 

  15. Wang, Y., Cai, Z.: IEEE Transactions on Combining multiobjective optimization with differential evolution to solve constrained optimization problems. Evolutionary Computation 16(1), 117–134 (2012)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jinlong Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Li, J., Shen, A., Lu, G. (2015). Reference Point Based Constraint Handling Method for Evolutionary Algorithm. In: Tan, Y., Shi, Y., Buarque, F., Gelbukh, A., Das, S., Engelbrecht, A. (eds) Advances in Swarm and Computational Intelligence. ICSI 2015. Lecture Notes in Computer Science(), vol 9140. Springer, Cham. https://doi.org/10.1007/978-3-319-20466-6_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20466-6_32

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics