An exponential function inflation size of multi-verse optimisation algorithm for global optimisation
by Wei Pan; Yongquan Zhou; Zhiming Li
International Journal of Computing Science and Mathematics (IJCSM), Vol. 8, No. 2, 2017

Abstract: This paper proposed an improved multi-verse optimisation (IMVO) algorithm based on exponential function inflation size. The main inspirations of IMVO are based on cosmic expansion, and inflation never ends. In the entire universe, we can think it is exponential growth. Exponential function inflation size is introduced to enhance accuracy and increase convergence rate of the multi-verse optimisation (MVO) algorithm. The numerical simulation experiments and comparisons are carried out based on a set of ten benchmark functions. The IMVO algorithm is compared with multi-verse optimisation (MVO), moth-flame optimisation (MFO), artificial bee colony (ABC) algorithm, bat algorithm (BA), differential evolution (DE) algorithm and dragonfly algorithm (DA). The experiment results show that the IMVO has not only the higher accuracy but also the faster convergence speed.

Online publication date: Fri, 21-Apr-2017

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 Computing Science and Mathematics (IJCSM):
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