Abstract
The two-dimensional layout optimization problem consists of finding the minimal length layout of a set of irregular two dimensional shapes on a stock sheet of finite width but infinite length. The layout should not contain any overlaps. The present paper solves this problem using a novice heuristic based on GA. The proposed heuristic uses a simple codification scheme, and a new placement strategy. The application of this heuristic yields, in reduced computational times, satisfactory results, that are comparable to those obtained by human markers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adamowicz, M., Albano, A.: Nesting Two Dimensional Shapes in Rectangular Modules. Computer Aided Design 8 (1976) 27–33.
Bounsaythip, C., Maouche, S.: A Genetic Approach to a Nesting Problem. Proc. of the 2NWGA, Vaasa, Finland, (1996) 89–104.
Cheng, C. H., Feiring, B. R., Cheng, T. C. E.: The Cutting Stock Problem-A Survey. Int. J. of Prod. Econ. 36 (1994) 291–305.
Dighe, R., Jakiela, M. J.: Solving Pattern Nesting Problems with GA Employing Task Decomposition and Contact Detection. Evolutionary Computation 3 (1996) 239–266.
Dori, D., Ben-Bassat, M.: Circumscribing a Convex Polygon by a Polygon of Fewer Sides with Minimal Area Addition. Computer Vision, Graphics and Image Processing 24 (1983) 131–159.
Dowsland, K. A., Dowsland, W.: Solution Approaches to Irregular Nesting Problems. Eur. J. of Oper. Res. 84 (1995) 506–521.
Dyckhoff, H., Finke, U.: Cutting and Packing in Production and Distribution, a Typology and Bibliography. Physica Verlag, Wurzkurg (1992).
Fujita, K., Akagi, S., Hirokawa, N.: Hybrid Approach for Optimal Nesting Using a Genetic Algorithm and a Local Minimization Algorithm. Proceedings of the ASME Conferences on Advances in Design and Automation 65 (1993) 477–484.
Grinde, R. B.: Applying Minimal Enclosure Tools to the Pattern Layout Problem. Working paper, University of New Hampshire (1996).
Hopper, R., Turton, B. C. H.: An Empirical Investigation of Meta-heuristics and Heuristic Algorithms for a 2D Packing Problem. Eur. J. of Oper. Res., to appear.
Li, Z., Milenkovic, V.: Compaction and Separation Algorithms for Non-Convex Polygons and Their Applications. Eur. J. of Oper. Res. 84 (1995) 539–561.
Milenkovic, Z., Daniels, K., Li, Z.: Automatic Maker Making. Proc. of the 3rd Canadian Conf. on Comp. Geometry, Simon Fraser University, Vancouver, Shermer, T., Ed. (1991) 243–246.
Poshyanonda, P., Dagli, C. H.: A Hybrid Approach to Composite Stock Cutting: Neural Networks and Genetic Algorithms. In: Jamshidi, M., Lumia, R., Mullins, J., Shahinpoor, M. (eds.): Robotics and Manufacturing: Recent Trends in Research, Education, and Applications 4 (1992).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
M’hallah, R., Bouziri, A., Jilani, W. (2001). Layout of Two Dimensional Irregular Shapes Using Genetic Algorithms. In: Monostori, L., Váncza, J., Ali, M. (eds) Engineering of Intelligent Systems. IEA/AIE 2001. Lecture Notes in Computer Science(), vol 2070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45517-5_45
Download citation
DOI: https://doi.org/10.1007/3-540-45517-5_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42219-8
Online ISBN: 978-3-540-45517-2
eBook Packages: Springer Book Archive