A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem

Journal of Combinatorial Optimization

Volumn 22, Issue 2, 2011, Pages 180-201

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

^a LIAAD INSEC   (Portugal)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Cutting; Genetic algorithm; Non guillotine cutting; Packing; Two dimensional cutting; Two dimensional packing

Indexed keywords

FITNESS FUNCTIONS; MULTI-POPULATION GENETIC ALGORITHM; NON-GUILLOTINE CUTTING; PACKING PROBLEMS; RANDOM KEYS; TWO-DIMENSIONAL CUTTING; TWO-DIMENSIONAL PACKING;

GENETIC ALGORITHMS; GEOMETRY;

TWO DIMENSIONAL;

EID: 79958083453     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-009-9282-1     Document Type: Article

References (47)

1. R Alvarez-Valdes F Parreño J Tamarit 2005 A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems J Oper Res Soc 56 414 425 10.1057/palgrave.jors.2601829 (Pubitemid 40424117)
2. R Alvarez-Valdes F Parreño J Tamarit 2007 A tabu search algorithm for a two-dimensional non-guillotine cutting problem Eur J Oper Res 183 1167 1182 10.1016/j.ejor.2005.11.068 (Pubitemid 47030734)
3. Amaral A, Letchford AN (2001) An improved upper bound for the two-dimensional non-guillotine cutting problem. Technical report, Lancaster University, UK. Available online at http://www.lancs.ac.uk/staff/letchfoa/ngc. doc
4. M Arenales R Morabito 1995 An and/or-graph approach to the solution of two dimensional guillotine cutting problems Eur J Oper Res 84 599 617 10.1016/0377-2217(95)00026-M
5. JC Bean 1994 Genetics and random keys for sequencing and optimization ORSA J Comput 6 154 160
6. JE Beasley 1985 An exact two-dimensional non-guillotine cutting tree search procedure Oper Res 33 49 64 10.1287/opre.33.1.49 (Pubitemid 15475049)
7. JE Beasley 2004 A population heuristic for constrained two-dimensional non-guillotine cutting Eur J Oper Res 156 601 627 10.1016/S0377-2217(03)00139-5
8. MA Boschetti E Hadjiconstantinou A Mingozzi 2002 New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem IMA J Manag Math 13 95 119 10.1093/imaman/13.2.95
9. LS Buriol MGC Resende CC Ribeiro M Thorup 2005 A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing Networks 46 36 56 10.1002/net.20070 (Pubitemid 41092975)
10. LS Buriol MGC Resende M Thorup 2007 Survivable IP network design with OSPF routing Networks 49 51 64 10.1002/net.20141 (Pubitemid 46478316)
11. A Caprara M Monaci 2004 On the 2-dimensional knapsack problem Oper Res Lett 32 5 14 10.1016/S0167-6377(03)00057-9
12. N Christofides C Whitlock 1977 An algorithm for two dimensional cutting problems Oper Res 25 31 44 10.1287/opre.25.1.30
13. KA Dowsland WB Dowsland 1992 Packing problems Eur J Oper Res 56 2 14 10.1016/0377-2217(92)90288-K
14. H Dyckhoff 1990 A typology of cutting and packing problems Eur J Oper Res 44 145 159 10.1016/0377-2217(90)90350-K (Pubitemid 20648276)
15. M Ericsson MGC Resende PM Pardalos 2002 A genetic algorithm for the weight setting problem in OSPF routing J Combin Optim 6 299 333 10.1023/A:1014852026591 (Pubitemid 34474871)
16. Fekete S, Schepers J (1997a) A new exact algorithm for general orthogonal d-dimensional knapsack problems. In: Algorithms-ESA '97. Springer lecture notes in computer science, vol 1284. Springer, Berlin, pp 144-156 (Pubitemid 127119226)
17. Fekete SP, Schepers J (1997b) On higher-dimensional packing I: Modeling. Technical Report ZPR 97-288, Mathematisches Institut, Universitat zu Köln
18. Fekete SP, Schepers J (1997c) On higher-dimensional packing II: Bounds. Technical Report ZPR97-289, Mathematisches Institut, Universitat zu Köln
19. SP Fekete J Schepers 2004 A combinatorial characterization of higher-dimensional orthogonal packing Math Oper Res 29 353 368 10.1287/moor.1030.0079
20. SP Fekete J Schepers 2004 A general framework for bounds for higher-dimensional orthogonal packing problems Math Methods Oper Res 60 311 329 10.1007/s001860400376
21. Fekete SP, Schepers J (2004c) An exact algorithm for higher-dimensional orthogonal packing. Technical report, Mathematisches Institut, Universitat zu Köln. Working paper. Available online at http://www.math.tu-bs.de/~fekete
22. TA Feo MGC Resende 1989 A probabilistic heuristic for a computationally difficult set covering problem Oper Res Lett 8 67 71 10.1016/0167-6377(89)90002- 3
23. TA Feo MGC Resende 1995 Greedy randomized adaptive search procedures J Glob Optim 6 109 133 10.1007/BF01096763
24. Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York
25. Goldberg D (1989) Genetic algorithms in search optimization and machine learning. Addison-Wesley, Reading
26. JF Gonçalves 2007 A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem Eur J Oper Res 183 1212 1229 10.1016/j.ejor.2005.11.062 (Pubitemid 47030736)
27. JF Gonçalves JR Almeida 2002 A hybrid genetic algorithm for assembly line balancing J Heuristics 8 629 642 10.1023/A:1020377910258 (Pubitemid 35338030)
28. JF Gonçalves MGC Resende 2004 An evolutionary algorithm for manufacturing cell formation Comput Ind Eng 47 247 273 10.1016/j.cie.2004.07.003
29. Gonçalves JF, Resende MGC (2009) Biased random key genetic algorithms for combinatorial optimization. Technical report, AT&T Labs Research Technical Report, Florham Park, NJ 07733 USA
30. JF Gonçalves JJM Mendes MGC Resende 2005 A hybrid genetic algorithm for the job shop scheduling problem Eur J Oper Res 167 77 95 10.1016/j.ejor.2004.03.012 (Pubitemid 40220004)
31. E Hadjiconstantinou N Christofides 1995 An exact algorithm for general, orthogonal, two dimensional knapsack problems Eur J Oper Res 83 39 56 10.1016/0377-2217(93)E0278-6
32. E Hadjiconstantinou M Iori 2007 A hybrid genetic algorithm for the two-dimensional knapsack problem Eur J Oper Res 183 1150 1166 10.1016/j.ejor.2005.11.061 (Pubitemid 47030733)
33. RW Haessler PE Sweeney 1991 Cutting stock problems and solution procedures Eur J Oper Res 54 141 150 10.1016/0377-2217(91)90293-5 (Pubitemid 21729727)
34. P Healy M Creavin A Kuusik 1999 An optimal algorithm for rectangle placement Oper Res Lett 24 73 80 10.1016/S0167-6377(98)00048-0
35. E Hopper BCH Turton 2001 An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem Eur J Oper Res 128 34 57 10.1016/S0377-2217(99)00357-4 (Pubitemid 32022961)
36. S Jakobs 1996 On genetic algorithms for the packing of polygons Eur J Oper Res 88 165 181 10.1016/0377-2217(94)00166-9 (Pubitemid 126367100)
37. KK Lai JWM Chan 1997 An evolutionary algorithm for the rectangular cutting stock problem Int J Ind Eng 4 130 139 (Pubitemid 127662152)
38. KK Lai JWM Chan 1997 Developing a simulated annealing algorithm for the cutting stock problem Comput Ind Eng 32 115 127 10.1016/S0360-8352(96)00205-7 (Pubitemid 127422474)
39. TW Leung CK Chan MD Troutt 2001 Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem Comput Ind Eng 40 201 214 10.1016/S0360-8352(01)00021-3 (Pubitemid 32573624)
40. TW Leung CK Chan MD Troutt 2003 Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem Eur J Oper Res 141 241 252
41. D Liu H Teng 1999 An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles Eur J Oper Res 112 413 420 10.1016/S0377- 2217(97)00437-2
42. G Scheithauer J Terno 1993 Modeling of packing problems Optimization 28 63 84 10.1080/02331939308843904
43. Spears WM, Dejong KA (1991) On the virtues of parameterized uniform crossover. In: Proceedings of the fourth international conference on genetic algorithms, pp 230-236
44. PE Sweeney ER Paternoster 1992 Cutting and packing problems: A categorized, application-orientated research bibliography J Oper Res Soc 43 691 706
45. RD Tsai EM Malstrom HD Meeks 1988 A two-dimensional palletizing procedure for warehouse loading operations IIE Trans 20 418 425 10.1080/07408178808966200
46. PY Wang 1983 Two algorithms for constrained two-dimensional cutting stock problems Oper Res 31 573 586 10.1287/opre.31.3.573 (Pubitemid 13576744)
47. G Wäscher H Haussner H Schumann 2007 An improved typology of cutting and packing problems Eur J Oper Res 183 1109 1130 10.1016/j.ejor.2005.12.047 (Pubitemid 47030730)