journal article·2022-05-01Open access

A comparator-based constraint handling technique for evolutionary algorithms

Hikaru Takami, Shigeru Obayashi

AIP Advances· Volume 12· Issue 5

Abstract

Constraint handling is a key task for the successful optimization of design parameters in industrial design problems. This paper proposes a comparator-based constraint handling technique, called the More Less-Violations Method (MLVM), for solving real constrained optimization problems using evolutionary algorithms. The structure of the MLVM is simple and it can easily be integrated into conventional evolutionary algorithms. In the proposed method, constraint weights represent the level of importance of each constraint, enabling evolutionary compliance prioritization. Moreover, an acceptable region formed by the constraint tolerances allows trade-offs between objectives and constraints while preserving diverse solutions and improving optimization performance. These elements enable the appropriate design of industrial optimization problems. An application of this method to problems without constraint tolerances is also proposed. The JAXA/Mazda benchmark problem, developed on a real-world constrained design optimization dataset, is used to assess the performance of the MLVM. The results indicate that the MLVM realizes encouraging optimization performance.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Advanced Multi-Objective Optimization Algorithms · Metaheuristic Optimization Algorithms Research · Evolutionary Algorithms and Applications

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

Department of Aerospace Engineering/Institute of Fluid Science, Tohoku University 1 , Sendai, Japan

Institute of Fluid Science, Tohoku University 2 , Sendai, Japan

References (45)

Show source-provided references
1. High-lift multi-element airfoil shape and setting optimization using multi-objective evolutionary algorithms10.2514/1.C031233 ↗
2. Constrained evolutionary wind turbine placement with penalty functions
3. Simultaneous structure design optimization of multiple car models using the k computer
4. Theoretical and numerical constraint handling techniques used with evolutionary algorithms: A survey of the state of the art10.1016/S0045-7825(01)00323-1 ↗
5. Constraint-handling in nature-inspired numerical optimization: Past, present, and future10.1016/j.swevo.2011.10.001 ↗
6. Constrained optimization via genetic algorithms10.1177/003754979406200405 ↗
7. On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with gas
8. Evolutionary optimization of constrained problems
9. Constrained handling techniques—Penalty functions
10. An adaptive penalty method for genetic algorithms in constrained optimization problems
11. Self-adaptive fitness formulation for constrained optimization10.1109/TEVC.2003.817236 ↗
12. Stochastic ranking for constrained evolutionary optimization10.1109/4235.873238 ↗
13. Evolutionary constrained optimization using an addition of ranking method and a percentage-based tolerance value adjustment scheme10.1016/j.ins.2007.01.011 ↗
14. A rank-based constraint handling technique for engineering design optimization problems solved by genetic algorithms10.1016/j.compstruc.2017.03.023 ↗
15. The COMOGA method: Constrained optimization by multi-objective genetic algorithms
16. Treating constraints as objectives for single-objective evolutionary optimization10.1080/03052150008941301 ↗
17. A multiobjective optimization-based evolutionary algorithm for constrained optimization10.1109/TEVC.2006.872344 ↗
18. An efficient constraint handling method for genetic algorithms10.1016/S0045-7825(99)00389-8 ↗
19. Constraint-handling in genetic algorithms though the use of dominance-based tournament selection10.1016/S1474-0346(02)00011-3 ↗
20. A simple multimembered evolution strategy to solve constrained optimization problems10.1109/TEVC.2004.836819 ↗
21. Differential evolution with ensemble of constraint handling techniques for solving CEC 2010 benchmark problems
22. Integrated strategies differential evolution algorithm with a local search for constrained optimization
23. No free lunch theorems for optimization10.1109/4235.585893 ↗
24. Constrained GA optimization
25. A study on application of satisfaction method of constraints based on their difficulties in many constrained optimization problems
26. Constrained optimization by ɛ constrained differential evolution with dynamic ɛ-level control
27. Efficient constrained optimization by the ɛ constrained rank-based differential evolution
28. Search biases in constrained evolutionary optimization10.1109/TSMCC.2004.841906 ↗
29. Infeasibility driven evolutionary algorithm for constrained optimization
30. Multi-features prediction of protein translational modification sites10.1109/TCBB.2017.2752703 ↗
31. Active disease-related compound identification based on capsule network10.1093/bib/bbab462 ↗
32. See https://ladse.eng.isas.jaxa.jp/benchmark/ for more information about how to download the JAXA/Mazda benchmark problem.
33. A note on constrained multi-objective optimization benchmark problems
34. Proposal of benchmark problem based on real-world car structure design optimization
35. Report of evolutionary computation competition 201710.11394/tjpnsec.9.86 ↗
36. Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization
37. A fast and elitist multiobjective genetic algorithm: NSGA-II10.1109/4235.996017 ↗
38. Proposal of an effective approach for an optimization problem with many variables under strictly limiting the number of function call
39. From recombination of genes to the estimation of distributions. I. Binary parameters
40. BOA: The bayesian optimization algorithm
41. A simple modification in CMA-ES achieving linear time and space complexity
42. Natural evolution strategies
43. Multifactorial optimization using artificial bee colony and its application to car structure design optimization
44. The knowledge engineering review
45. Island model genetic algorithms and linearly separable problems