A new QPSO based hybrid algorithm for bound-constrained optimisation problem and its application in engineering design problems

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.