A novel binary multi-swarms fruit fly optimisation algorithm for the 0-1 multidimensional knapsack problem Online publication date: Tue, 04-Apr-2023
by Xin Du; Jiawei Zhou; Youcong Ni; Wentao Liu; Ruliang Xiao; Xiuli Wu
International Journal of Bio-Inspired Computation (IJBIC), Vol. 21, No. 1, 2023
Abstract: To improve solution quality and accelerate convergence speed of traditional fruit fly optimisation algorithm in solving MKP, a novel binary multi-swarm fruit fly optimisation algorithm (bMFOA) is proposed. It comprises four novelties. Firstly, an item frequency tree (IFT) is constructed based on the idea of frequency pattern mining, and a new search strategy is proposed to obtain heuristic information. Secondly, two new heuristic operators of 'ADD' and 'DROP' are designed according to the obtained heuristic knowledge. Thirdly, a multi-swarm cooperation strategy is presented to strengthen the exploitation capability. To prevent algorithm falling into the local optimum prematurely, a swarm location escape strategy is put forward. To verify the efficiency of bMFOA, it is compared with some existing meta-heuristic methods by solving 58 MKPs from ORLIB. The experimental results show that the bMFOA performs better than existing meta-heuristic methods.
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 Bio-Inspired Computation (IJBIC):
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook