Solving 0-1 Knapsack and Bin Packing Problem Using Logical Social Group Optimization

Solving 0-1 Knapsack and Bin Packing Problem Using Logical Social Group Optimization

The 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in the real world such as in resource allocation, logistics, decision-making, etc. The binarized variant of metah...

Full description

Saved in:
Bibliographic Details
Main Authors: Rhiddhi Prasad Das, Junali Jasmine Jena, Suresh Chandra Satapathy, Naeem M. S. Hannoon
Format: Article
Language:English
Published: IEEE 2025-01-01
Series:IEEE Access
Subjects:
0/1 Knapsack
bin packing
binarization
logic social group optimization (LSGO)
LSGO-reduc
LSGO-rever
Online Access:https://ieeexplore.ieee.org/document/11018339/
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://ieeexplore.ieee.org/document/11018339/

Similar Items