Comparison of different one-dimensional maps as chaotic search pattern in chaos optimization algorithms

摘要

The aim of this paper is to propose and compare different one-dimensional maps as chaotic search patterns in the constraint nonlinear optimization problems. For this purpose, about 10 one-dimensional maps are introduced that can be used as search pattern in chaos optimization algorithms. We apply these maps in specific optimization algorithm (weighted gradient direction based chaos optimization algorithm) and compare them based on numerical simulation results.