Please submit manuscripts in either of the following two submission systems

    ScholarOne Manuscripts

  • ScholarOne

    • 勤云稿件系统

  • 登录

Search by Issue

  • 2024 Vol.31
  • 2023 Vol.30
  • 2022 Vol.29
  • 2021 Vol.28
  • 2020 Vol.27
  • 2019 Vol.26
  • 2018 Vol.25
  • 2017 Vol.24
  • 2016 vol.23
  • 2015 vol.22
  • 2014 vol.21
  • 2013 vol.20
  • 2012 vol.19
  • 2011 vol.18
  • 2010 vol.17
  • 2009 vol.16
  • No.1
  • No.2

Search by Keywords

  • Search by Title
  • Search by Keywords
  • Search by Abstract
  • Search by Author's Chinese Name
  • Search by Author's English Name
  • Search by Fund

News & AnnouncementMORE

Supervised by Ministry of Industry and Information Technology of The People's Republic of China Sponsored by Harbin Institute of Technology Editor-in-chief Yu Zhou ISSNISSN 1005-9113 CNCN 23-1378/T

期刊网站二维码
微信公众号二维码
Related citation:FEI Chun-guo,HAN Zheng-zhi.A novel chaotic optimization algorithm and its applications[J].Journal of Harbin Institute Of Technology(New Series),2010,17(2):254-258.DOI:10.11916/j.issn.1005-9113.2010.02.020.
【Print】   【HTML】   【PDF download】   【View/Add Comment】  【Download reader】  【 Close 】
←Previous|Next→ Back Issue    Advanced Search
This paper has been: browsed 855times   downloaded 623times 本文二维码信息
码上扫一扫！
Shared by: Wechat More
Font:larger+|default|smaller-
A novel chaotic optimization algorithm and its applications
Author NameAffiliation
FEI Chun-guo College of Aeronautical Automation,Civil Aviation University of China,Tianjin 300300,China 
HAN Zheng-zhi Dept. of Automation,Shanghai Jiaotong University,Shanghai 200030,China 
Abstract:
This paper presents a chaos-genetic algorithm (CGA) that combines chaos and genetic algorithms. It can be used to avoid trapping in local optima profiting from chaos’randomness,ergodicity and regularity. Its property of global asymptotical convergence has been proved with Markov chains in this paper. CGA was applied to the optimization of complex benchmark functions and artificial neural network’s (ANN) training. In solving the complex benchmark functions,CGA needs less iterative number than GA and other chaotic optimization algorithms and always finds the optima of these functions. In training ANN,CGA uses less iterative number and shows strong generalization. It is proved that CGA is an efficient and convenient chaotic optimization algorithm.
Key words:  chaotic optimization  chaos-genetic algorithms (CGA)  genetic algorithms  neural network.
DOI：10.11916/j.issn.1005-9113.2010.02.020
Clc Number:TP18
Fund:

LINKS

Copyright © The Editorial Department of Journal of Harbin Institute of Technology
Address: 92 West Dazhi Street, Nan Gang District, Harbin, Heilongjiang Province, China Postcode: 150001
(C)2015 JOURNAL OF HIT ALL RIGHTS RESERVED. ICP. 0000423255