2023
DOI: 10.1007/s11081-022-09782-9
|View full text |Cite
|
Sign up to set email alerts
|

Constraint handling techniques for metaheuristics: a state-of-the-art review and new variants

Abstract: Metaheuristic optimization algorithms (MOAs) are computational randomized search processes which draw inspiration from physical and biological phenomena, with an application spectrum that extends to numerous fields, ranging from engineering design to economics. MOAs were originally developed for solving unconstrained NP-complete problems, and hence their application to constrained optimization problems (COPs) requires the implementation of specialized techniques that facilitate the treatment of performance and… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
3
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 64 publications
(88 reference statements)
0
3
0
Order By: Relevance
“…For three CE plans, both DE and PSO methods are used to compute the optimal values of the decision variables (𝑇 0 , 𝜉 1 , 𝜉 2 , 𝐺, 𝑊 𝑟 ) and the accompanying optimal profit. To handle constraints in our highly non-linear optimization model, we use penalty method for constraint handling in metaheuristics (Lagaros et al, 2023).…”
Section: Optimization Via Metaheuristic Approachesmentioning
confidence: 99%
See 1 more Smart Citation
“…For three CE plans, both DE and PSO methods are used to compute the optimal values of the decision variables (𝑇 0 , 𝜉 1 , 𝜉 2 , 𝐺, 𝑊 𝑟 ) and the accompanying optimal profit. To handle constraints in our highly non-linear optimization model, we use penalty method for constraint handling in metaheuristics (Lagaros et al, 2023).…”
Section: Optimization Via Metaheuristic Approachesmentioning
confidence: 99%
“…Akhtar et al (2023) evaluated the total profit using a unique hybrid approach based on DE and social group optimization methodologies. Lagaros et al (2023) studied the use of specialized metaheuristic approaches that simplify the handling of performance and bound constraints of optimization problems. In our model, we are concerned with a constrained optimization model which is difficult to solve by using analytic approaches.…”
Section: Introductionmentioning
confidence: 99%
“…The objective function f → x is the fitness function in the engineering optimization problem [29], where → x is the search space and distinct variables are the dimensions. The objective function, constraints, and variable interval are all subject to equal or unequal restrictions.…”
Section: Practical Engineering Applicationmentioning
confidence: 99%
“…The field of optimization has grown rapidly during the past few decades, and many new theoretical, algorithmic, and computational contributions have been proposed to solve various problems [18][19][20]. Recent developments in the field of optimization methods can mainly be divided into deterministic and heuristic approaches.…”
Section: -Literature Reviewmentioning
confidence: 99%