An efficient optimizer for the 0/1 knapsack problem using group counseling.

Ghadi, Yazeed Yasin; AlShloul, Tamara; Nezami, Zahid Iqbal; Ali, Hamid; Asif, Muhammad; Aljuaid, Hanan; Ahmad, Shahbaz

Ghadi, Yazeed Yasin; AlShloul, Tamara; Nezami, Zahid Iqbal; Ali, Hamid; Asif, Muhammad; Aljuaid, Hanan; Ahmad, Shahbaz.

Afiliação

Ghadi YY; Department of Computer Science/Software Engineering, Al Ain University, Al Ain, UAE.
AlShloul T; Collage of General Education, Liwa College of Technology, Abu Dhabi, UAE.
Nezami ZI; Department of Computer Science, The Superior University, Lahore, Pakistan.
Ali H; Department of Computer Science, National Textile University, Faisalabad, Pakistan.
Asif M; Department of Computer Science, National Textile University, Faisalabad, Pakistan.
Aljuaid H; Computer Sciences Department, College of Computer and Information Sciences, Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.
Ahmad S; Department of Computer Science, National Textile University, Faisalabad, Pakistan.

PeerJ Comput Sci ; 9: e1315, 2023.

Article em En | MEDLINE | ID: mdl-37346609

Palavras-chave

Combinatorial; Evolutionary algorithm; Evolutionary algorithmx; GCO; Knapsack; Machine learning; Optimization

Texto completo

Adicionar na Minha BVS

Imprimir

XML

PubMed Links

Buscar no Google

Texto completo: 1 Coleções: 01-internacional Base de dados: MEDLINE Idioma: En Revista: PeerJ Comput Sci Ano de publicação: 2023 Tipo de documento: Article País de publicação: Estados Unidos

Texto completo

Adicionar na Minha BVS

Imprimir

XML

PubMed Links

Buscar no Google