Skip to Main content Skip to Navigation
Theses

Le problème de bin-packing en deux-dimensions, le cas non-orienté : résolution approchée et bornes inférieures.

Abstract : We treat the bin-packing problem which involves packing a given set of rectangles (items) into a minimum number of larger identical rectangles called bins. This combinatorial problem is strongly NP-hard. We propose pretreatments that allow the valorization of the lost areas in the bins and the reduction of the size problem. We attempt the resolution of the problem by computing lower and upper bounds. We propose a new scheme of computing lower bounds taking into account the possibility of rotating the items by 90 degrees. We propose a new heuristic method and a new tabu search algorithm for computing upper bounds.
Document type :
Theses
Complete list of metadatas

Cited literature [52 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00158728
Contributor : Joseph El Hayek <>
Submitted on : Friday, June 29, 2007 - 2:34:28 PM
Last modification on : Friday, May 17, 2019 - 11:38:16 AM
Long-term archiving on: : Thursday, April 8, 2010 - 10:08:28 PM

Identifiers

  • HAL Id : tel-00158728, version 1

Citation

Joseph El Hayek. Le problème de bin-packing en deux-dimensions, le cas non-orienté : résolution approchée et bornes inférieures.. Modélisation et simulation. Université de Technologie de Compiègne, 2006. Français. ⟨tel-00158728⟩

Share

Metrics

Record views

1021

Files downloads

9221