Solving Bin Packing Problem using Simulated Annealing
Bin packing problem (BPP) is an NP-Hard combinatorial optimization problem. Several exact methods are
presented in literature for finding optimal solutions of BPP. Also heuristic and metaheuristic methods are used for on
dimensional BPP. In this paper, a proposed method using First Fit Decreasing (FFD) and Simulated Annealing (SA) algorithm
is presented for solving one dimensional BPP. At first, FFD runs to place the objects for achieving max capacity of each bin.
After this process, SA runs for searching neighbor solutions to obtain best result in objective function. In term of quality
solutions, the proposed method is capable of delivering good quality results for BPP datasets.
Index Terms—Bin packing problem, combinatorial optimization, heuristic algorithms, simulated annealing.