New algorithms for the bin packing problem

Abstract

Bin Packing is a well-known NP-complete problem which has many real-life applications. In this study, an extensive literature survey is followed by a number of new heuristic and optimal algorithms developed using a new general procedure called "Similar Tree Search Algorithm" to solve zero-one integer prograrrming problems. Besides, a new special case of the bin packing problem, smooth packing, is defined and algorithmS to solve this new problem are generated and tested.