Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

A New Hybrid Global Optimization Algorithm Based on Chaos Search and Complex Method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Guo, Lihua ; Dept. of Mech. Eng., Southeast Univ., Nanjing, China ; Wencheng Tang ; Chunhua Zhao

The paper presents a new hybrid global optimization algorithm based on chaos search and complex method for nonlinear constrained optimization problems. To fit for chaos optimization algorithm, a constrained optimization problem is transformed into an unconstrained problem by penalty function method. The mapping mode of standard complex method is improved to solve the problem of low computational efficiency caused by the infeasible central point which leads to the algorithm restarting. The parallel chaos optimization algorithm is applied to generate the initial complex shape, which has higher efficiency than stochastic method. And then complex method is employed to accelerate the search velocity. Chaos fine search is used to jump out of the local optimum obtained from complex method. Taking advantages of the global search of parallel chaos optimum algorithm and the fast convergence of complex method, this algorithm overcomes the low convergence rate of chaos optimization algorithm and the local optimum of complex method. Finally, the high efficiency and stability of this hybrid algorithm is demonstrated by five benchmark functions.

Published in:

Computer Modeling and Simulation, 2010. ICCMS '10. Second International Conference on  (Volume:3 )

Date of Conference:

22-24 Jan. 2010