Chaos annealing searching algorithm based on power function carrier
GU Sheng-na
Abstract
GU Sheng-na
Abstract
Chaos searching strategy for combination optimization problem is proposed. In the process of optimization, the operation position of the solution matrix can be determined by chaos search, which makes the algorithm search the optimization result in the legal solution space. The power function carrier is adopted to improve the ergodicity and the sufficiency of the chaos optimization, and the simulated annealing is implemented to improve the optimization effect, therefore, the algorithm can get rid of the local minimum and reach the global minimum. The algorithm can be applied to solve many actual engineering problems. The simulation results prove the validity.
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.
Chaos searching strategy for combination optimization problem is proposed. In the process of optimization, the operation position of the solution matrix can be determined by chaos search, which makes the algorithm search the optimization result in the legal solution space. The power function carrier is adopted to improve the ergodicity and the sufficiency of the chaos optimization, and the simulated annealing is implemented to improve the optimization effect, therefore, the algorithm can get rid of the local minimum and reach the global minimum. The algorithm can be applied to solve many actual engineering problems. The simulation results prove the validity.
Key concepts: Simulated annealing, Ergodicity, Mathematical optimization, CHAOS (operating system), Local optimum, Optimization problem, Position (finance), Algorithm