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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
