Optimization of heterogeneous Bin packing using adaptive genetic algorithm

Abstract. This research is concentrates on a very interesting work, the bin packing using
hybrid genetic approach. The optimal and feasible packing of goods for transportation and
distribution to various locations by satisfying the practical constraints are the key points in this
project work. As the number of boxes for packing can not be predicted in advance and the
boxes may not be of same category always. It also involves many practical constraints that are
why the optimal packing makes much importance to the industries. This work presents a
combinational of heuristic Genetic Algorithm (HGA) for solving Three Dimensional (3D)
Single container arbitrary sized rectangular prismatic bin packing optimization problem by
considering most of the practical constraints facing in logistic industries. This goal was
achieved in this research by optimizing the empty volume inside the container using genetic
approach. Feasible packing pattern was achieved by satisfying various practical constraints like
box orientation, stack priority, container stability, weight constraint, overlapping constraint,
shipment placement constraint. 3D bin packing problem consists of ‘n’ number of boxes being to be packed in to a container of standard dimension in such a way to maximize the volume utilization and in-turn profit. Furthermore, Boxes to be packed may be of arbitrary sizes. The user input data are the number of bins, its size, shape, weight, and constraints if any along with standard container dimension. This user input were stored in the database and encoded to string (chromosomes) format which were normally acceptable by GA. GA operators were allowed to act over these encoded strings for finding the best solution.