A biased random key genetic algorithm for 2D and 3D bin packing problems

International Journal of Production Economics

Volumn 145, Issue 2, 2013, Pages 500-510

  Gonçalves, José Fernando ^a   Resende, Mauricio G C ^b  

^a UNIVERSITY OF PORTO   (Portugal)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Bin packing; Genetic algorithm; Random keys; Three dimensional

Indexed keywords

BIN PACKING; BIN PACKING PROBLEM; COMPUTATIONAL EXPERIMENT; FITNESS FUNCTIONS; NEW APPROACHES; PROBLEM INSTANCES; RANDOM KEYS; SOLUTION QUALITY;

THREE DIMENSIONAL;

GENETIC ALGORITHMS;

EID: 84883465452     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2013.04.019     Document Type: Article

References (39)

1. J. Bean Genetic algorithms and random keys for sequencing and optimization ORSA Journal on Computing 6 1994 154 160
2. J. Beasley Algorithms for unconstrained two-dimensional guillotine cutting Journal of the Operational Research Society 36 1985 297 306
3. J. Beasley An exact two-dimensional non-guillotine cutting tree search procedure Operations Research 33 1985 49 64
4. B. Bengtsson Packing rectangular pieces - a heuristic approach The Computer Journal 25 1982 353 357
5. J. Berkey, and P. Wang Two-dimensional finite bin-packing algorithms Journal of the Operational Research Society 38 1987 423 429
6. M. Boschetti New lower bounds for the three-dimensional finite bin packing problem Discrete Applied Mathematics 140 2004 241 258
7. M. Boschetti, and A. Mingozzi The two-dimensional finite bin packing problem. Part I. New lower bounds for the oriented case 4OR A Quarterly Journal of Operations Research 1 2003 27 42
8. M. Boschetti, and A. Mingozzi The two-dimensional finite bin packing problem. Part II. New lower and upper bounds 4OR A Quarterly Journal of Operations Research 1 2003 135 147
9. N. Christofides, and C. Whitlock An algorithm for two-dimensional cutting problems Operations Research 25 1977 30 44
10. 2PACK: a two-level tabu search for the three-dimensional bin packing problem European Journal of Operational Research 195 2009 744 760
11. E. den Boef, J. Korst, S. Martello, D. Pisinger, and D. Vigo Erratum to "The three-dimensional bin packing problem" robot-packable and orthogonal variants of packing problems Operations Research 53 2005 735 736
12. O. Faroe, D. Pisinger, and M. Zachariasen Guided local search for the three-dimensional bin-packing problem INFORMS Journal on Computing 15 2003 267 283
13. Fekete, S., Schepers, J., 1997. A new exact algorithm for general orthogonal d-dimensional knapsack problems. In: Algorithms-ESA'97, Springer, pp. 144-156.
14. S. Fekete, and J. Schepers A combinatorial characterization of higher-dimensional orthogonal packing Mathematics of Operations Research 29 2004 353 368
15. S. Fekete, J. Schepers, and J. VanderVeen An exact algorithm for higher-dimensional orthogonal packing Operations Research 55 2007 569 587
16. J.F. Goncalves, and P.S.A. Sousa A genetic algorithm for lot sizing and scheduling under capacity constraints and allowing backorders International Journal of Production Research 49 2011 2683 2703
17. J.F. Gonçalves, and J.R. Almeida A hybrid genetic algorithm for assembly line balancing Journal of Heuristics 8 2002 629 642
18. J.F. Gonçalves, J.J.M. Mendes, and M.G.C. Resende A hybrid genetic algorithm for the job shop scheduling problem European Journal of Operational Research 167 2005 77 95
19. J.F. Gonçalves, J.J.M. Mendes, and M.G.C. Resende A genetic algorithm for the resource constrained multi-project scheduling problem European Journal of Operational Research 189 2009 1171 1190
20. J.F. Gonçalves, and M.G.C. Resende An evolutionary algorithm for manufacturing cell formation Computers and Industrial Engineering 47 2004 247 273
21. J.F. Gonçalves, and M.G.C. Resende Biased random-key genetic algorithms for combinatorial optimization Journal of Heuristics 17 2011 487 525
22. J.F. Gonçalves, and M.G.C. Resende A parallel multi-population biased random-key genetic algorithm for a container loading problem Computers and Operations Research 39 2012 179 190
23. J.F. Gonçalves, M.G.C. Resende, and J.J.M. Mendes A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem Journal of Heuristics 17 2011 467 486
24. S. Hartmann Packing problems and project scheduling models an integrating perspective Journal of the Operational Research Society 2000 1083 1092
25. Johnson, D., 1973. Near-Optimal Bin Packing Algorithms. Ph.D. Thesis, Massachusetts Institute of Technology.
26. K. Lai, and J. Chan Developing a simulated annealing algorithm for the cutting stock problem Computers and Industrial Engineering 32 1997 115 127
27. D. Liu, and H. Teng An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles European Journal of Operational Research 112 1999 413 420
28. A. Lodi, S. Martello, and D. Vigo Approximation algorithms for the oriented two-dimensional bin packing problem European Journal of Operational Research 112 1999 158 166
29. A. Lodi, S. Martello, and D. Vigo Heuristic algorithms for the three-dimensional bin packing problem European Journal of Operational Research 141 2002 410 420
30. A. Lodi, S. Martello, and D. Vigo TSpack: a unified tabu search code for multi-dimensional bin packing problems Annals of Operations Research 131 2004 203 213
31. D. Mack, and A. Bortfeldt A heuristic for solving large bin packing problems in two and three dimensions Central European Journal of Operations Research 20 2 2012 337 354
32. S. Martello, D. Pisinger, and D. Vigo The three-dimensional bin packing problem Operations Research 48 2000 256 267
33. S. Martello, D. Pisinger, D. Vigo, E. Boef, and J. Korst Algorithm 864 general and robot-packable variants of the three-dimensional bin packing problem ACM Transactions on Mathematical Software 33 2007 7:1 7:12
34. S. Martello, and D. Vigo Exact solution of the two-dimensional finite bin packing problem Management Science 44 1998 388 399
35. M. Monaci, and P. Toth A set-covering-based heuristic approach for bin-packing problems INFORMS Journal on Computing 18 2006 71 85
36. K. Park, K. Lee, S. Park, and S. Kim Modeling and solving the spatial block scheduling problem in a shipbuilding company Computers and Industrial Engineering 30 1996 357 364
37. F. Parreño, R. Alvarez-Valdes, J. Oliveira, and J. Tamarit A hybrid GRASP/VND algorithm for two-and three-dimensional bin packing Annals of Operations Research 179 2010 203 220
38. Spears, W., Dejong, K., 1991. On the virtues of parameterized uniform crossover. In: Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 230-236.
39. G. Wäscher, H. Haussner, and H. Schumann An improved typology of cutting and packing problems European Journal of Operational Research 183 2007 1109 1130