Volume 46, Number 1, January-March
|Page(s)||41 - 62|
|Published online||24 May 2012|
Algorithms for the two dimensional bin packing problem with partial conflicts
ICD – LOSI – University of Technology of Troyes,
UMR-STMR-CNRS-6279, Troyes, France
Received: 12 July 2011
Accepted: 27 March 2012
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.
Mathematics Subject Classification: 05-XX / 90-XX
Key words: Bin-packing / distance constraint / conflicts / genetic algorithm
© EDP Sciences, ROADEF, SMAI, 2012
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.