A two-dimensional bin-packing problem with conflict penalties

In this paper, we address the two-dimensional bin-packing (2BP) problem with variable conflict penalties, which incur if conflicting items are loaded into the same bin. Such a problem is observed in applications such as supermarket chains and automobile components transportation. The problem not only focuses on minimisation of number of bins used, but also deals with the conflict penalties at the same time. We propose a heuristic method based on the IMA algorithm and adapt it to solve this problem. A local search procedure is also designed to further improve the solutions. For instances derived from benchmark test data, the computational results indicate that the adapted IMA heuristic algorithm with local search effectively balances the number of bins used and the conflict penalties. The algorithm outperforms several adapted approaches that are well known for the 2BP problems.

[1]  Klaus Jansen,et al.  An Approximation Scheme for Bin Packing with Conflicts , 1998, J. Comb. Optim..

[2]  Pierre Hansen,et al.  Algorithms for the maximum satisfiability problem , 1987, Computing.

[3]  Mariem Gzara,et al.  A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts , 2011, INFORMS J. Comput..

[4]  Aziz Moukrim,et al.  New resolution algorithm and pretreatments for the two-dimensional bin-packing problem , 2008, Comput. Oper. Res..

[5]  Gilbert Laporte,et al.  Examination timetabling by computer , 1982, Comput. Oper. Res..

[6]  Paolo Toth,et al.  Algorithms for the Bin Packing Problem with Conflicts , 2010, INFORMS J. Comput..

[7]  Andrea Lodi,et al.  Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..

[8]  Xavier Bonnaire,et al.  A revision of recent approaches for two-dimensional strip-packing problems , 2009, Eng. Appl. Artif. Intell..

[9]  Nacima Labadie,et al.  Algorithms for the two dimensional bin packing problem with partial conflicts , 2012, RAIRO Oper. Res..

[10]  Daniel Mack,et al.  A parallel tabu search algorithm for solving the container loading problem , 2003, Parallel Comput..

[11]  Masoud Ataei.  A Branch-and-Price Algorithm for Bin Packing Problem , 2015 .

[12]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[13]  J. W. Barnes,et al.  An Adaptive Tabu Search Approach for 2-Dimensional Orthogonal Packing Problems , 2006 .

[14]  Daniele Vigo,et al.  TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems , 2004, Ann. Oper. Res..

[15]  Leah Epstein,et al.  Online variable-sized bin packing with conflicts , 2011, Discret. Optim..

[16]  Daniele Vigo,et al.  Recent advances on two-dimensional bin packing problems , 2002, Discret. Appl. Math..

[17]  El-Ghazali Talbi,et al.  New lower bounds for bin packing problems with conflicts , 2010, Eur. J. Oper. Res..

[18]  Ramón Alvarez-Valdés,et al.  Neighborhood structures for the container loading problem: a VNS implementation , 2010, J. Heuristics.

[19]  J. O. Berkey,et al.  Two-Dimensional Finite Bin-Packing Algorithms , 1987 .

[20]  El-Ghazali Talbi,et al.  The min-conflict packing problem , 2012, Comput. Oper. Res..

[21]  Leah Epstein,et al.  Two-dimensional packing with conflicts , 2007, Acta Informatica.

[22]  Ramón Alvarez-Valdés,et al.  A Maximal-Space Algorithm for the Container Loading Problem , 2008, INFORMS J. Comput..

[23]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[24]  El-Ghazali Talbi,et al.  Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts , 2012, Comput. Oper. Res..

[25]  Ramón Alvarez-Valdés,et al.  A tabu search algorithm for the pallet loading problem , 2005, OR Spectr..

[26]  Michel Gendreau,et al.  Heuristics and lower bounds for the bin packing problem with conflicts , 2004, Comput. Oper. Res..