An improved chemical reaction optimisation algorithm for the 0-1 knapsack problem
by Hamza Onoruoiza Salami; Abubakar Bala
International Journal of Bio-Inspired Computation (IJBIC), Vol. 19, No. 4, 2022

Abstract: Knapsack problems (KPs) are well studied NP-hard problems with numerous real-life applications like capital budgeting, cargo loading, load-shedding in microgrids, and resource allocation in cloud computing. Chemical reaction optimisation (CRO) is a recently developed metaheuristic algorithm that works based on the principles of chemical reactions. This paper proposes a CRO-based algorithm for solving the 0-1 knapsack problem (0-1 KP). The proposed algorithm (newCRO) utilises a novel, optimistic neighbourhood search operator and a greedy repair and optimisation operator to fix invalid solutions and improve feasible solutions. We test the newCRO on a wide range of large-scale 0-1 KP benchmark problems, and its results are compared with five other existing methods to show its superior optimisation capabilities.

Online publication date: Fri, 22-Jul-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 Bio-Inspired Computation (IJBIC):
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