Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming

European Journal of Operational Research

Volumn 171, Issue 3, 2006, Pages 811-829

  Gomes, A Miguel ^a,b   Oliveira, José F ^a,b  

^a UNIVERSITY OF PORTO   (Portugal)

^b INESC   (Portugal)

Author keywords

Cutting; Irregular Strip Packing; Nesting; Packing; Simulated annealing

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATION THEORY; CUTTING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PACKING; PROBLEM SOLVING;

HYBRIDIZING SIMULATED ANNEALING; IRREGULAR STRIP PACKING; NESTING; SEPARATION ALGORITHMS;

SIMULATED ANNEALING;

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

References (27)

1. Art Jr., R.C., 1966. An approach to the two-dimensional, irregular cutting stock problem. Technical Report 36.Y08, IBM Cambridge Scientific Centre.
2. J.A. Bennell, and K.A. Dowsland A tabu thresholding implementation for the irregular stock cutting problem International Journal of Production Research 37 18 1999 4259 4275
3. J.A. Bennell, and K.A. Dowsland Hybridising tabu search with optimisation techniques for irregular stock cutting Management Science 47 8 2001 1160 1172
4. J.A. Bennell, K.A. Dowsland, and W.B. Dowsland The irregular cutting-stock problem-a new procedure for deriving the no-fit polygon Computers and Operations Research 28 3 2001 271 287
5. J. Błażewicz, A. Moret-Salvador, and R. Walkowiak Parallel tabu search approaches for two-dimensional cutting Parallel Processing Letters 14 1 2004 23 32
6. J. Błażewicz, and R. Walkowiak A local search approach for two-dimensional irregular cutting OR Spektrum 17 1995 93 98
7. K. Daniels, and V. Milenkovic Column-based strip packing using ordered and compliant containment Selected papers from the Workshop on Applied Computational Geometry, Towards Geometric Engineering Lecture Notes in Computer Science 1996 Springer-Verlag Berlin 91 107
8. K.A. Dowsland, and W.B. Dowsland Solution approaches to irregular nesting problems European Journal of Operational Research 84 3 1995 506 521
9. K.A. Dowsland, W.B. Dowsland, and J.A. Bennell Jostling for position: Local improvement for irregular cutting patterns Journal of the Operational Research Society 49 6 1998 647 658
10. H. Dyckhoff, H.-J. Kruse, D. Abel, and T. Gal Classification of real world trim loss problems G. Fandel H. Dyckhoff J. Reese Essays on Production Theory and Planning 1988 Springer-Verlag 191 208 chapter 12
11. K. Fujita, S. Akagi, and N. Kirokawa Hybrid approach for optimal nesting using a genetic algorithm and a local minimization algorithm Proceedings of the 19th Annual ASME Design Automation Conference, Albuquerque, NM, 19-22 September 1993 vol. 1 1993 ASME New York 477 484
12. Gomes, A.M., Oliveira, J.F., 1999. Nesting irregular shapes with simulated annealing. In: Proceedings of 3rd Metaheuristics International Conference, Angra dos Reis, Rio de Janeiro, Brazil, 19-23 July, pp. 235-239.
13. Gomes, A.M., Oliveira, J.F., 2001. A GRASP approach to nesting problems. In: Proceedings of 4th Metaheuristics International Conference, Porto, Portugal, July 16-20, pp. 47-52.
14. A.M. Gomes, and J.F. Oliveira A 2-exchange heuristic for nesting problems European Journal of Operational Research 141 2 2002 359 370
15. R. Heckmann, and T. Lengauer A simulated annealing approach to the nesting problem in the textile manufacturing industry R.E. Burkard P.L. Hammer T. Ibaraki M. Queyranne Annals of Operations Research volume 57 1995 J.C. Baltzer AG Science Publishers 103 133
16. M. Hifi, and R. M'Hallah A hybrid algorithm for the two-dimensional layout problem: The cases of regular and irregular shapes International Transactions in Operational Research 10 3 2003 195 216
17. Hopper, E., 2000. Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods. Ph.D. Thesis, Cardiff University.
18. S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi Optimization by simulated annealing Science 220 1983 671 680
19. Li, Z., Milenkovic, V.J., 1993. The complexity of the compaction problem. In: Lubiw, L., Urrutia, J. (Eds.), Proceedings of the Fifth Canadian Conference on Computational Geometry, University of Waterloo, Ont., Canada, 5-9 August 1993, pp. 7-11.
20. Z. Li, and V. Milenkovic Compaction and separation algorithms for non-convex polygons and their applications European Journal of Operational Research 84 3 1995 539 561
21. Mahadevan, A., 1984. Optimization in Computer-Aided Pattern Packing. Ph.D. Thesis, North Carolina State University.
22. N. Metropolis, A. Rosenbluth, M.N. Rosenbluth, A.N. Teller, and E. Teller Equation of state calculations by fast computing machines Journal of Chemical Physics 21 1953 1087 1092
23. V.J. Milenkovic, and K. Daniels Translational polygon containment and minimal enclosure using mathematical programming International Transactions in Operational Research 6 5 1999 525 554
24. J.F. Oliveira, A.M. Gomes, and J.S. Ferreira TOPOS-A new constructive algorithm for nesting problems OR Spektrum 22 2 2000 263 284
25. J.F.C. Oliveira, and J.A.S. Ferreira Algorithms for nesting problems R.V.V. Vidal Applied Simulated Annealing Lecture Notes in Economics and Mathematical Systems vol. 396 1993 Springer-Verlag Berlin 255 273
26. M. Pirlot General local search methods European Journal of Opeartional Research 92 3 1996 493 511
27. Y.G. Stoyan, M.V. Novozhilova, and A.V. Kartashov Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem European Journal of Operational Research 92 1 1996 193 210