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...
Saved in:
Main Authors: | Anima Naik, Pradeep Kumar Chokkalingam |
---|---|
Format: | article |
Language: | EN |
Published: |
Growing Science
2022
|
Subjects: | |
Online Access: | https://doaj.org/article/c5cdf5c9e85b4c38b5546c05fefcf53c |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Investigating the occupant existence to reduce energy consumption by using a hybrid artificial neural network with metaheuristic algorithms
by: Nehal Elshaboury
Published: (2022) -
Planning rice cultivation in a large plot agricultural system
by: Montri Singhavara, et al.
Published: (2022) -
An optimal Islamic investment decision in two-region economy: The case of Indonesia and Malaysia
by: Ferry Syarifuddin, et al.
Published: (2022) -
Simulation optimization of an inventory control model for a reverse logistics system
by: Hanane Rachih, et al.
Published: (2022) -
Modelling of natural growth with memory effect in economics: An application of adomian decomposition and variational iteration methods
by: Muhamad Deni Johansyah, et al.
Published: (2022)