Abstract

The standard cuckoo search algorithm is of low accuracy and easy to fall into local optimal value in the later evolution. In this paper, an improved cuckoo algorithm is proposed. Dynamic change of parameter of probability is introduced to improve the convergence speed. Complex method is quoted to improve the capabilities of local search algorithm. A non-fixed multi-segment mapping penalty function is adopted to realize constraint processing algorithms. The results of the optimization problem constrained by standard test functions and two engineering design show that this algorithm is effective for solving constrained optimization problems and suitable for engineering design and other constrained optimization problems.

Details

Title
A Cuckoo Search Algorithm with Complex Local Search Method for Solving Engineering Structural Optimization Problem
Author
Qu, Chiwen; He, Wei
Section
Computer information technology and application
Publication year
2016
Publication date
2016
Publisher
EDP Sciences
ISSN
22747214
e-ISSN
2261236X
Source type
Conference Paper
Language of publication
English
ProQuest document ID
1761136174
Copyright
© 2016. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and conditions, you may use this content in accordance with the terms of the License.