Chaotic optimization algorithm based on Tent map
Wang Zhi-quan
Abstract
Wang Zhi-quan
Abstract
The outstanding advantage of Tent map is discussed to compare with the hybrid algorithms based on chaotic map. Combined with the pattern search algorithm, a hybrid optimization algorithm with higher search speed is constructed. Examples show the feasibility of the algorithm, as well as the practicability of Tent map.
OpenAlex reports 107 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.
The outstanding advantage of Tent map is discussed to compare with the hybrid algorithms based on chaotic map. Combined with the pattern search algorithm, a hybrid optimization algorithm with higher search speed is constructed. Examples show the feasibility of the algorithm, as well as the practicability of Tent map.
Key concepts: Tent map, Chaotic map, Chaotic, Algorithm, Difference-map algorithm, Optimization algorithm, Hybrid algorithm (constraint satisfaction), Computer science