A comprehensive analysis on optimization performance of chaotic evolution and its parameter distribution

Yan Pei, Hideyuki Takagi, Qiangfu Zhao, Yong Liu

Research output: Contribution to journalConference article

Abstract

In this paper, we analyse and discuss the relationship between optimization performance of chaotic evolution (CE) algorithm and distribution characteristic of chaotic parameter. CE is an evolutionary computation algorithm that simulates chaotic motion of a chaotic system in a search space for implementing optimization. However, its optimization performance, internal process mechanism and optimization principle are not well studied. In this paper, we investigate distribution characteristics of chaotic systems, which support chaotic parameter in CE algorithm. Compared with other two parameter generators, i.e., a quadratic-like random generator and an uniform random generator, CE algorithm with chaotic parameter generated by the logistic map (μ = 4) shows better optimization performance significantly. We also make an algorithm comparison with differential evolution and an algorithm ranking by Friedman test and Bonferroni-Dunn test. The related topics on relationship between optimization performance of CE algorithm and chaotic parameter distribution are analysed and discussed. From these analyses and discussions, it indicates that chaotic parameter distribution is a significant factor that influences optimization performance of CE algorithm.

Original languageEnglish
Article number6974468
Pages (from-to)3481-3486
Number of pages6
JournalConference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
Volume2014-January
Issue numberJanuary
DOIs
Publication statusPublished - Jan 1 2014
Event2014 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2014 - San Diego, United States
Duration: Oct 5 2014Oct 8 2014

Fingerprint

Chaotic systems
Evolutionary algorithms
Logistics

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Human-Computer Interaction

Cite this

A comprehensive analysis on optimization performance of chaotic evolution and its parameter distribution. / Pei, Yan; Takagi, Hideyuki; Zhao, Qiangfu; Liu, Yong.

In: Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics, Vol. 2014-January, No. January, 6974468, 01.01.2014, p. 3481-3486.

Research output: Contribution to journalConference article

@article{664aa4ea3ef641b9805d5812259c2916,
title = "A comprehensive analysis on optimization performance of chaotic evolution and its parameter distribution",
abstract = "In this paper, we analyse and discuss the relationship between optimization performance of chaotic evolution (CE) algorithm and distribution characteristic of chaotic parameter. CE is an evolutionary computation algorithm that simulates chaotic motion of a chaotic system in a search space for implementing optimization. However, its optimization performance, internal process mechanism and optimization principle are not well studied. In this paper, we investigate distribution characteristics of chaotic systems, which support chaotic parameter in CE algorithm. Compared with other two parameter generators, i.e., a quadratic-like random generator and an uniform random generator, CE algorithm with chaotic parameter generated by the logistic map (μ = 4) shows better optimization performance significantly. We also make an algorithm comparison with differential evolution and an algorithm ranking by Friedman test and Bonferroni-Dunn test. The related topics on relationship between optimization performance of CE algorithm and chaotic parameter distribution are analysed and discussed. From these analyses and discussions, it indicates that chaotic parameter distribution is a significant factor that influences optimization performance of CE algorithm.",
author = "Yan Pei and Hideyuki Takagi and Qiangfu Zhao and Yong Liu",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/smc.2014.6974468",
language = "English",
volume = "2014-January",
pages = "3481--3486",
journal = "Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics",
issn = "1062-922X",
number = "January",

}

TY - JOUR

T1 - A comprehensive analysis on optimization performance of chaotic evolution and its parameter distribution

AU - Pei, Yan

AU - Takagi, Hideyuki

AU - Zhao, Qiangfu

AU - Liu, Yong

PY - 2014/1/1

Y1 - 2014/1/1

N2 - In this paper, we analyse and discuss the relationship between optimization performance of chaotic evolution (CE) algorithm and distribution characteristic of chaotic parameter. CE is an evolutionary computation algorithm that simulates chaotic motion of a chaotic system in a search space for implementing optimization. However, its optimization performance, internal process mechanism and optimization principle are not well studied. In this paper, we investigate distribution characteristics of chaotic systems, which support chaotic parameter in CE algorithm. Compared with other two parameter generators, i.e., a quadratic-like random generator and an uniform random generator, CE algorithm with chaotic parameter generated by the logistic map (μ = 4) shows better optimization performance significantly. We also make an algorithm comparison with differential evolution and an algorithm ranking by Friedman test and Bonferroni-Dunn test. The related topics on relationship between optimization performance of CE algorithm and chaotic parameter distribution are analysed and discussed. From these analyses and discussions, it indicates that chaotic parameter distribution is a significant factor that influences optimization performance of CE algorithm.

AB - In this paper, we analyse and discuss the relationship between optimization performance of chaotic evolution (CE) algorithm and distribution characteristic of chaotic parameter. CE is an evolutionary computation algorithm that simulates chaotic motion of a chaotic system in a search space for implementing optimization. However, its optimization performance, internal process mechanism and optimization principle are not well studied. In this paper, we investigate distribution characteristics of chaotic systems, which support chaotic parameter in CE algorithm. Compared with other two parameter generators, i.e., a quadratic-like random generator and an uniform random generator, CE algorithm with chaotic parameter generated by the logistic map (μ = 4) shows better optimization performance significantly. We also make an algorithm comparison with differential evolution and an algorithm ranking by Friedman test and Bonferroni-Dunn test. The related topics on relationship between optimization performance of CE algorithm and chaotic parameter distribution are analysed and discussed. From these analyses and discussions, it indicates that chaotic parameter distribution is a significant factor that influences optimization performance of CE algorithm.

UR - http://www.scopus.com/inward/record.url?scp=84938118025&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84938118025&partnerID=8YFLogxK

U2 - 10.1109/smc.2014.6974468

DO - 10.1109/smc.2014.6974468

M3 - Conference article

AN - SCOPUS:84938118025

VL - 2014-January

SP - 3481

EP - 3486

JO - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

JF - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

SN - 1062-922X

IS - January

M1 - 6974468

ER -