A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem

Operations Research

Volumn 54, Issue 3, 2006, Pages 587-601

  Burke, Edmund ^a   Hellier, Robert ^a   Kendall, Graham ^a   Whitwell, Glenn ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Approximations heuristic; Artificial intelligence; Computers computer science; Cutting stock trim; Production scheduling; Search production scheduling

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BENCHMARKING; OPERATIONS RESEARCH; PROBLEM SOLVING; SCHEDULING;

APPROXIMATIONS/HEURISTIC; COMPUTERS/COMPUTER SCIENCE; CUTTING-STOCK/TRIM; PRODUCTION/SCHEDULING; SEARCH PRODUCTION/SCHEDULING;

HEURISTIC PROGRAMMING;

EID: 33744788405     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1060.0293     Document Type: Article

References (39)

1. Agarwal, P. K., E. Flato, D. Halperin. 2002. Polygon decomposition for efficient construction of Minkowski sums. Comput. Geometry: Theory Appl. 21 39-61.
2. Albano, A., G. Sapuppo. 1980. Optimal allocation of two-dimensional irregular shapes using heuristic search methods. IEEE Trans. Systems, Man Cybernetics SMC-10 242-248.
3. Art, R. C. 1966. An approach to the two-dimensional irregular cutting stock problem. Technical report 36.008, IBM Cambridge Centre.
4. Avnaim, F., J. D. Boissonnat. 1987. Simultaneous containment of several polygons. Proc. 3rd Annual ACM Sympos. Comput. Geometry. Waterloo, Ontario, Canada, 242-250.
5. Baker, B. S., E. G. Coffman, R. L. Rivest. 1980. Orthogonal packings in two dimensions. SIAM J. Comput. 9(4) 846-855.
6. Bennell, J. A., K. A. Dowsland, W. B. Dowsland. 2001. The irregular cutting-stock problem - A new procedure for deriving the no-fit polygon. Comput. Oper. Res. 28 271-287.
7. Bischoff, E., M. Ratcliff. 1995. Load multiple pallets. Working paper, European Business Management School, University College of Swansea, Swansea, UK.
8. Blazewicz, J., P. Hawryluk, R. Walkowiak. 1993. Using a tabu search approach for solving the two-dimensional irregular cutting problem. F. Glover, M. Laguna, E. Taillard, D. De Werra, eds. Tabu Search. Annals of Operations Research, Vol. 41. J.C. Baltzer AG, Science Publishers, Basel, Switzerland, 313-325.
9. Bounsaythip, C., S. Maouche. 1997. Irregular shape nesting and placing with evolutionary approach. Proc. IEEE Internat. Conf. Systems, Man Cybernetics 4 3425-3430.
10. Burke, E. K. B., G. Kendall, G. Whitwell. 2004. A new placement heuristic for the orthogonal stock cutting problem. Oper. Res. 52(4) 655-671.
11. Daniels, K. M., V. J. Milenkovic. 1997. Multiple translational containment. Part 1: An approximation algorithm. Algorithmica 19(Special Issue on Computational Geometry in Manufacturing) 148-182.
12. Dighe, R., M. J. Jakiela. 1996. Solving pattern nesting problems with genetic algorithms employing task decomposition and contact detection. Evolutionary Comput. 3 239-266.
13. Dowsland, K. A., W. B. Dowsland. 1993. Heuristic approaches to irregular cutting problems. Working paper, EBMS/1993/13, European Business Management School, University College of Swansea, Swansea, UK.
14. Dowsland, K. A., W. B. Dowsland. 1995. Solution approaches to irregular nesting problems. Eur. J. Oper. Res. 84 506-521.
15. Flato, E., D. Halperin. 2000. Robust and efficient construction of planar Minkowski sums. Proc. 16th Eur. Workshop Comput. Geometry. Eilat, Israel, 85-88.
16. Fujita, K., S. Akagi, N. Hirokawa. 1993. Hybrid approach for optimal nesting using a genetic algorithm and a local minimization algorithm. Proc. 1993 ASME Design Automation Conf. DE Vol. 65, Part 1. ASME, Albuquerque, NM, 477-484.
17. Gilmore, P. C., R. E. Gomory. 1961. A linear programming approach to the cutting stock problem. Oper. Res. 9 849-859.
18. Glover, F., E. Taillard, D. De Werra. 1993. A user's guide to tabu search. F. Glover, M. Laguna, E. Taillard, D. De Werra, eds. Tabu Search. Annals of Operations Research, Vol. 41. J.C. Baltzer AG, Science Publishers, Basel, Switzerland, 3-28.
19. Gomes, A. M., J. F. Oliveira. 2002. A 2-exchange heuristic for nesting problems. Eur. J. Oper. Res. 141 359-370.
20. Goodrich, M. T., L. J. Guibas, J. Hershberger, P. J. Tanenbaum. 1997. Snap rounding line segments efficiently in two and three dimensions. Proc. 13th Sympos. Comput. Geometry, Nice, France, 284-293.
21. Guibas, L. J., D. H. Marimont. 1995. Rounding arrangements dynamically. 11th Annual ACM Sympos. Comput. Geometry. Vancouver, British Columbia, Canada, 190-199.
22. Halperin, D., E. Packer. 2002. Iterated snap rounding. Comput. Geometry: Theory Appl. 23(2) 209-225.
23. Hopper, E. 2000, Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods. Ph.D. thesis, University of Wales, Cardiff, UK.
24. 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 34-57.
25. Jakobs, S. 1996. On genetic algorithms for the packing of polygons. Eur. J. Oper. Res. 88 165-181.
26. Konopasek, M. 1981. Mathematical treatments of some apparel marking and cutting problems. U.S. Department of Commerce Report 99-26-90857-10, U.S. Department of Commerce, Washington, DC.
27. Li, Z., V. J. Milenkovic. 1995. Compaction and separation algorithms for non-convex polygons and their application. Eur. J. Oper. Res. 84 539-561.
28. Mahadevan, A. 1984. Optimisation in computer aided pattern packing. Ph.D. thesis, North Carolina State University, Raleigh, NC.
29. Marques, V. M. M., C. F. G. Bispo, J. J. S. Sentieiro. 1991. A system for the compaction of two-dimensional irregular shapes based on simulated annealing. Proc. 1991 Internat. Conf. Indust. Electronics, Control and Instrumentation - IECON'91, Vol. 3. Kobe, Japan, 1911-1916.
30. Milenkovic, V. J. 2000. Shortest path geometric rounding. Algorithmica 27(1) 57-86.
31. Oliveira, J. F., J. S. Ferreira. 1993. Algorithms for nesting problems. Rene V. V. Vidal, ed. Applied Simulated Annealing, Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, Berlin, Germany, 255-273.
32. Oliveira, J. F., A. M. Gomes, J. S. Ferreira. 2000. A new constructive algorithm for nesting problems. OR Spektrum 22 263-284.
33. O'Rourke, J. 1998. Computation Geometry in C, 2nd ed. Cambridge University Press, Cambridge, UK.
34. Ratanapan, K., C. H. Dagli. 1997. An object-based evolutionary algorithm for solving irregular nesting problems. Proc. Artificial Neural Networks in Engrg. Conf. (ANNIE'97), Vol. 7. ASME Press, New York, 383-388.
35. Smith, D. 1985. Bin packing with adaptive search. Proc. First Internat. Conf. Genetic Algorithms Appl. Lawrence Erlbaum Associates, Hillsdale, NJ, 202-207.
36. Stoyan, Y. G., G. N. Yaskov. 1998. Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints. Internat. Trans. Oper. Res. 5(1) 45-57.
37. Stoyan, Y. G., M. V. Novozhilova, A. V. Kartashov. 1996. Mathematical model and method of searching for a local extremum for the non convex oriented polygons allocation problem. Eur. J. Oper. Res. 92 193-210.
38. Stoyan, Y., G. Scheithauer, N. Gil, T. Romanova. 2004. Phi-functions for complex 2D-objects. 40R: Quart. J. Oper. Res. 2(1) 69-84.
39. Sweeny, P. E., E. R. Paternoster. 1992. Cutting and packing problems: A categorized application oriented research bibliography. J. Oper. Res. Soc. 43(7) 691-706.