Abstract

Differential evolution (DE) is an efficient population based algorithm used to solve real-valued optimization problems. It has the advantage of incorporating relatively simple and efficient mutation and crossover operators. However, the DE operator is based on floating-point representation only, and is difficult to use when solving combinatorial optimization problems. In this paper, a modified binary differential evolution (MBDE) based on a binary bit-string framework with a simple and new binary mutation mechanism is proposed. Two test functions are applied to verify the MBDE framework with the new binary mutation mechanism, and four structural topology optimization problems are used to study the performance of the proposed MBDE algorithm. The experimental studies show that the proposed MBDE algorithm is not only suitable for structural topology optimization, but also has high viability in terms of solving numerical optimization problems.

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.