A novel chaotic grey wolf optimisation for high-dimensional and numerical optimisation
by Meng Jian Zhang; Dao Yin Long; Dan Dan Li; Xiao Wang; Tao Qin; Jing Yang
International Journal of Computer Applications in Technology (IJCAT), Vol. 67, No. 2/3, 2021

Abstract: Aiming at the weakness of the current evolutionary algorithms for high-dimensional and numerical optimisation problems of global convergence, a novel chaotic grey wolf optimisation (NCGWO) is proposed for solving the high-dimensional optimisation problems. Firstly, the six chaotic one-dimensional maps are introduced and their mathematical models are improved with their mapping ranges being in the interval (0, 1). Secondly, the diversity experiments are conducted to test the results of the chaotic maps. The experiments show that the initial population by chaotic maps is superior to the GWO algorithm and the Sine map is best. Finally, the CSGWO algorithm is also proposed based on the NCGWO algorithm with the parameter C by Sine map. The simulations demonstrate that the performance of the GWO algorithm can be improved by the chaotic maps for high-dimensional and numerical optimisation problems, and the effectiveness of the CSGWO algorithm is superior to other evolutionary algorithms and achieves better accuracy and convergence speed.

Online publication date: Thu, 17-Mar-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 Computer Applications in Technology (IJCAT):
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