A local region enhanced multi-objective fireworks algorithm with subpopulation cooperative selection
by Xiaoning Shen; Xuan You; Yao Huang; Yinan Guo
International Journal of Computational Science and Engineering (IJCSE), Vol. 24, No. 6, 2021

Abstract: A local region enhanced multi-objective fireworks algorithm with subpopulation cooperative selection (LREMOFWA) is proposed for multi-objective optimisation. In LREMOFWA, the ranking based on the non-dominated sorting and the crowding distance is taken as the fitness evaluation indicator. A novel way to calculate the explosion amplitude is designed to enhance the search for the local region. The concept of subpopulation is introduced, and the selection operation is performed by the elites in the archive cooperating with the optimal subpopulation sparks. The differential mutation operator is utilised to deal with the repeated individuals in the fireworks, which prevents the algorithm from falling into the local optimum. The proposed algorithm is compared with five state-of-the-art algorithms on the WFG test functions. Experimental results show that the proposed algorithm has better performance with respect to the searching accuracy and diversity. It is suitable for solving multi-objective function optimisation problems with various complex characteristics.

Online publication date: Tue, 04-Jan-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 Computational Science and Engineering (IJCSE):
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