Unknown

Dataset Information

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


ABSTRACT: 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

SUBMITTER: Ghadi YY 

PROVIDER: S-EPMC10280447 | biostudies-literature | 2023

REPOSITORIES: biostudies-literature