Loading...
Please wait, while we are loading the content...
Similar Documents
A greedy adaptive search procedure for multi-dimensional multi-container packing problems
| Content Provider | Semantic Scholar |
|---|---|
| Author | Crainic, Teodor Gabriel Perboli, Guido Tadei, Roberto |
| Copyright Year | 2012 |
| Abstract | Multi-dimensional multi-container packing problems appear within many settings of theoretical and practical interest, including Knapsack, Strip Packing, Container Loading, and Scheduling problems. These various problem settings display different objective functions and constraints, which may explain the lack of efficient heuristics able to jointly address them. In this paper we introduce GASP Greedy Adaptive Search Procedure, a metaheuristics able to efficiently address two and three-dimensional multicontainer packing problems. GASP combines the simplicity of greedy algorithms with learning mechanisms, aiming to guide the overall method towards good solutions. Extensive experiments indicate that GASP attains near-optimal solutions in very short computing times. GASP also improves state-of-the-art results, when using the same computing times. |
| Starting Page | 1 |
| Ending Page | 21 |
| Page Count | 21 |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://porto.polito.it/2495925/1/CIRRELT_2012_10.pdf |
| Alternate Webpage(s) | https://www.cirrelt.ca/DocumentsTravail/CIRRELT-2012-10.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
