An effective resolution algorithm for the two dimensional bin packing problem

We address a two dimensional bin packing problem in this paper. Firstly, we adopt and improve bottom left placement method, which is presented as bottom left corner-occupying (BLCO). Secondly, borrowing from the respective advantages of the two algorithms, a hybrid of genetic algorithm (GA) and tabu search (TS), is developed to solve the problem. Thirdly, using a new neighborhood structure combined with the appropriate move evaluation strategy, we propose TS to re-intensify search from the promising solutions. The hybrid OATS is tested on a set of instances taken from the literature and the computation results validate the quality of the solutions.