A squeaky wheel optimisation methodology for two-dimensional strip packing

Computers and Operations Research

Volumn 38, Issue 7, 2011, Pages 1035-1044

  Burke, Edmund K ^a   Hyde, Matthew R ^a   Kendall, Graham ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Artificial intelligence; Cutting stock; Heuristics; Local search

Indexed keywords

CUTTING STOCK; HEURISTICS; ITERATIVE PROCEDURES; LOCAL SEARCH; ONE-PASS; OPTIMISATIONS; REACTIVE GRASP; SOLUTION QUALITY; STATE OF THE ART; TWO-DIMENSIONAL STRIP;

ARTIFICIAL INTELLIGENCE; OPTIMIZATION; TWO DIMENSIONAL; WHEELS;

ITERATIVE METHODS;

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

References (34)

1. H. Dyckhoff A typology of cutting and packing problems European Journal of Operational Research 44 2 1990 145 159
2. G. Wscher, H. Haußner, and H. Schumann An improved typology of cutting and packing problems European Journal of Operational Research 183 3 2007 1109 1130
3. A. Lodi, S. Martello, and D. Vigo Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems INFORMS Journal on Computing 11 4 1999 345 357 ISSN 1526-5528
4. A. Bortfeldt A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces European Journal of Operational Research 172 3 2006 814 837
5. E. Burke, G. Kendall, and G. Whitwell A new placement heuristic for the orthogonal stock-cutting problem Operations Research 55 4 2004 655 671
6. E. Burke, G. Kendall, and G. Whitwell A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock cutting problem INFORMS Journal on Computing 21 3 2009 505 516
7. S. Imahori, and M. Yagiura The best-fit heuristic for the rectangular strip packing problem: an efficient implementation and the worst-case approximation ratio Computers and Operations Research 37 2 2009 325 333
8. R. Alvarez-Valdes, F. Parreno, and J.M. Tamarit Reactive GRASP for the strip-packing problem Computers and Operations Research 35 4 2008 1065 1083
9. G. Belov, G. Scheithauer, and E.A. Mukhacheva One-dimensional heuristics adapted for two-dimensional rectangular strip packing Journal of the Operational Research Society 59 6 2008 823 832
10. D.E. Joslin, and D.P. Clements "Squeaky Wheel" optimisation Journal of Artificial Intelligence Research 10 1999 353 373
11. U. Aickelin, E.K. Burke, and J. Li An evolutionary squeaky wheel optimization approach to personnel scheduling IEEE Transactions on Evolutionary Computation 13 2 2009 433 443
12. K.A. Dowsland, and W. Dowsland Packing problems European Journal of Operational Research 56 1 1992 2 14
13. A. Lodi, S. Martello, and M. Monaci Two-dimensional packing problems: a survey European Journal of Operational Research 141 2 2002 241 252
14. F. Clautiaux, A. Jouglet, J. Carlier, and A. Moukrim A new constraint programming approach for the orthogonal packing problem Computers and Operations Research 35 3 2008 944 959
15. M. Kenmochi, T. Imamichi, K. Nonobe, M. Yagiura, and H. Nagamochi Exact algorithms for the two-dimensional strip packing problem with and without rotations European Journal of Operational Research 198 1 2009 73 83
16. Macedo R, Alves C, Valerio de Carvalho JM. Arc-flow model for the two-dimensional guillotine cutting stock problem, Computers and Operations Research 2010;37(6)9911001
17. R. Alvarez-Valdes, F. Parreno, and J.M. Tamarit A branch and bound algorithm for the strip packing problem OR Spectrum 31 2 2009 431 459
18. B.S. Baker, E.G. Coffman Jr., and R.L. Rivest Orthogonal packings in two dimensions SIAM Journal on Computing 9 4 1980 846 855
19. B. Chazelle The bottom-left bin packing heuristic: an efficient implementation IEEE Transactions on Computers 32 8 1983 697 707
20. D.J. Brown, B.S. Baker, and H.P. Katseff Lower bounds for on-line two-dimensional packing algorithms Acta Informatica 18 2 1982 1982
21. E. Hopper, and B.C.H. Turton An Empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem European Journal of Operational Research 128 1 2001 34 57
22. D. Zhang, Y. Kang, and A. Deng A new heuristic recursive algorithm for the strip rectangular packing problem Computers and Operations Research 33 8 2006 2209 2217
23. F. Rinaldi, and A. Franz A two-dimensional strip cutting problem with sequencing constraint European Journal of Operational Research 183 3 2007 1371 1384
24. Asik OB, zcan E. Bidirectional best-fit approach for orthogonal rectangular strip packing. Annals of Operations Research 2009;172:40527
25. S. Jakobs On genetic algorithms for the packing of polygons European Journal of Operational Research 88 1 1996 165 181
26. D. Liu, and H. Teng An improved BL-algorithm for genetic algorithms of the orthogonal packing of rectangles European Journal of Operational Research 112 2 1999 413 419
27. A. Ramesh Babu, and N. Ramesh Babu Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms International Journal of Production Research 37 7 1999 1625 1643
28. Valenzuela CL, Wang PY. Heuristics for large strip packing problems with guillotine patterns: an empirical study. In: Proceedings of the metaheuristics international conference 2001 (MIC'01), University of Porto, Porto, Portugal, 2001. p. 41721.
29. K.K. Lai, and J.W.M. Chan Developing a simulated annealing algorithm for the cutting stock problem Computers and Industrial Engineering 32 1 1997 115 127
30. L. Faina An application of simulated annealing to the cutting stock problem European Journal of Operational Research 114 3 1999 542 556
31. S. Martello, M. Monaci, and D. Vigo An exact approach to the strip-packing problem INFORMS Journal on Computing 15 3 2003 310 319
32. Hopper E. Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods. PhD Thesis, Cardiff University; 2000.
33. S. Martello, and D. Vigo Exact solution of the two-dimensional finite bin packing problem Management Science 44 3 1998 388 399
34. J.O. Berkey, and P.Y. Wang Two-dimensional finite bin-packing algorithms Journal of the Operational Research Society 38 5 1987 423 429