Variable neighbourhood search for the variable sized bin packing problem

Computers and Operations Research

Volumn 39, Issue 5, 2012, Pages 1097-1108

  Hemmelmayr, Vera ^a   Schmid, Verena ^a   Blum, Christian ^b  

^a UNIVERSITY OF VIENNA   (Austria)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Hybrid algorithms; Variable neighbourhood search; Variable sized bin packing

Indexed keywords

BIN PACKING PROBLEM; BOUNDING TECHNIQUES; GENERALISATION; HYBRID ALGORITHMS; METAHEURISTIC; PROBLEM INSTANCES; STATE-OF-THE-ART APPROACH; TRANSPORTATION PLANNING; VARIABLE NEIGHBOURHOOD SEARCH; VARIABLE SIZED BIN PACKING;

ALGORITHMS; DYNAMIC PROGRAMMING; HEURISTIC METHODS;

BINS;

EID: 80052273370     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.07.003     Document Type: Article

References (16)

1. M. Haouari, and M. Serairi Heuristics for the variable sized bin-packing problem Computers & Operations Research 36 10 2009 2877 2884
2. D.K. Friesen, and M.A. Langston Variable sized bin packing SIAM Journal on Computing 15 1986 222 230
3. F. Murgolo An efficient approximation scheme for variable-sized bin packing SIAM Journal on Computing 16 1 1987 149 161 (Pubitemid 17526782)
4. C. Chu, and R. La Variable-sized bin packing: tight absolute worst-case performance ratios for four approximation algorithms SIAM Journal on Computing 30 2001 2069 2083 (Pubitemid 34125450)
5. J. Kang, and J. Park Algorithms for the variable sized bin packing problem European Journal of Operational Research 147 2003 365 372
6. T.G. Crainic, G. Perboli, W. Rei, and R. Tadei Efficient lower bounds and heuristics for the variable cost and size bin packing problem Computers & Operations Research 38 11 2011 1474 1482
7. Monaci M. Algorithms for packing and scheduling problems. PhD thesis, University of Bologna; 2002.
8. G. Belov, and G. Scheithauer A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths European Journal of Operational Research 141 2002 274 294 (Pubitemid 34623937)
9. C. Alves, and J.M. Valério de Carvalho Accelerating column generation for variable sized bin packing problems European Journal of Operational Research 183 2007 1333 1352 (Pubitemid 47030743)
10. M. Haouari, and M. Serairi Relaxations and exact solution of the variable sized bin packing problem Computational Optimization and Applications 48 2 2011 345 368
11. I. Correia, L. Gouveia, and F. Saldanha-Da-Gama Solving the variable size bin packing problem with discretized formulations Computers & Operations Research 35 2008 2103 2113 (Pubitemid 47615246)
12. Baldi M, Crainic T, Perboli G, Tadei R. The generalized bin packing problem. Technical Report 21, CIRRELT; 2010.
13. C. Blum, V. Hemmelmayr, H. Hernández, and V. Schmid Hybrid algorithms for the variable sized bin packing problem M.J. Blesa, C. Blum, G. Raidl, A. Roli, M. Sampels, Proceedings of HM 2010 - 7th international workshop on hybrid metaheuristics vol. 6373 2010 Springer Verlag Berlin, Germany 16 30 Lecture notes in computer science
14. N. Mladenović, and P. Hansen Variable neighborhood search Computers & Operations Research 24 11 1997 1097 1100
15. P. Hansen, N. Mlandenovic, J. Brimberg, and J.A. Moreno Pérez Variable neighborhood search M. Gendreau, J.Y. Potvin, Handbook of metaheuristics 2nd ed 2010 Springer Verlag Berlin, Germany 61 86
16. H. Kellerer, U. Pferschy, and D. Pisinger Knapsack problems 2004 Springer-Verlag Berlin, Germany