Solving 0-1 Knapsack Problem By Artificial Chemical Reaction Optimization Algorithm With A Greedy Strategy
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology(2015)
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.
MoreTranslated text
Key words
Artificial chemical reaction optimization,Combinatorial,Greedy,0-1 knapsack problem
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined