IEEE

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

Abstract: 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 ...
IEEE

Performance Analysis of Simulated Annealing on the 0-1 Knapsack Problem

Abstract: This study addresses the 0-1 Knapsack Problem (KP), a classic variant of knapsack problems, using the Simulated Annealing (SA) algorithm. The 0-1 KP, an NP-hard problem, involves selecting ...