Abstract

Differential Search method is recently proposed to solve box constrained global optimization problems. In this paper, we will further extend this method to solve generalized constrained optimization problems, particularly for structure design optimization problems. To handle the constraints, we first propose a novel dynamic S-type soft-threshold penalty method. Then, the original constrained optimization problem is transformed into a sequence of unconstrained optimization problems. The proposed method is mainly comprised of two steps: parameter iteration and solution iteration. The parameter iteration is to update the dynamic penalty parameter through a soft-threshold scheme and the solution iteration is to implement Differential Search algorithm to solve an unconstrained optimization problem. Two benchmark sets, CEC2006 and CEC2010, and four engineering structure design optimization problems are solved by our proposed algorithm as well as many other swarm-based algorithms proposed in recent literatures. Numerical results show that our method can achieve better performance but with fewer function evaluations comparing with the existing algorithms.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.