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...
Guardado en:
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!
|
Ejemplares similares
-
Investigating the occupant existence to reduce energy consumption by using a hybrid artificial neural network with metaheuristic algorithms
por: Nehal Elshaboury
Publicado: (2022) -
Planning rice cultivation in a large plot agricultural system
por: Montri Singhavara, et al.
Publicado: (2022) -
An optimal Islamic investment decision in two-region economy: The case of Indonesia and Malaysia
por: Ferry Syarifuddin, et al.
Publicado: (2022) -
Simulation optimization of an inventory control model for a reverse logistics system
por: Hanane Rachih, et al.
Publicado: (2022) -
Modelling of natural growth with memory effect in economics: An application of adomian decomposition and variational iteration methods
por: Muhamad Deni Johansyah, et al.
Publicado: (2022)