An empirical study of population-based metaheuristics for the multiple-choice multidimensional knapsack problem
by Francis J. Vasko; Yun Lu; Kenneth Zyma
International Journal of Metaheuristics (IJMHEUR), Vol. 5, No. 3/4, 2016

Abstract: In this paper, we study the performance of five population-based metaheuristics to solve a large (393) number of comprehensive problem instances from the literature for the important (NP-Hard) multiple choice multidimensional knapsack problem (MMKP). The five metaheuristics are: teaching-learning-based optimisation (TLBO), artificial bee colony (ABC), genetic algorithm (GA), criss-cross optimisation algorithm (COA), and binary bat algorithm (BBA). All five of these metaheuristics are similar in that they transform a population of solutions in an effort to improve the solutions in the population and they are all implemented in a straightforward manner. Statistically (over all 393 problem instances), we show that COA, GA, and TLBO give similar results which are better than other published solution approaches for the MMKP. However, if we incorporate a simple neighbourhood search into each of these five metaheuristics, in addition to improved solution quality, there is now no statistically significant difference among the results for these five metaheuristics.

Online publication date: Sat, 24-Dec-2016

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 Metaheuristics (IJMHEUR):
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