Bin Packing Under Multiple Objectives - a Heuristic Approximation Approach

HE term "bin packing" describes a class of well-known, classical problems with numerous applications in logistics, operations research and related disciplines. From single dimensional to multidimensional problems, various types can be identified in practice. Common to all is the overall task of packing a finite number of n items into a minimum number of bins (knapsacks) subject to a set of practical constraints and requirements. These include given capacities of the bins, but also other considerations such as irregularly shaped bins, load balancing of the bins, etc. Numerous approaches including exact, heuristic, and metaheuristic algorithms have been proposed for the resolution of bin packing problems, and a rich literature on packing problems exists, with important classifications by D