Solving 0 - 1 knapsack problem by artificial chemical reaction optimization algorithm with a greedy strategy

Article type: Research Article

Authors: Truong, Tung Khac^{a; c; *} | Li, Kenli^b | Xu, Yuming^b | Ouyang, Aijia^b | Nguyen, Tien Trong^{b; c}

Affiliations: [a] Institute for Computational Science and Faculty of Civil Engineering, Ton Duc Thang University, Hochiminh City, Vietnam | [b] College of Computer Science and Electronic Engineering, Hunan University, Changsha, China | [c] Faculty of Information Technology, Industrial University of Hochiminh city, Hochiminh, Vietnam

Correspondence: [*] Correspondence to: Tung Khac Truong, Institute for Computational Science and Faculty of Civil Engineering, Ton Duc Thang University, Hochiminh City, Vietnam. [email protected]

Abstract: This paper proposes a new artificial chemical reaction optimization algorithm with a greedy strategy to solve 0-1 knapsack problem. The artificial chemical reaction optimization (ACROA) inspiring the chemical reaction process is used to implement the local and global search. A new repair operator integrating a greedy strategy and random selection is used to repair the infeasible solutions. The experimental results have proven the superior performance of ACROA compared to genetic algorithm, and quantum-inspired evolutionary algorithm.

Keywords: Artificial chemical reaction optimization, Combinatorial, Greedy, 0-1 knapsack problem

DOI: 10.3233/IFS-141500

Journal: Journal of Intelligent & Fuzzy Systems, vol. 28, no. 5, pp. 2179-2186, 2015