Abstract
Efficient packing in a limited space has been a topic of interest in several disciplines such as engineering, management, computer science, and operations research. In these areas, engineers and scientists have been working with various algorithms to reduce the computational complexity, develop complex part overlap detection, and reduce overall computational time over the last 40 years. How to optimally place patterns over a given space is a complex task because the problem is highly non-linear. Current research addresses both of these to some extent. A simple approach on modeling complex 2 dimensional objects as composites combining regular geometries is given. This greatly simplifies the overlap detection for the packing of these objects within a minimum area. Furthermore, since no overlap needs to be calculated between the shapes within a composite area, overall number of overlap detection is also reduced. Several 2 dimensional example problems are used to demonstrate the approach.
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
Coffman Jr. EG, Garey M.R., and Johnson, D.S., “Approximation Algorithm for Bin packing-an updated survey”. In: Ausiello W.G., Lucertini W.G., and Serafini P. (eds.) Algorithm Design for Computer Systems Design, Springer-Verlag, The Netherlands, pp.49–106, 1984.
Jain, P., Fenyes, P., and Richter, R. “Optimal Blank Nesting using Simulated Annealing”, Journal of Mechanical Design-Transactions of the ASME, Vol. 114, No. 1, pp. 160–165, 1992.
Wathen, Abbie, Atiqullah, Mir M., “Circular Part Compaction using Simulated Annealing”, Presented at the MUPEC2000 student conference at Ohio Northern University, April 29, 2000. Presented by Abbie Wathen. Awarded 3rd prize in research category.
Atiqullah, Mir, and S. S. Rao, “Simulated Annealing and Parallel Processing: An Implementation for Global Mechanical Design Optimization”, Engineering Optimization, Vol. 32, pp. 659–685, Gordon and Breech, UK, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Atiqullah, M.M., Crespo, E.M. (2003). A Novel Approach to Optimal Packing Using Composite Object Geometry. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44839-X_29
Download citation
DOI: https://doi.org/10.1007/3-540-44839-X_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40155-1
Online ISBN: 978-3-540-44839-6
eBook Packages: Springer Book Archive