An Improved Shuffled Frog-Leaping Algorithm to Solving 0–1 Knapsack Problem
To address the problems of slow convergence, low search accuracy, and easy fall into local optimum, and generating a large number of infeasible solutions when solving the 0–1 Knapsack Problem, which makes it difficult to obtain the optimal solution scheme, in this paper, we present a greedy i...
Zapisane w:
| Główni autorzy: | , , |
|---|---|
| Format: | Artigo |
| Język: | Inglês |
| Wydane: |
IEEE
2024-01-01
|
| Seria: | IEEE Access |
| Hasła przedmiotowe: | |
| Dostęp online: | https://ieeexplore.ieee.org/document/10600123/ |
| Etykiety: |
Nie ma etykietki, Dołącz pierwszą etykiete!
|