A vision-based intelligent system for packing 2-D irregular shapes

IEEE Transactions on Automation Science and Engineering

Volumn 4, Issue 3, 2007, Pages 382-394

  Bouganis, Alexandros ^a,b   Shanahan, Murray ^b  

^a IEEE   (United Kingdom)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Mathematical morphology; Nesting; Shape similarity; Turning function; Two dimensional irregular packing problem

Indexed keywords

SHAPE SIMILARITY; TURNING FUNCTION; TWO-DIMENSIONAL IRREGULAR PACKING PROBLEM;

COMPUTER VISION; CUTTING; INDUSTRIAL APPLICATIONS; PROBLEM SOLVING;

INTELLIGENT SYSTEMS;

EID: 34547426003     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2006.887158     Document Type: Article

References (32)

1. P. Whelan and B. Batchelor, "Automated packing systems - a systems engineering approach," IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol. 26, no. 5, pp. 533-544, Sep. 1996.
2. G. Wäscher, H. Haußner, and H. Schumann, "An improved typology of cutting and packing problems," Working Paper 24, Faculty Econ. Manag., Otto von Guericke Univ. Magdeburg, 2006.
3. A. Gomes and J. Oliveira, "Solving irregular strip packing problems by hybridising simulated annealing and linear programming," Eur. J. Oper. Res., vol. 171, pp. 811-829, 2006.
4. E. Hopper and B. Turton, "A review of the application of meta-heuristic algorithms to 2D strip packing problems," Artif. Intell. Rev., vol. 16, pp. 257-300, 2001.
5. J. Oliveira, A. Gomes, and J. Ferreira, "TOPOS - a new constructive algorithm for nesting problems," OR Spectr., vol. 22, pp. 263-284, 2000.
6. R. Fowler, M. Paterson, and S. Tanimoto, "Optimal packing and covering in the plane are NP-complete," Inf. Process. Lett., vol. 12, pp. 133-137, 1981.
7. E. Hopper, "Two-dimensional packing utilizing evolutionary algorithms and other meta-heuristic methods," Ph.D. dissertation, School Eng., Cardiff Univ., Cardiff, U.K., 2000.
8. C. Dagli and P. Poshyanonda, "New approaches to nesting rectangular patterns," J. Intell. Manuf., vol. 8, pp. 177-190, 1997.
9. D. Liu and H. Teng, "An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles," Eur. J. Oper. Res., vol. 112, pp. 413-420, 1999.
10. E. Hopper and B. Turton, "A genetic algorithm for a 2D industrial packing problem," Comput. Eng., vol. 37, pp. 375-378, 1999.
11. A. Albano and G. Sappupo, "Optimal allocation of two-dimensional irregular shapes using heuristic search methods," IEEE Trans. Syst., Man, Cybern., vol. 10, no. 5, pp. 242-248, May 1980.
12. M. Adamowicz and A. Albano, "Nesting two-dimensional shapes in rectangular modules," Comput. Aided Des., vol. 8, pp. 27-33, 1976.
13. S. Jacobs, "On genetic algorithms for the packing of polygons," Eur. J. Oper. Res., vol. 88, pp. 165-181, 1996.
14. H. Lamousin and W. Waggenspack, "Nesting of two-dimensional irregular parts using a shape reasoning heuristic," Comput. Aided Des., vol. 29, pp. 221-238, 1997.
15. B. Nielsen and A. Odgaard, "Fast neighborhood search for the nesting problem," Univ. Copenhagen, Copenhagen, Denmark, 2003, Tech. Rep.
16. O. Faroe, D. Pisinger, and M. Zachariasen, "Guided local search for the three-dimensional bin packing problem," INFORMS J. Comput., vol. 15, pp. 267-283, 2003.
17. A. Gomes and J. Oliveira, "A 2-exchange heuristic for nesting problems," Eur. J. Oper. Res., vol. 141, pp. 359-370, 2002.
18. E. Burke, R. Hellier, G. Kendall, and G. Whitwell, "A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem," Oper. Res., 2006, accepted for publication.
19. F. Preparata and M. Shamos, Computational Geometry: An Introduction. Berlin, Germany: Springer-Verlag, 1985.
20. G. Toussaint, "Solving geometric problems with the 'rotating calipers'," presented at the MELECON, Athens, Greece, 1983.
21. K. Dowsland, S. Vaid, and W. Dowsland, "An algorithm for polygon placement using a bottom-left strategy," Eur. J. Oper. Res., vol. 141, pp. 371-381, 2002.
22. P. Whelan and B. Batchelor, "Flexible packing of arbitrary two-dimensional shapes," Opt. Eng., vol. 32, pp. 3278-3287, 1993.
23. A. Jain, Fundamentals of Digital Image Processing. Englewood Cliffs, NJ: Prentice-Hall, 1989.
24. R. Haralick and L. Shapiro, Computer and Robot Vision. Reading, MA: Addison-Wesley, 1992, vol. 1.
25. J. Serra, Image Analysis and Mathematical Morphology. New York: Academic, 1982.
26. A. Sajjanhar and G. Lu, "A grid based shape indexing and retrieval method," Austral. Comput. J., vol. 29, pp. 131-140, 1997.
27. _, "A comparison of techniques for shape retrieval," in Proc. Int. Conf. Computational Intelligence and Multimedia Applications, 1998, pp. 854-859.
28. D. Zhang and G. Lu, "Content-based shape retrieval using different shape descriptors: a comparative study," in Proc. IEEE Int. Conf. Multimedia and Expo, 2001, pp. 317-320.
29. E. Arkin, L. Chew, D. Huttenlocher, K. Kedem, and J. Mitchell, "An efficiently computable metric for comparing polygonal shapes," IEEE Trans. Pattern Anal. Mach. Intell., vol. 13, no. 3, pp. 209-216, Mar. 1991.
30. B. Mehtre, M. Kankanhalli, and W. Lee, "Shape measures for content based image retrieval: a comparison," Inf. Process. Manag., vol. 33, pp. 319-337, 1997.
31. D. Douglas and T. Peucker, "Algorithms for the reduction of the number of points required to represent a digitised line or its caricature," Can. Cartographer, vol. 10, pp. 112-122, 1973.
32. [Online]. Available: http://www.apdio.pt/sicup/.