A genetic algorithm for two-dimensional bin packing with due dates

Bennell, J.A., Lee, L.S. and Potts, C.N. (2008) A genetic algorithm for two-dimensional bin packing with due dates (Discussion Papers in Centre for Operational Research, Management Science and Information Systems, CORMSIS-08-16) Southampton, UK. University of Southampton

Abstract

This paper considers a new variant of the two-dimensional bin packing problem where each rectangle is assigned a due date and each bin has a fixed processing time. Hence the objective is not only to minimize the number of bins, but also to minimize the lateness of the rectangles. This problem is motivated by the potential increase efficiency that might be gained by mixing orders, while also aiming to ensure a certain level of customer service. We propose a genetic algorithm for searching the solution space, which uses a new placement heuristic for decoding the gene. The genetic algorithm employs an innovative crossover operator that considers a number of different children from each pair of parents. Comprehensive results are presented, and the algorithm is shown to be competitive when compared with other local search methods.

This record has no associated files available for download.

Contributors

Download statistics