Heuristic approach of exact bin-packing model

摘要

Bin packing problem has gained a wide interest in academia and in practice since the problems quickly becomes intractable as the problem grows. In this paper two models are compared: one model that generates exact solutions for bin packing problem and one that uses the same fundamental approach on the problem but extended with a heuristic combination of next-fit and a combinational best-fit. The results proves that the heuristic approach has competitive features of linearity as the problem grows, but still with satisfying optimums in the evaluated instances.