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

Deskribapen osoa

Xehetasun bibliografikoak

Egile Nagusiak:	Jianhao Zhang, Wei Jiang, Kang Zhao
Formatua:	Artigo
Hizkuntza:	Inglês
Argitaratua:	IEEE 2024-01-01
Saila:	IEEE Access
Gaiak:	Shuffled frog leaping algorithm genetic algorithm mutation 0-1 knapsack problem
Sarrera elektronikoa:	https://ieeexplore.ieee.org/document/10600123/
Etiketak:	Etiketa erantsi Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!