Abstract
The problem of placing a number of specific shapes in order to minimise material waste is commonly encountered in the sheet metal, clothing and shoe-making industries. It is driven by the demand to find a layout of non-overlapping parts in a set area in order to maximise material utilisation. A corresponding problem is one of compaction, which is to minimise the area that a set number of shapes can be placed without overlapping. This paper presents a novel connectivity based approach to leather part compaction using the no-fit polygon (NFP). The NFP is computed using an image processing method as the boundary of the Minkowski sum, which is the convolution between two shapes at given orientations. These orientations along with shape order and placement selection constitute the chromosome structure.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bounsaythip C, Maouche S. and Neus M. (1995), Evolutionary search techniques: Application to automated lay-planning optimisation problem, IEEE international conference on Systems, Manufacturing and Cybernetics (SMC), Vancouver, Canada, Vol. 5, pp. 4497–4503.
Dowsland, K. A. Dowsland, W. B. (1995), Solution approaches to irregular nesting problems, European Journal of Operations Research, 84, pp. 506–521. Elsevier.
Anand, S. McCord, C. Sharma, R. Balachander, T. (1999), An integrated machine vision based system for solving the non-convex cutting stock problem using genetic algorithms, Journal of Manufacturing Systems, Vol. 18, No. 6, pp. 396–415.
Kahng, A. (2000), Classical Floorplanning Harmful, International Symposium on Physical Design, Proceeding ACM/IEEE, pp. 207–213.
Adamowicz M. and Albano A. (1976), Nesting two-dimensional shapes in rectangular modules, Computer-Aided Design, Vol. 8, No. 1, pp. 27–33.
Burke and Kendall G. (1999), Evaluation of two-dimensional bin packing using the no fit polygon, Computers and Industrial Engineering Conference, Melbourne, Australia.
Cunninghame-Green, R. (1989), Geometry, shoemaking and the milk tray problem, New Scientist, Vol. 12, August, 1677, pp. 50–53.
Ghosh, P.K. (1993), A unified computational framework for Minkowski operations, Computer and graphics, 17(4), pp. 119–144.
Bennell, J.A. Dowsland, K.A. Dowsland, W.B. (2000), The irregular cutting-stock problem-a new procedure for deriving the no-fit polygon, Computers and operations research, Vol. 28, pp. 271–287.
Clay P. and Crispin A. (2001), Automated lay-planning in leather manufacturing, 17th National Conference on Manufacturing Research, September 2001, Cardiff, pp 257–262.
De Berg, M. van Kreveld, M. Overmars, M. Schwarzkopf, O. (1998), Computational Geometry Algorithms and Applications 2nd Ed. Springer Verlag, Berlin, pp. 275–281.
Goldberg, D. E. (1989), Genetic Algorithms in Search, Optimisation and Machine Learning, Addison Wesley, Longman Inc. ISBN 0-020-15767-5
Mitchell, M. (1996), An introduction to Genetic Algorithms, Massachusetts Institute of Technology Press, ISBN 0-262-13316-4.
Clay P., Crispin A. and Crossley S. (2000), Comparative analysis of search methods as applied to shearographic fringe modelling, Proceeding of 13th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, June 2000, New Orleans, pp. 99–108.
Mühlenbein, H. and Schlierkamp-Voosen, D. (1993), Predictive Models for the Breeder Genetic Algorithm, Evolutionary Computation, Vol. 1, No. 1, pp. 25–49.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Crispin, A., Clay, P., Taylor, G., Hackney, R., Bayes, T., Reedman, D. (2002). Genetic Algorithm Optimisation of Part Placement Using a Connection-Based Coding Method. In: Hendtlass, T., Ali, M. (eds) Developments in Applied Artificial Intelligence. IEA/AIE 2002. Lecture Notes in Computer Science(), vol 2358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48035-8_23
Download citation
DOI: https://doi.org/10.1007/3-540-48035-8_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43781-9
Online ISBN: 978-3-540-48035-8
eBook Packages: Springer Book Archive