Hostname: page-component-89b8bd64d-r6c6k Total loading time: 0 Render date: 2026-05-06T10:40:31.907Z Has data issue: false hasContentIssue false
  • English
  • Français

Algorithms for the two dimensional bin packing problem with partial conflicts

Published online by Cambridge University Press:  24 May 2012

Khaoula Hamdi-Dhaoui ,
Nacima Labadie  and
Alice Yalaoui
Khaoula Hamdi-Dhaoui
Affiliation:
ICD – LOSI – University of Technology of Troyes, UMR-STMR-CNRS-6279, Troyes, France. khaoula.hamdi@gmail.com
Nacima Labadie
Affiliation:
ICD – LOSI – University of Technology of Troyes, UMR-STMR-CNRS-6279, Troyes, France. khaoula.hamdi@gmail.com
Alice Yalaoui
Affiliation:
ICD – LOSI – University of Technology of Troyes, UMR-STMR-CNRS-6279, Troyes, France. khaoula.hamdi@gmail.com
Get access

Abstract

The two-dimensional bin packing problem is a well-known problem for which several exact and approximation methods were proposed. In real life applications, such as in Hazardous Material transportation, transported items may be partially incompatible, and have to be separated by a safety distance. This complication has not yet been considered in the literature. This paper introduces this extension called the two-dimensional bin packing problem with partial conflicts (2BPPC) which is a 2BP with distance constraints between given items to respect, if they are packed within a same bin. The problem is NP-hard since it generalizes the BP, already NP-hard. This study presents a mathematical model, two heuristics and a multi-start genetic algorithm for this new problem.

Keywords

Bin-packingdistance constraintconflictsgenetic algorithm

Information

Type
Research Article
Information
RAIRO - Operations Research , Volume 46 , Issue 1 , January 2012 , pp. 41 - 62
Copyright
© EDP Sciences, ROADEF, SMAI, 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

O. Beaumont, N. Bonichon and H. Larchevêque, Bin packing under distance constraint. Technical Report, Université de Bordeaux, Laboratoire Bordelais de Recherche en Informatique, INRIA Bordeaux Sud-Ouest (2010).
Ben Messaoud, S., Chu, C. and Espinouse, M.L., An approach to solve cutting stock sheets. Scottish Mathematical Council 6 (2004) 5109–5113. Google Scholar
Berkey, J.O. and Wang, P.Y., Two dimensional finite bin packing algorithms. J. Oper. Res. Soc. 38 (2004) 423–429. Google Scholar
E.G. Coffman, M.R. Garey and D.S. Johnson, Approximation algorithms for bin-packing – an updated survey, in Algorithm design for computer system design, edited by G. Ausiello, M. Lucertini and P. Serafini. Springer, Vienna (2007).
Environment Canada, Compliance promotion bulletin (Compro No. 12), regulations for the management of hazardous waste (2002).
Fernandes-Muritiba, A.E., Iori, M., Malaguti, E. and Toth, P., Algorithms for the bin packing problem with conflicts. Informs J. Comput. 22 (2010) 401–415. Google Scholar
Gendreau, M., Laporte, G. and Semet, F., Heuristics and lower bounds for the bin packing problem with conflicts. Comput. Oper. Res. 31 (2004) 347–358. Google Scholar
Goupy, J., Les plans d’expériences. Revue Modulad 34 (2006) 74–116. Google Scholar
Holland, J.H., Adaptation in natural and artifficial systems. University of Michigan Press, Ann Arbor, MI (1975) 1–211. Google Scholar
K. Jansen, An approximation Scheme for Bin Packing with conflicts, Lect. Notes Comput. Sci. 1432. Springer, Berlin (1998).
Johnson, D., Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9 (1974) 272–314. Google Scholar
A. Khanafer, F. Clautiaux and E.G. Talbi, Tree-decomposition based tabu search for the bin packing problems with conflicts, in Metaheuristics International Conference, MIC09. Hamburg, Germany (2009).
A. Khanafer, F. Clautiaux and E.G. Talbi, Algorithmes pour des problèmes de bin-packing mono et multi-objectif. Ph.D. thesis, Université des Sciences et Technologies de Lilles (2010).
Khanafer, A., Clautiaux, F. and Talbi, E.G., New lower bounds for bin packing problems with conflicts. Eur. J. Oper. Res. 206 (2010) 281–288. Google Scholar
Stoyan, Y.G. and Chugay, A., Packing cylinders and rectangular parallelepipeds with distances between them into a given region. Eur. J. Oper. Res. 360 (2009) 446–455. Google Scholar
Stoyan, Y.G. and Yaskov, G.N., Mathematical model and solution method of optimization problem of placement of rectangles and circles taking account special constraints. Int. Trans. Oper. Res. 5 (1998) 45–57. Google Scholar
Università di Bologna D.E.I.S., Operations Research, http://www.or.deis.unibo.it/ research.html.