A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem

European Journal of Operational Research

Volumn 183, Issue 3, 2007, Pages 1212-1229

  Gonçalves, José Fernando ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

Cutting; Genetic algorithms; Orthogonal packing; Packing

Indexed keywords

COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; RANDOM PROCESSES;

ORTHOGONAL PACKING; TRIM LOSS;

OPERATIONS RESEARCH;

EID: 34447106676     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.11.062     Document Type: Article

References (33)

1. Bean J.C. Genetics and random keys for sequencing and optimization. ORSA Journal on Computing 6 (1994) 154-160
2. Beasley J.E. An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research 33 (1985) 49-64
3. Beasley D., Bull D.R., and Martin R.R. An overview of genetic algorithms: Part 1, fundamentals. University Computing 15 (1993) 58-69
4. Christofides N. An exact algorithm for general, orthogonal two-dimensional knapsack problems. European Journal of Operational Research 83 (1995) 39-56
5. Christofides N., and Whitlock C. An algorithm for two dimensional cutting problems. Operations Research 25 (1977) 31-44
6. Dowsland K.A. Some experiments with simulated annealing techniques for packing problems. European Journal of Operational Research 68 (1993) 389-399
7. Dowsland K.A. Genetic algorithms - a tool for OR?. Journal of the Operational Research Society 47 (1996) 550-561
8. Fekete S.P., and Schepers J. A new exact algorithm for general orthogonal d-dimensional knapsack problems. Springer Lecture Notes in Computer Science 1284 (1997) 144-156
9. Glover F., Kelly J.P., and Laguna M. Genetic algorithms and tabu search: Hybrids for optimization. Computers and Operations Research 22 (1995) 111-134
10. Goldberg D.E. Genetic Algorithms in Search Optimization and Machine Learning (1989), Addison-Wesley
11. Gonçalves J.F., and Almeida J.R. A hybrid genetic algorithm for assembly line balancing. Journal of Heuristics 8 (2002) 629-642
12. Gonçalves J.F., and Resende M.G.C. An evolutionary algorithm for manufacturing cell formation. Computers and Industrial Engineering 47 (2004) 247-273
13. Gonçalves J.F., Mendes J.J.M., and Resende M.G.C. A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research 167 (2005) 77-95
14. Hadjiconstantinou E., and Christofides N. An exact algorithm for general, orthogonal, two dimensional knapsack problems. European Journal of Operations Research 83 (1995) 39-56
15. Hãssler R.W., and Sweeney P.E. Cutting stock problems and solution procedures. European Journal of Operational Research 54 (1991) 141-150
16. Hifi M., and Zissimopoulos V. Exact algorithms for the guillotine strip cutting/packing problem. Computers and Operations Research 25 (1998) 925-940
17. Hinxman A.I. The trim loss and assortment problems. European Journal of Operational Research 88 (1980) 8-18
18. Holland J.H. Adaptation in Natural and Artificial Systems (1975), The University of Michigan Press, Ann Arbor, Michigan
19. Hopper E., and Turton B.C.H. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research 128 (2000) 34-57
20. Hopper E., and Turton B.C.H. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research 128 (2001) 34-57
21. Jakobs S. On genetic algorithms for the packing of polygons. European Journal of Operational Research 88 (1996) 165-181
22. Lai K.K., and Chan W.M. An evolutionary algorithm for the rectangular cutting stock problem. International Journal of Industrial Engineering 4 (1997) 130-139
23. Leung, T.W., Chan, C.K., Troutt, M., 2000. Comparison of meta-heuristics for the two dimensional orthogonal packing problem. Working Paper, Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong.
24. Leung T.W., Chan C.K., and Troutt M.D. Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem. European Journal of Operational Research 141 (2003) 241-252
25. Lodi A., Martello S., and Monaci M. Two-dimensional packing problems: A survey. European Journal of Operational Research 141 (2002) 241-252
26. Oliveira, J.F., 2004. A computational evaluation of Wang's algorithm and its variants for the 2D constrained rectangular cutting problem. Presented at the EURO XX Conference, Rhodes, 4-7 July.
27. Parada V., Sepulveda M., Solar M., and Gomes A. Solution for constrained guillotine cutting problem by simulated annealing. Computers and Operations Research 25 (1998) 37-47
28. Parreño, F. 2004. Algoritmos heurísticos y exactos para problemas de corte no guillotina en dos dimensiones, Ph.D. thesis.
29. Sarin S.C. Two-dimensional stock cutting problems and solution methodologies. ASME Transactions Journal of Engineering for Industry 104 (1983) 155-160
30. Spears, W.M., Dejong, K.A., 1991. On the virtues of parameterized uniform crossover. In: Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 230-236.
31. Tsai R.D. Three dimensional palletization of mixed box sizes. IIE Transactions 25 (1993) 64-75
32. Wang P.Y. Two algorithms for constrained two-dimensional cutting stock problems. Operations Research 31 (1983) 573-586
33. Wäscher, G., Haussner, H., Schumann, H., this issue. An Improved Typology of Cutting and Packing Problems. European Journal of Operational Research.