Skip to main content
SpringerLink
Log in

CHIP: Constraint Handling with Individual Penalty approach using a hybrid evolutionary algorithm

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

Constraint normalization ensures consistency in scaling for each constraint in an optimization problem. Most constraint handling studies only address the issue to deal with constraints and use problem information to scale the constraints. In this paper, we propose a hybrid evolutionary algorithm—Constraint Handling with Individual Penalty Approach (CHIP)—which scales all constraints adaptively without any problem specific information from the user. Penalty parameters for all constraints are estimated adaptively by considering overall constraint violation as a helper objective for minimization and as a result any number of constraints can be dealt without incurring proportional computational cost. The efficiency of the proposed method is demonstrated using 23 test problems and two problems from engineering optimization. The constrained optimum and function evaluations of CHIP method are inspected with five recently developed evolutionary-based constraint handling methods. The simulation results show that the proposed CHIP mechanism is very efficient, faster and comparable in the aspect of accuracy against other recently developed methods.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Ao Y, Chi H (2010) An adaptive differential evolution algorithm to solve constrained optimization problems in engineering design. Engineering 2(1):65–77

    Article  Google Scholar 

  2. Brajevic I (2015) Crossover-based artificial bee colony algorithm for constrained optimization problems. Neural Comput Appl 26(7):1587–1601

    Article  Google Scholar 

  3. Brest J (2009) Constrained real-parameter optimization with \(\varepsilon\) self-adaptive differential evolution. In: Mezura-Montes E (ed) Constraint-handling in evolutionary computation. Springer, Berlin, pp 73–94

    Google Scholar 

  4. Datta R, Deb K (2013) Individual penalty based constraint handling using a hybrid bi-objective and penalty function approach. In: 2013 IEEE congress on evolutionary computation (CEC). IEEE, pp 2720–2727

  5. Datta R, Deb K (2016) Uniform adaptive scaling of equality and inequality constraints within hybrid evolutionary-cum-classical optimization. Soft Comput 20(6):2367–2382

    Article  Google Scholar 

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

    Article  Google Scholar 

  7. Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, Chichester

    MATH  Google Scholar 

  8. Deb K, Agrawal S, Pratap A, Meyarivan T (2002) A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans Evolut Comput 6(2):182–197

    Article  Google Scholar 

  9. Deb K, Datta R (2010) A fast and accurate solution of constrained optimization problems using a hybrid bi-objective and penalty function approach. In: Proceedings of the congress on evolutionary computation (CEC-2010), pp 1–8

  10. Deb K, Datta R (2013) A bi-objective constrained optimization algorithm using a hybrid evolutionary and penalty function approach. Eng Optim 45(5):503–527

    Article  MathSciNet  Google Scholar 

  11. Deb K, Lele S, Datta R (2007) A hybrid evolutionary multi-objective and SQP based procedure for constrained optimization. In: Proceedings of the 2nd international conference on advances in computation and intelligence. Springer, pp 36–45

  12. Jordehi AR (2015) A review on constraint handling strategies in particle swarm optimisation. Neural Comput Appl 26(6):1265–1275

    Article  Google Scholar 

  13. Liang JJ, Runarsson TP, Mezura-Montes E, Clerc M, Suganthan PN, Coello CAC, Deb K (2006) Problem definitions and evaluation criteria for the CEC 2006: special session on constrained real-parameter optimization. Technical report, Nanyang Technological University, Singapore

  14. Long W, Liang X, Cai S, Jiao J, Zhang W (2017) A modified augmented Lagrangian with improved grey wolf optimization to constrained optimization problems. Neural Comput Appl 28:1–18

    Article  Google Scholar 

  15. Long W, Liang X, Huang Y, Chen Y (2014) An effective hybrid Cuckoo search algorithm for constrained global optimization. Neural Comput Appl 25(3–4):911–926

    Article  Google Scholar 

  16. Michalewicz Z, Schoenauer M (1996) Evolutionary algorithms for constrained parameter optimization problems. Evolut Comput 4(1):1–32

    Article  Google Scholar 

  17. Myung H, Kim J-H (1999) Multiple Lagrange multiplier method for constrained evolutionary optimization. In: McKay B, Yao X, Newton CS, Kim JH, Furuhashi T (eds) Simulated evolution and learning. Springer, Berlin, pp 2–9

    Chapter  Google Scholar 

  18. Ray T, Liew K (2003) Society and civilization: an optimization algorithm based on the simulation of social behavior. IEEE Trans Evolut Comput 7(4):386–396

    Article  Google Scholar 

  19. Reklaitis GV, Ravindran A, Ragsdell KM (1983) Engineering optimization methods and applications. Wiley, New York

    Google Scholar 

  20. Riff M-C, Zúñiga M, Montero E (2010) A graph-based immune-inspired constraint satisfaction search. Neural Comput Appl 19(8):1133–1142

    Article  Google Scholar 

  21. Runarsson TP, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evolut Comput 4(3):284–294

    Article  Google Scholar 

  22. Storn R (1999) System design by constraint adaptation and differential evolution. IEEE Trans Evolut Comput 3(1):22–34

    Article  Google Scholar 

  23. Takahama T, Sakai S (2009) Solving difficult constrained optimization problems by the \(\varepsilon\) constrained differential evolution with gradient-based mutation. In: Mezura-Montes E (ed) Constraint-handling in evolutionary computation. Springer, Berlin, pp 51–72

    Google Scholar 

  24. Wang Y, Cai Z (2012) Combining multiobjective optimization with differential evolution to solve constrained optimization problems. IEEE Trans Evolut Comput 16(1):117–134

    Article  Google Scholar 

  25. Zavala A, Aguirre A, Diharce E (2009) Continuous constrained optimization with dynamic tolerance using the COPSO algorithm. In: Mezura-Montes E (ed) Constraint-handling in evolutionary computation. Springer, Berlin, pp 1–23

    Google Scholar 

  26. Zhang M, Luo W, Wang X (2008) Differential evolution with dynamic stochastic selection for constrained optimization. Inf Sci 178(15):3043–3074

    Article  Google Scholar 

  27. Zhao J-Q, Wang L, Zeng P, Fan W-H (2012) An effective hybrid genetic algorithm with flexible allowance technique for constrained engineering design optimization. Expert Syst Appl 39(5):6041–6051

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Knowledge Service Engineering, KAIST, Daejeon, South Korea

    Rituparna Datta

  2. Department of Electrical and Computer Engineering, Michigan State University, East Lansing, MI, USA

    Kalyanmoy Deb

  3. Department of Electrical Engineering, KAIST, Daejeon, South Korea

    Jong-Hwan Kim

Authors
  1. Rituparna Datta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kalyanmoy Deb
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jong-Hwan Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rituparna Datta.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Datta, R., Deb, K. & Kim, JH. CHIP: Constraint Handling with Individual Penalty approach using a hybrid evolutionary algorithm. Neural Comput & Applic 31, 5255–5271 (2019). https://doi.org/10.1007/s00521-018-3364-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-018-3364-x

Keywords

Search

Navigation