Abstract
The aim of this paper is to introduce a new hybrid algorithm for bound-constrained optimisation problem combining quantum behaved particle swarm optimisation (QPSO) and binary tournamenting technique. Depending on the different options of binary tournamenting process, six diverse forms of hybrid algorithm are introduced. Then the efficiency and performance of these hybrid algorithms are investigated through six well known benchmark bound-constrained optimisation problems. Computational results are compared graphically as well as numerically. Finally, this algorithm is utilised to solve four engineering design problems and results are compared with the recent algorithm available in the literature.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Computing Science and Mathematics
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.
