A new group search optimiser integrating multiply strategies Online publication date: Mon, 21-Aug-2017
by Chengwang Xie; Wenjing Chen; Weiwei Yu
International Journal of Computational Science and Engineering (IJCSE), Vol. 15, No. 1/2, 2017
Abstract: Group search optimiser (GSO) is a recently developed heuristic inspired by biological group search resources behaviour. However, it still has some defects such as slow convergence speed and poor accuracy of solution. In order to improve the performance of GSO in solving complex optimisation problems, an opposition-based learning (OBL) and a differential evolution (DE) are integrated into GSO to form a hybrid GSO. In this paper, the strategy of OBL is used to enlarge the search region to facilitate jumping out of the local optimal trap, and the approach of DE is utilised to enhance local search and then improve the accuracy of solution. Comparison experiments based on 13 benchmark test functions have demonstrated that our hybrid GSO performed advantages over the other peer optimisers.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Computational Science and Engineering (IJCSE):
Login with your Inderscience username and 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