A hybrid tournament differential evolution algorithm for solving optimisation problems and applications
by Md Akhtar; Amalesh Kumar Manna; Avijit Duary; Asoke Kumar Bhunia
International Journal of Operational Research (IJOR), Vol. 45, No. 3, 2022

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.

Online publication date: Wed, 23-Nov-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com