.png){kind=icon}
Return
Discrete Fick's law algorithm with new transfer function and aggregation optimization strategy for solving multiple knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10589-026-00769-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To efficiently solve the multiple knapsack problem (MKP) using Fick's law algorithm (FLA), this paper first proposes a new type of transfer functions: F-shaped transfer functions. Combining it with a modulo operation advances a discretization method for mapping continuous variables to integers. On this basis, a discrete FLA, named FFLA, suitable for solving MKP is proposed. Moreover, an optimization operator AOP is proposed based on the aggregation strategy of the remaining capacities of knapsacks, which can significantly enhance solution quality. To verify the effectiveness of FFLA, it is used to solve 30 standard MKP benchmark instances. The comparison with state-of-the-art metaheuristic algorithms for solving MKP shows that FFLA has superior performance in terms of best solution quality, average performance, convergence speed, and robustness. This work not only proposes a more competitive algorithm FFLA for solving MKP, but also breaks through the previous excessive reliance on curve shapes to design transfer functions, providing a new thinking orientation for designing transfer functions.
Keywords:
Multiple knapsack problem
Fick's law algorithm
F-shaped transfer functions
Modulo operation
Repair and optimization
Journal
C
IF:
2
Papers:
74
Citations:
3.5K
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
View more