A Hybridized Evolutionary Algorithm for Bi-objective Bi-dimensional Bin-packing Problem

Abstract

The bin-packing problem is a widely studied combinatorial optimization problem. In classical bin-packing problem, we are given a set of real numbers in the range (0,1] and the goal is to place them in minimum number of bins so that no bin holds more than one. In this paper we consider a bi-dimensional bin-packing in which we are given a set of rectangular items to be packed into minimum number of fixed size of square bins. Here we consider two objectives applied on a bi-dimensional variant, one is related to minimize number of bins and second is minimize average percentage of wastage/gaps in bins. To solve this problem we incorporate the concept of Pareto’s optimality to evolve set of solutions using evolutionary algorithm (EA) tool hybridized with the heuristic operator leading to improve results from existing techniques.