Heuristics for the variable sized bin-packing problem

Computers and Operations Research

Volumn 36, Issue 10, 2009, Pages 2877-2884

  Haouari, Mohamed ^a,b   Serairi, Mehdi ^b  

^a OZYEGIN UNIVERSITY   (Turkey)

^b UNIVERSITY OF CARTHAGE   (Tunisia)

Author keywords

Bin packing problem; Genetic algorithm; Heuristics

Indexed keywords

BINS;

BIN-PACKING PROBLEM; COST SETS; CPU TIME; EMPIRICAL PERFORMANCE; HEURISTICS; HIGH-QUALITY SOLUTIONS; ONE-DIMENSIONAL; SET COVERINGS; SUBSET-SUM PROBLEMS; TEST INSTANCES;

HEURISTIC METHODS;

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

References (29)

1. Friesen D.K., and Langston M.A. Variable sized bin packing. SIAM Journal on Computing 15 (1986) 222-230
2. Murgolo F.D. An efficient approximation scheme for variable-sized bin packing. SIAM Journal on Computing 16 (1987) 149-161
3. Coffman E.G., Garey M.R., and Johnson D.S. Bin packing with divisible item sizes. Journal of Complexity 3 (1987) 406-428
4. Kang J., and Park J. Algorithms for the variable sized bin packing problem. European Journal of Operational Research 147 (2003) 365-372
5. Chu C., and La R. Variable-sized bin packing: tight absolute worst-case performance ratios for four approximation algorithms. SIAM Journal on Computing 30 (2001) 2069-2083
6. Monaci M. Algorithms for packing and scheduling problems, PhD thesis, University of Bologna, 2002.
7. Belov G., and Scheithauer G. A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. European Journal of Operational Research 141 (2002) 274-294
8. Alves C., and Valério de Carvalho J.M. Accelerating column generation for variable sized bin packing problems. European Journal of Operational Research 183 (2007) 1333-1352
9. Haouari M, Serairi M. Relaxations and exact solution of the variable sized bin packing problem. Computational Optimization and Applications, 2009, accepted.
10. Caprara A., and Pferschy U. Worst-case analysis of the subset sum algorithm for bin packing. Operations Research Letters 32 (2004) 159-166
11. Kellerer H., Pferschy U., and Pisinger D. Knapsack problems (2004), Springer, Berlin
12. Caprara A., and Pferschy U. Modified subset sum heuristics for bin packing. Information Processing Letters 96 (2005) 18-23
13. Cullen F., Jarvis J., and Ratliff D. Set partitioning based heuristics for interactive routing. Networks 11 (1981) 125-144
14. Kelly J.P., and Xu J. A set-partitioning-based heuristic for the vehicle routing problem. INFORMS Journal on Computing 11 (1999) 161-172
15. Marsten R., and Shepardson F. Exact solution of crew scheduling problems using the set partitioning model: recent successful applications. Networks 112 (1981) 167-177
16. Wedelin D. An algorithm for large scale 0-1 integer programming with application to airline crew scheduling. Annals of Operations Research 57 (1995) 283-301
17. Caprara A., Fischetti M., Toth P., Vigo D., and Guida P.L. Algorithms for railway crew management. Mathematical Programming 79 (1997) 125-141
18. Monaci M., and Toth P. A set-covering-based heuristic approach for bin packing Problems. INFORMS Journal on Computing 18 (2006) 71-85
19. Beasley J.E., and Chu P.C. A genetic algorithm for the set covering problem. European Journal of Operational Research 94 (1996) 392-404
20. Ceria S., Nobili P., and Sassano A. A Lagrangian-based heuristic for large-scale set covering problems. Mathematical Programming 81 (1998) 215-228
21. Caprara A., Fischetti M., and Toth P. A heuristic method for the set covering problem. Operations Research 47 (1999) 730-743
22. Haouari M., and Chaouachi J. A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem. Journal of Operational Research Society 53 (2002) 792-799
23. Jakobs S. On genetic algorithms for the packing of polygons. European Journal of Operational Research 88 (1996) 165-181
24. Hopper E., and Turton B. A genetic algorithm for a 2D industrial packing problem. Computers and Industrial Engineering 37 (1999) 375-378
25. Zhang D.F., Chen S.D., and Liu Y.J. An improved heuristic recursive strategy based on genetic algorithm for the strip rectangular packing problem. Acta Automatica Sinica 33 (2007) 911-916
26. Falkenauer E. A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics 2 (1996) 5-30
27. Lima H, Yakawa T. A new design of genetic algorithm for bin packing, In: Evolutionary computation, 2003. CEC '03. The 2003 Congress on Evolutionary Computation, vol. 2, pp. 1044-9.
28. Ruiz R., Maroto C., and Alcaraz J. Two new robust genetic algorithms for the flowshop scheduling problem. Omega 34 (2006) 461-476
29. Pisinger D., and Sigurd M. The two-dimensional bin packing problem with variable bin sizes and costs. Discrete Optimization 2 (2005) 154-167