New method in solving constrained optimization with GA
Haijun Liu
Abstract
Haijun Liu
Abstract
In order to solve the constrained optimization problems effectively, we analyzed traditional methods and propose a new method to solve the problems using genetic algorithms. We divide the constrained the optimization into two steps. In the first step, the objective function is completely disregarded and the constrained optimization problem is treated as a constraint satisfaction problem. In the second step, we perform the constrain optimization and got the optimized solution finally. We analyze the proposed method in different problems and demonstrate the proposed method performs well in solving the constrained optimization problems.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In order to solve the constrained optimization problems effectively, we analyzed traditional methods and propose a new method to solve the problems using genetic algorithms. We divide the constrained the optimization into two steps. In the first step, the objective function is completely disregarded and the constrained optimization problem is treated as a constraint satisfaction problem. In the second step, we perform the constrain optimization and got the optimized solution finally. We analyze the proposed method in different problems and demonstrate the proposed method performs well in solving the constrained optimization problems.
Key concepts: Mathematical optimization, Constrained optimization problem, Constrained optimization, Optimization problem, Continuous optimization, Constraint (computer-aided design), Computer science, Meta-optimization