Abstract
The goal of this paper is to propose a new hybrid algorithm based on advanced quantum behaved particle swarm optimization (QPSO) technique and binary tournamenting for solving constrained optimization problems. In binary tournamenting, six different situations/options are considered and accordingly six variants of hybrid algorithms are proposed. Then to test the efficiency and performance of these algorithms and also to select the best algorithm among these, six benchmark optimization problems are selected and solved. Then the computational results are compared graphically as well as numerically. Finally, the best found algorithm is applied to solve three engineering design problems and the computational results are compared with the existing algorithms available in the literature.
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.
