A chaos algorithm based on progressive optimality and tabu search algorithm

Author

Yang, Jun-Jie ; Zhou, Jiang-Zhong ; Wu, Wei ; Liu, Fang ; Zhu, Cheng-Jun ; Cao, Guang-Jing

Author_Institution

Huazhong Univ. of Sci. & Technol., Wuhan, China

Volume

5

fYear

2005

fDate

18-21 Aug. 2005

Firstpage

2977

Abstract

Based on the analysis of the properties of progressive optimality algorithm (POA), tabu search (TS) and mutative scale chaos optimization algorithm (MSCOA), a chaos optimization algorithm is presented. The algorithm has not only the implicit parallelism and global convergence of POA, but also the intelligence of tabu search and the fast convergence of MSCOA. The simulation results show that the algorithm, with characters of simple, optimization efficiency and strong robustness etc., is an effective technique to solve larger-scale nonlinear programming problems.

Keywords

chaos; optimisation; search problems; mutative scale chaos optimization algorithm; nonlinear programming; progressive optimality algorithm; tabu search algorithm; Algorithm design and analysis; Chaos; Convergence; Electronic mail; Iterative algorithms; Nonlinear dynamical systems; Nonlinear systems; Parallel processing; Robustness; Stochastic processes; chaos; optimization; progressive optimality algorithm; tabu search;

fLanguage

English

Publisher

ieee

Conference_Titel

Machine Learning and Cybernetics, 2005. Proceedings of 2005 International Conference on

Conference_Location

Guangzhou, China

Print_ISBN

0-7803-9091-1

Type

conf

DOI

10.1109/ICMLC.2005.1527452

Filename

1527452