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

被引：235

作者：

Tavazoei, Mohammad Saleh ^{[1
]}

Haeri, Mohammad ^{[1
]}

机构：

[1] Sharif Univ Technol, Dept Elect Engn, Adv Control Syst Lab, Tehran 113659363, Iran

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2007年 / 187卷 / 02期

关键词：

chaotic maps; chaos optimization; constrained optimization;

D O I：

10.1016/j.amc.2006.09.087

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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. (c) 2006 Elsevier Inc. All rights reserved.

引用

页码：1076 / 1085

页数：10

共 22 条

[1]

[Anonymous], J SYST ENG

[2]

[Anonymous], 1987, INTRO CHAOTIC DYNAMI

[3]

[Anonymous], 1993, Chaos in Dynamical Systems

[4]

Bucolo M., 2002, IEEE Circuits and Systems Magazine, V2, P4, DOI 10.1109/MCAS.2002.1167624

[5] Chaotic sequences to improve the performance of evolutionary algorithms [J].

Caponetto, R ;

Fortuna, L ;

Fazzino, S ;

Xibilia, MG .

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (03) :289-304

[6]

CHEN L, 1995, P INT C SIN JAP YOUN

[7]

HE D, 2001, IEEE TRANSACTIONS CI, V48

[8]

Jiang GH, 2005, CONTEMP CHIN THOUGHT, V36, P11

[9]

JIANG T, 2000, CONTROL DECISION, V15, P573

[10]

Kang LS, 2000, IEEE C EVOL COMPUTAT, P783, DOI 10.1109/CEC.2000.870378

← 1 2 3 →