A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem

INFORMS Journal on Computing

Volumn 21, Issue 3, 2009, Pages 505-516

  Burke, Edmund K ^a   Kendall, Graham ^a   Whitwell, Glenn ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Heuristics; Industries; Manufacturing; Simulated annealing; Stock cutting

Indexed keywords

EID: 68749119530     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1080.0306     Document Type: Article

References (35)

1. Baker B. S., E. G. Coffman Jr., R. L. Rivest. 1980. Orthogonal packing in two dimensions. SIAM J. Comput. 9(4) 846-855.
2. Belov G., G. Scheithauer. 2006. A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. Eur. J. Oper. Res. 171(1) 85-106.
3. Bennell J. A., X. Song. 2008. A comprehensive and robust procedure for obtaining the no-fit polygon using Minkowski sums. Comput. Oper. Res. 35(1) 267-281.
4. Bennell J. A., K. A. Dowsland, W. B. Dowsland. 2001. The irregular cutting-stock problem-A new procedure for deriving the nofit polygon. Comput. Oper. Res. 28(3) 271-287.
5. Burke E. K., G. Kendall. 1999. A comparison of meta-heuristic algorithms for clustering rectangles. Comput. Indust. Engrg. 37(1-2) 383-386.
6. Burke E. K., G. Kendall, G. Whitwell. 2004. A new placement heuristic for the orthogonal stock cutting problem. Oper. Res. 52(4) 655-671.
7. Burke E. K., R. S. R. Hellier, G. Kendall, G. Whitwell. 2006. A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem. Oper. Res. 54(3) 587-601.
8. Burke E. K., R. S. R. Hellier, G. Kendall, G. Whitwell. 2007. Complete and robust no-fit polygon generation for the irregular stock cutting problem. Eur. J. Oper. Res. 179(1) 27-49.
9. Coffman Jr., E. G., F. T. Leighton. 1989. A provably efficient algorithm for dynamic storage allocation. J. Comput. System Sci. 38(1) 2-35.
10. Coffman Jr., E. G., M. R. Garey, D. S. Johnson. 1978. An application of bin packing to multiprocessor scheduling. SIAM Comput. 7(1) 1-17.
11. Coffman Jr., E. G., M. R. Garey, D. S. Johnson. 1984. Approximation algorithms for bin packing-An updated survey. Algorithm Design for Computer Systems Design. Springer-Verlag, Berlin, 49-106.
12. Dagli C. H., A. Hajakbari. 1990. Simulated annealing approach for solving stock cutting problem. Proc. IEEE Internat. Conf. Systems, Man, Cybernetics, Los Angeles, IEEE, Washington, DC, 221-223.
13. Dagli C. H., P. Poshyanonda. 1997. New approaches to nesting rectangular patterns. J. Intelligent Manufacturing 3(3) 177-190.
14. Dowsland K. A., W. B. Dowsland. 1992. Packing problems. Eur. J. Oper. Res. 56(1) 2-14.
15. Dyckhoff H. 1990. A typology of cutting and packing problems. Eur. J. Oper. Res. 44(2) 145-159.
16. Garey M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco.
17. Garey M. R., D. S. Johnson. 1981. Approximation algorithms for bin packing problems: A survey. D. Ausiello, M. Lucertini, eds. Analysis and Design of Algorithms in Combinatorial Optimization. CISM Courses and Lectures, Vol. 266. Springer, Vienna, 147-172.
18. Gilmore P. C. 1966. The cutting stock problem. Proc. IBM Sci. Comput. Sympos. Combin. Problems. IBM Data Procesing Division, White Plains, NY, 211-224.
19. Gilmore P. C., R. E. Gomory. 1961. A linear programming approach to the cutting stock problem. Oper. Res. 9(6) 849-859.
20. Golden B. L. 1976. Approaches to the cutting stock problem. IIE Trans. 8(2) 265-274.
21. Hopper E., B. C. H. Turton. 1999. A genetic algorithm for a 2D industrial packing problem. Comput. Indust. Engrg. 37(1-2) 375-378.
22. Hopper E., B. C. H. Turton. 2001. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. Eur. J. Oper. Res. 128(1) 34-57.
23. Hower W., M. Rosendahl, D. Köstner. 1996. Evolutionary Algorithm Design. Artificial Intelligence in Design '96. Kluwer Academic Publishers, Dordrecht, The Netherlands, 663-680.
24. Iori M., S. Martello, M. Monaci. 2003. Metaheuristic algorithms for the strip packing problem. P. M. Pardalos, V. Korotkikh, eds. Optimization and Industry: New Frontiers. Kluwer Academic Publishers, Boston, 159-179.
25. Jakobs S. 1996. On genetic algorithms for the packing of polygons. Eur. J. Oper. Res. 88(1) 165-181.
26. Lai K. K., J. W. M. Chan. 1996. Developing a simulated annealing algorithm for the cutting stock problem. Comput. Indust. Engrg. 32(1) 115-127.
27. Li Z., V. Milenkovic. 1995. Compaction and separation algorithms for non-convex polygons and their applications. Eur. J. Oper. Res. 84(3) 539-561.
28. Lodi A., S. Martello, M. Monaci. 2002. Two-dimensional packing problems: A survey. Eur. J. Oper. Res. 141(2) 241-252.
29. Paull A. E. 1956. Linear programming: A key to optimum newsprint production. Pulp Paper Magazine Canada 57 85-90.
30. Ramesh Babu A., N. Ramesh Babu. 1999. Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms. Internat. J. Productions Res. 37(7) 1625-1643.
31. Roberts S. A. 1984. Application of heuristic techniques to the cutting stock problem for worktops. J. Oper. Res. Soc. 35(5) 369-377.
32. Smith D. 1985. Bin packing with adaptive search. Proc. 1st Internat. Conf. Genetic Algorithms Appl., Lawrence Erlbaum Associates, Hillsdale, NJ, 202-207.
33. Stoyan Y., G. Scheithauer, D. Pridatko, T. Romanova, N. Gil. 2002. Phi-functions for primary 3D-objects. Technical Report MATH-NM-15-2002, Technical University of Dresden, Dresden, Germany.
34. Sweeney P. E., E. R. Paternoster. 1992. Cutting and packing problems: A categorized application-orientated research bibliography. J. Oper. Res. Soc. 43(7) 691-706.
35. Valenzuela C. L., P. Y. Wang. 2001. Heuristics for large strip packing problems with guillotine patterns: An empirical study. Proc. 4th Metaheuristics Internat. Conf., (MIC'2001), Porto, Portugal, 417-421.