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

SUBMITTER: Ghadi YY

PROVIDER: S-EPMC10280447 | biostudies-literature | 2023

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

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

Ghadi Yazeed Yasin YY AlShloul Tamara T Nezami Zahid Iqbal ZI Ali Hamid H Asif Muhammad M Aljuaid Hanan H Ahmad Shahbaz S

PeerJ. Computer science 20230414

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 counseli ...[more]

PMID: 37346609

Similar Datasets

Project description:The use of solar photovoltaic systems (PVs) is increasing as a clean and affordable source of electric energy. The Pv cell is the main component of the PV system. To improve the performance, control, and evaluation of the PV system, it is necessary to provide accurate design and to define the intrinsic parameters of the solar cells. There are many methods for optimizing the parameters of the solar cells. The first class of methods is called the analytical methods that provide the model parameters using datasheet information or I-V curve data. The second class of methods is the optimization-based methods that define the problem as an optimization problem. The optimization problem objective is to minimize the error metrics and it is solved using metaheuristic optimization algorithms. The third class of methods is composed of a hybrid of both the analytical and the metaheuristic approaches, some parameters are computed by the analytical approach and the rest are found using metaheuristic optimization algorithms. Research in this area faces two challenges; (1) finding an optimal model for the parameters of the solar cells and (2) the lack of data about the photovoltaic cells. This paper proposes an optimization-based algorithm for accurately estimating the parameters of solar cells. It is using the Improved Equilibrium Optimizer algorithm (IEO). This algorithm is improved using the Opposition Based Learning (OBL) at the initialization phase of EO to improve its population diversity in the search space. Opposition-based Learning (OBL) is a new concept in machine learning inspired by the opposite relationship among entities. There are two common models for solar cells; the single diode model (SDM) and double diode model (DDM) have been used to demonstrate the capabilities of IEO in estimating the parameters of solar cells. The proposed methodology can find accurate solutions while reducing the computational cost. Compared to other existing techniques, the proposed algorithm yields less mean absolute error. The results were compared with seven optimization algorithms using data of different solar cells and PV panels. The experimental results revealed that IEO is superior to the most competitive algorithms in terms of the accuracy of the final solutions.

Dataset Information

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

Publications

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

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets