arrow
返回

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

delete2023-04-14
delete1
delete
OA
AI
Y
Yazeed Yasin Ghadi
T
Tamara Al Shloul
Z
Zahid Iqbal Nezami
H
Hamid Ali *
A
Asif, Muhammad
H
Hanan Aljuaid
S
Shahbaz Ahmad
DOI:10.7717/peerj-cs.1315delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
The field of optimization is concerned with determining the optimal solution to a problem. It refers to the mathematical loss or gain of a given objective function. Optimization must reduce the given problem's losses and disadvantages while maximizing its earnings and benefits. We all want optimal or, at the very least, suboptimal answers because we all want to live a better life. Group counseling optimizer (GCO) is an emerging evolutionary algorithm that simulates the human behavior of counseling within a group for solving problems. GCO has been successfully applied to single and multi-objective optimization problems. The 0/1 knapsack problem is also a combinatorial problem in which we can select an item entirely or drop it to fill a knapsack so that the total weight of selected items is less than or equal to the knapsack size and the value of all items is as significant as possible. Dynamic programming solves the 0/1 knapsack problem optimally, but the time complexity of dynamic programming is O(n(3)). In this article, we provide a feature analysis of GCO parameters and use it to solve the 0/1 knapsack problem (KP) using GCO. The results show that the GCO-based approach efficiently solves the 0/1 knapsack problem; therefore, it is a viable alternative to solving the 0/1 knapsack problem.
Keyword:
GCO
Knapsack
Evolutionary algorithmx
Evolutionary algorithm
Combinatorial
Optimization
Machine learning
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

PeerJ Computer Science 封面图
PeerJ Computer Science
IF:
2.5
论文数:
3.4K
被引数:
6.9K

机构

N
national textile university - pakistan
学者数:
825
论文数: 574
被引数: 1
P
Princess Nourah bint Abdulrahman University
学者数:
8.3K
论文数: 9.6K
被引数: 10
引用论文

引用论文

A modified hybrid rice optimization algorithm for solving 0-1 knapsack problem
err2021-08-20
err27
PREAI
errShu, Zhe; Ye, Zhiwei; Zong, Xinlu; Liu, Shiqin; Zhang, Daode; Wang, Chunzhi; Wang, Mingwei
err分享
err收藏
Cultural Values in Transition
err2006-10-17
err0
PREAI
errÁgnes Hofmeister Tóth; Léna Simányi
err分享
err收藏
Venous thromboembolism after total knee arthroplasty is associated with a worse functional outcome at one year
err2021-07-01
err0
PREAI
errLorenzo Calabro; Nick D. Clement; Deborah MacDonald; James T. Patton; Colin R. Howie; Richard Burnett
err分享
err收藏
学者 查看更多内容