Binary social group optimization algorithm for solving 0-1 knapsack problem

In this paper, we propose the binary version of the Social Group Optimization (BSGO) algorithm for solving the 0-1 knapsack problem. The standard Social Group Optimization (SGO) is used for continuous optimization problems. So a transformation function is used to convert the continuous valu...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Anima Naik, Pradeep Kumar Chokkalingam
Formato: article
Lenguaje:EN
Publicado: Growing Science 2022
Materias:
Acceso en línea:https://doaj.org/article/c5cdf5c9e85b4c38b5546c05fefcf53c
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Descripción
Sumario:In this paper, we propose the binary version of the Social Group Optimization (BSGO) algorithm for solving the 0-1 knapsack problem. The standard Social Group Optimization (SGO) is used for continuous optimization problems. So a transformation function is used to convert the continuous values generated from SGO into binary ones. The experiments are carried out using both low-dimensional and high-dimensional knapsack problems. The results obtained by the BSGO algorithm are compared with other binary optimization algorithms. Experimental results reveal the superiority of the BSGO algorithm in achieving a high quality of solutions over different algorithms and prove that it is one of the best finding algorithms especially in high-dimensional cases.