.png){kind=icon}
Return
A modified hybrid rice optimization algorithm for solving 0-1 knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-021-02717-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The 0-1 knapsack problem (KP) is a classic NP-hard problem and could be handled by swarm intelligence algorithms. However, most of these algorithms might be trapped in the local optima as the scale increases. Hybrid rice optimization (HRO) is a novel swarm intelligence algorithm inspired by the breeding process of Chinese three-line hybrid rice, its population is classified into three types such as the maintainer, restorer and sterile line and several stages including hybridization, selfing and renewal are implemented. In this paper, a modified HRO algorithm is proposed for the complicated large-scale 0-1 KP. A dynamic step is introduced in the renewal stage to balance the exploration and exploitation phases. Moreover, HRO is combined with binary ant colony optimization (BACO) algorithm to compose the parallel model and serial model for enhancing the convergence speed and search efficiency. In the parallel model, HRO and BACO are independently implemented on two subpopulations and communicate during each iteration. In the serial model, BACO is embedded in HRO as an operator to update the maintainer line. The experimental results on 0-1 KPs of different scales and correlations demonstrate the outperformance of the parallel model and serial model.
Keywords:
0-1 knapsack problem
Swarm intelligence algorithm
Hybrid rice optimization algorithm
Binary ant colony optimization algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.5
Papers:
7.6K
Citations:
1.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave
ShareSave
View more