A closed loop algorithms based on chaos theory for global optimization

Authors:
Xinglong Zhu;Hongguang Wang;Mingyang Zhao;Jiping Zhou
Affiliations:
Robotics Laboratory, Shenyang Institute of Automation, Chinese academy of Sciences, Shenyang, Liaoning, P.R. China;Robotics Laboratory, Shenyang Institute of Automation, Chinese academy of Sciences, Shenyang, Liaoning, P.R. China;Robotics Laboratory, Shenyang Institute of Automation, Chinese academy of Sciences, Shenyang, Liaoning, P.R. China;Mechanical Engineering College of Yangzhou University, Yangzhou, Jiangsu, P.R. China
Venue:
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Year:
2005

Citing 6
Cited 1

Evolutionary Computation at the Edge of Feasibility

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
An Evolutionary Algorithm of Contracting Search Space Based on Partial Ordering Relation for Constrained Optimization Problems

ICA3PP '02 Proceedings of the Fifth International Conference on Algorithms and Architectures for Parallel Processing
Evolutionary algorithms for constrained parameter optimization problems

Evolutionary Computation
Evolutionary programming techniques for constrained optimizationproblems

IEEE Transactions on Evolutionary Computation
Hybrid methods using genetic algorithms for global optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
On chaotic simulated annealing

IEEE Transactions on Neural Networks

Design optimization with chaos embedded great deluge algorithm

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Numerical optimization problems enjoy a significant popularity in chaos theory fields. All major chaotic techniques use such problems for various tests and experiments. However, many of these techniques encounter difficulties in solving some real-world problems which include non-trivial constrains. This paper discusses a closed loop algorithms (CLA) which based on chaos theory. Thus, for many constrained numerical optimization problems it might be beneficial to add a constraint, and make up of closed loop, using feedback theory. Given an initial best function value (BFV), after the first runs computation we subtract variable increment from obtained BFV, and name it as the new value. That the new value subtracts the new BFV in the next runs computation is defined the accessional constraints. Substituting the new BFV in the next runs for the old BFV and go on, until the global solution is searched. Eventually, some difficult test cases illustrate this approach is very available.