Optimization algorithm using two kinds of chaos and its application
Yuhe Zhang
Abstract
Yuhe Zhang
Abstract
In order to avoid blind searching before reducing the searching space of variable optimized in chaos optimization algorithm, an optimization algorithm using two kinds of chaos is proposed. The algorithm searches the searching space of variable optimized using two kinds of different chaos simultaneously, then reduces the searching space of variable optimized according to their searching results. The method can also improve the regularity of the algorithm and avoid choosing different parameters for different optimization function. The simulation results show that the efficiency of the algorithm is higher than that of usual ones.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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 avoid blind searching before reducing the searching space of variable optimized in chaos optimization algorithm, an optimization algorithm using two kinds of chaos is proposed. The algorithm searches the searching space of variable optimized using two kinds of different chaos simultaneously, then reduces the searching space of variable optimized according to their searching results. The method can also improve the regularity of the algorithm and avoid choosing different parameters for different optimization function. The simulation results show that the efficiency of the algorithm is higher than that of usual ones.
Key concepts: CHAOS (operating system), Variable (mathematics), Algorithm, Optimization algorithm, Mathematical optimization, Space (punctuation), Mathematics, Optimization problem