An improved chemical reaction optimisation algorithm for the 0-1 knapsack problem

Salami, H.O. and Bala, A. (2022) An improved chemical reaction optimisation algorithm for the 0-1 knapsack problem. International Journal of Bio-Inspired Computation, 19 (4). pp. 253-266. ISSN 17580366

Full text not available from this repository.
Official URL: https://www.scopus.com/inward/record.uri?eid=2-s2....

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. Copyright © 2022 Inderscience Enterprises Ltd.

Item Type: Article
Additional Information: cited By 1
Uncontrolled Keywords: Budget control; Chemical reactions; Computational complexity, 0-1 knapsack problem; Capital budgeting; Chemical reaction optimization algorithms; Chemical-reaction optimizations; Knapsack problems; Load-shedding; Meta-heuristics algorithms; Microgrid; Real-life applications, Combinatorial optimization
Depositing User: Mr Ahmad Suhairi UTP
Date Deposited: 19 Dec 2023 03:23
Last Modified: 19 Dec 2023 03:23
URI: https://khub.utp.edu.my/scholars/id/eprint/17580

Actions (login required)

View Item
View Item