Hybrid algorithms for the variable sized bin packing problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6373 LNCS, Issue , 2010, Pages 16-30

  Blum, Christian ^a   Hemmelmayr, Vera ^b   Hernández, Hugo ^a   Schmid, Verena ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BEAM SEARCH; BIN PACKING PROBLEM; BOUNDING TECHNIQUES; COST SET; HYBRID ALGORITHMS; STARTING SOLUTIONS; STATE-OF-THE-ART APPROACH; VARIABLE NEIGHBORHOOD SEARCH; VARIABLE SIZED BIN PACKING; ONE DIMENSIONAL BIN PACKINGS; VARIABLE SIZES;

BINS; HEURISTIC ALGORITHMS; OPTIMIZATION;

DYNAMIC PROGRAMMING;

EID: 78349233875     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16054-7_2     Document Type: Conference Paper

References (12)

1. Alves, C., Valério de Carvalho, J.M.: Accelerating column generation for variable sized bin packing problems. European Journal of Operational Research 183, 1333-1352 (2007)
2. Belov, G., Scheithauer, G.: A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. European Journal of Operational Research 141, 274-294 (2002) (Pubitemid 34623937)
3. Chu, C., La, R.: Variable-sized bin packing: tight absolute worst-case performance ratios for four approximation algorithms. SIAM Journal on Computing 30, 2069-2083 (2001)
4. Friesen, D.K., Langston, M.A.: Variable sized bin packing. SIAM Journal on Computing 15, 222-230 (1986)
5. Hansen, P., Mladenović, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research 130(3), 449-467 (2001) (Pubitemid 32875304)
6. Haouari, M., Serairi, M.: Heuristics for the variable sized bin-packing problem. Computers & Operations Research 36(10), 2877-2884 (2009)
7. Haouari, M., Serairi, M.: Relaxations and exact solution of the variable sized bin packing problem. Computational Optimization and Applications (2009) (in press)
8. Kang, J., Park, J.: Algorithms for the variable sized bin packing problem. European Journal of Operational Research 147, 365-372 (2003)
9. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack problems. Springer, Berlin (2004)
10. Mladenović, N., Hansen, P.: Variable neighborhood search. Computers & Operations Research 24(11), 1097-1100 (1997)
11. Monaci, M.: Algorithms for packing and scheduling problems. Ph.D. thesis, University of Bologna (2002)
12. Ow, P.S., Morton, T.E.: Filtered beam search in scheduling. International Journal of Production Research 26, 297-307 (1988)