Abstract
The goal of this work is to propose a hybrid algorithm, combining differential evolution algorithm and tournamenting process, for solving constrained and bound-constrained optimisation problems. Considering different options of binary tournamenting, six variants of the proposed hybrid algorithm are developed. To test the efficiency and performance of the proposed hybrid algorithm, 12 benchmark optimisation problems are considered and solved. From the obtained results of these benchmark problems, the proposed six different variants of the hybrid algorithm are compared numerically as well as graphically. From these comparisons, the best variants of the hybrid algorithm for solving constrained and bound-constrained optimisation problems are identified separately. Then by using these best variants, three well known engineering design problems are considered and solved. The computational results are compared with the results of some of the existing algorithms available in the literature. In each case, it is observed that the proposed algorithm performs well.
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 callDisclaimer: 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.
