Solving knapsack problems using a binary gaining sharing knowledge-based optimization algorithm

doi:10.1007/s40747-021-00351-8

Solving knapsack problems using a binary gaining sharing knowledge-based optimization algorithm

2021-04-04

31

OA

AI

DOI：10.1007/s40747-021-00351-8

原文链接

查看原文

摘要

En 中文

This article proposes a novel binary version of recently developed Gaining Sharing knowledge-based optimization algorithm (GSK) to solve binary optimization problems. GSK algorithm is based on the concept of how humans acquire and share knowledge during their life span. A binary version of GSK named novel binary Gaining Sharing knowledge-based optimization algorithm (NBGSK) depends on mainly two binary stages: binary junior gaining sharing stage and binary senior gaining sharing stage with knowledge factor 1. These two stages enable NBGSK for exploring and exploitation of the search space efficiently and effectively to solve problems in binary space. Moreover, to enhance the performance of NBGSK and prevent the solutions from trapping into local optima, NBGSK with population size reduction (PR-NBGSK) is introduced. It decreases the population size gradually with a linear function. The proposed NBGSK and PR-NBGSK applied to set of knapsack instances with small and large dimensions, which shows that NBGSK and PR-NBGSK are more efficient and effective in terms of convergence, robustness, and accuracy.

Keyword:

Gaining sharing knowledge-based optimization algorithm

0– 1 Knapsack problem

Population reduction technique

Metaheuristic algorithms

Binary variables

Solving knapsack problems using a binary gaining sharing knowledge-based optimization algorithm

摘要

AI总结

期刊

机构