Last two fit augmentation to the well-known construction heuristics for one-dimensional bin-packing problem: An empirical study

International Journal of Advanced Manufacturing Technology

Volumn 50, Issue 9-12, 2010, Pages 1145-1152

  Kim, Byung In ^a   Wy, Juyoung ^a  

^a Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

Bin packing; First fit decreasing; Heuristics; Last two fit

Indexed keywords

BENCH-MARK PROBLEMS; BEST FIT DECREASING; BIN PACKING; BIN PACKING PROBLEM; COMBINATORIAL OPTIMIZATION PROBLEMS; CONSTRUCTION HEURISTICS; EMPIRICAL STUDIES; FIRST FIT; HEURISTICS; LAST TWO FIT; LOGISTICS INDUSTRY;

COMBINATORIAL OPTIMIZATION;

BINS;

EID: 77957870969     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-010-2572-z     Document Type: Article

References (23)

1. S Eilon N Christofides 1971 The loading problem Manag Sci 17 5 259 268 0208.45701 10.1287/mnsc.17.5.259
2. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco
3. S Pradhan SSY Lam 2007 Minimizing makespan during environmental stress screening using a genetic algorithm and an ant colony optimization Int J Adv Manuf Technol 32 571 577 10.1007/s00170-005-0346-9 (Pubitemid 46375271)
4. A Lodi S Martello D Vigo 2002 Recent advances on two-dimensional bin packing problems Discrete Applied Mathematics 123 379 396 1022.90020 10.1016/S0166-218X(01)00347-X 1922340 (Pubitemid 34775579)
5. Sahni S (2005) Data structures, algorithms, and applications in C++, 2nd Edition. Silicon Press, Summit
6. Coffman EG, Garey MR, Johnson DS (1997) Approximation algorithm for bin packing: a survey. In: Hochbaum D (ed) Approximation algorithm for NP-hard problems. PWS Publishing, Boston, pp 46-93
7. JND Gupta JC Ho 1999 A new heuristic algorithm for the one-dimensional bin-packing problem Production Planning & Control 10 6 598 603 10.1080/095372899232894
8. K Fleszar KS Hindi 2002 New heuristics for one-dimensional bin-packing Comput Oper Res 29 821 839 0994.90134 10.1016/S0305-0548(00)00082-4 (Pubitemid 34135092)
9. NG Hall S Ghosh RD Kankey S Narasimhan WT Rhee 1988 Bin packing problem in one dimension: heuristic solutions and confidence intervals Comput Oper Res 15 2 171 177 0636.90060 10.1016/0305-0548(88)90009-3
10. A Scholl R Klein C Jurgens 1997 BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem Comput Oper Res 24 7 627 645 0882.90113 10.1016/S0305-0548(96)00082-2
11. ACF Alvim CC Ribeiro F Glover DJ Aloise 2004 A hybrid improvement heuristic for the one-dimensional bin packing problem Journal of Heuristics 10 205 229 10.1023/B:HEUR.0000026267.44673.ed
12. A Stawowy 2008 Evolutionary based heuristic for bin packing problem Comput Ind Eng 55 465 474 10.1016/j.cie.2008.01.007
13. E Falkenauer 1996 A hybrid grouping genetic algorithm for bin packing Journal of Heuristics 2 5 30 10.1007/BF00226291
14. S Martello P Toth 1990 Lower bounds and reduction procedures for the bin packing problem Discrete Applied Mathematics 28 59 70 0704.90074 10.1016/0166-218X(90)90094-S 1064831
15. K-H Loh B Golden E Wasil 2008 Solving the one-dimensional bin packing problem with a weight annealing heuristic Comput Oper Res 35 2283 2291 1177.90347 10.1016/j.cor.2006.10.021 2585223 (Pubitemid 350161139)
16. M Ninio JJ Schneider 2005 Weight annealing Physica A 349 649 666 10.1016/j.physa.2004.10.022 (Pubitemid 40206398)
17. DS Johnson A Demers JD Ullman MR Garey RL Graham 1974 Worst-case performance bounds for simple one-dimensional packing algorithms SIAM J Comput 3 4 299 325 10.1137/0203025 434396
18. DS Johnson 1974 Fast algorithms for bin packing J Comput Syst Sci 8 272 314 0284.68023
19. DK Friesen M Langston 1991 Analysis of a compound bin packing algorithm SIAM Journal on Discrete Mathematics 4 1 61 79 0714.68033 10.1137/0404007 1090290
20. HL Ong MJ Magazine TS Wee 1984 Probabilistic analysis of bin packing heuristics Operations Research 32 5 983 998 0551.90067 10.1287/opre.32.5.983 770505
21. S Fekete J Schepers 2001 New classes of lower bounds for the bin packing problem Math Program 91 11 31 1051.90020 1865259
22. P Schwerin G Wascher 1997 The bin-packing problem: a problem generator and some numerical experiments with FFD packing and MTP Int Trans Oper Res 4 377 389 0906.90151 10.1111/j.1475-3995.1997.tb00093.x
23. G Wascher T Gau 1996 Heuristics for the integer one-dimensional cutting stock problem: a computational study OR Spectrum 18 131 144