Space defragmentation heuristic for 2D and 3D bin packing problems

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 699-704

  Zhang, Zhaoyi ^a   Guo, Songshan ^a   Zhu, Wenbin ^b   Oon, Wee Chong ^c   Lim, Andrew ^c  

^a SUN YAT SEN UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

BIN PACKING PROBLEM; DE-FRAGMENTATION; FREE SPACES; INCREMENTAL IMPROVEMENTS; META-HEURISTIC APPROACH; PACKING PROBLEMS; THREE-DIMENSIONAL BIN PACKINGS;

ARTIFICIAL INTELLIGENCE; HEURISTIC METHODS; THREE DIMENSIONAL;

BINS;

EID: 84876408853     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-123     Document Type: Conference Paper

References (11)

1. J. O. Berkey and P. Y. Wang. Two-Dimensional Finite Bin-Packing Algorithms. The Journal of the Operational Research Society, 38(5):423-429, 1987.
2. Marco A. Boschetti and Aristide Mingozzi. The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds. 4OR: A Quarterly Journal of Operations Research, 1(2):135-147, June 2003.
3. Teodor G. Crainic, Guido Perboli, and Roberto Tadei. Extreme Point-Based Heuristics for Three-Dimensional Bin Packing. INFORMS Journal on Computing, 20(3):368-384, June 2008.
4. Teodor G. Crainic, Guido Perboli, and Roberto Tadei. TS2PACK: A two-level tabu search for the three-dimensional bin packing problem. European Journal of Operational Research, 195(3):744-760, June 2009.
5. Oluf Faroe, David Pisinger, and Martin Zachariasen. Guided Local Search for the Three-Dimensional Bin-Packing Problem. INFORMS Journal on Computing, 15(3):267-283, January 2003.
6. Andrea Lodi, Silvano Martello, and Daniele Vigo. Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems. INFORMS Journal on Computing, 11(4):345-357, January 1999.
7. Andrea Lodi, Silvano Martello, and Daniele Vigo. Heuristic algorithms for the three-dimensional bin packing problem. European Journal of Operational Research, 141(2):410-420, September 2002.
8. Silvano Martello and Daniele Vigo. Exact Solution of the Two-Dimensional Finite Bin Packing Problem. Management Science, 44(3):388-399, March 1998.
9. Silvano Martello, David Pisinger, and Daniele Vigo. The Three-Dimensional Bin Packing Problem. Operations Research, 48(2):256-267, March 2000.
10. Michele Monaci and Paolo Toth. A Set-Covering-Based Heuristic Approach for Bin-Packing Problems. INFORMS Journal on Computing, 18(1):71-85, January 2006.
11. F. Parreño, R. Alvarez-Valdes, J. F. Oliveira, and J. M. Tamarit. Ahybrid GRASP/VND algorithm fortwo-andthree-dimensional bin packing. Annals of Operations Research, 179(1):203-220, October 2008.