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...

Celý popis

Podrobná bibliografie

Hlavní autoři:	Jianhao Zhang, Wei Jiang, Kang Zhao
Médium:	Artigo
Jazyk:	Inglês
Vydáno:	IEEE 2024-01-01
Edice:	IEEE Access
Témata:	Shuffled frog leaping algorithm genetic algorithm mutation 0-1 knapsack problem
On-line přístup:	https://ieeexplore.ieee.org/document/10600123/
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!