.png){kind=icon}
Return
An Improved Genetic Algorithm for Constrained Optimization Problems
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2023.3240467.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The mathematical form of many optimization problems in engineering is constrained optimization problems. In this paper, an improved genetic algorithm based on two-direction crossover and grouped mutation is proposed to solve constrained optimization problems. In addition to making full use of the direction information of the parent individual, the two-direction crossover adds an additional search direction and finally searches in the better direction of the two directions, which improves the search efficiency. The grouped mutation divides the population into two groups and uses mutation operators with different properties for each group to give full play to the characteristics of these mutation operators and improve the search efficiency. In experiments on the IEEE CEC 2017 competition on constrained real-parameter optimization and ten real-world constrained optimization problems, the proposed algorithm outperforms other state-of-the-art algorithms. Finally, the proposed algorithm is used to optimize a single-stage cylindrical gear reducer.
Keywords:
Optimization
Statistics
Social factors
Genetic algorithms
Linear programming
Evolutionary computation
Search problems
Genetic algorithm
constrained optimization problem
two-direction crossover
grouped mutation
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
Cyclin A-kinase regulation of E2F-1 DNA binding function underlies suppression of an S phase checkpoint.png)
Cell
OAAI
CellIF0
OAAIShareSaveShareSaveA constrained optimization model for the provision of services in a 5G network with multi-level cybersecurity investmentsSOFT COMPUTINGOAAI
SOFT COMPUTINGIF2.5
OAAIShareSave
View more