2005Kongzhi yu jueceRequires access

Chaotic optimization algorithm based on Tent map

Wang Zhi-quan

Open publisher page 107 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 107 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Tent map, Chaotic map, Chaotic, Algorithm, Difference-map algorithm, Optimization algorithm, Hybrid algorithm (constraint satisfaction), Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Chaotic optimization algorithm based on Tent map — Research Paper | ScholarLens