Fast chaotic optimization algorithm based on locally averaged strategy and multifold chaotic attractor

Abstract

Recently, chaos theory has been used in the development of novel techniques for global optimization, and particularly, in the specification of chaos optimization algorithms (COAs) based on the use of numerical sequences generated by means of chaotic map. In this paper, we present an improved chaotic optimization algorithm using a new two-dimensional discrete multifold mapping for optimizing nonlinear functions (ICOMM). The proposed method is a powerful optimization technique, which is demonstrated when three nonlinear functions of reference are minimized using the proposed technique. 2012 Elsevier Inc. All rights reserved.

DOI: 10.1016/j.amc.2012.05.062

Extracted Key Phrases

9 Figures and Tables

Cite this paper

@article{Hamaizia2012FastCO, title={Fast chaotic optimization algorithm based on locally averaged strategy and multifold chaotic attractor}, author={Tayeb Hamaizia and Ren{\'e} Lozi and Nasr-eddine Hamri}, journal={Applied Mathematics and Computation}, year={2012}, volume={219}, pages={188-196} }