Abstract
We want to fill a given two-dimensional closed contour as accurately as possible with a fixed number of identical, flexible objects. These objects have to be packed sequentially. They adapt themselves to the surface they are packed on, but their deformation can only be simulated. This type of problem is the two-dimensional cross-section of manufacturing processes where soft material is wound onto a mandrel. We formulate this as a problem of dynamic programming with simulated law of motion. It allows an evolutionary algorithm approach that successfully produces approximate solutions in a non-sequential fashion.
Keywords
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
Bertsekas, Dimitri P. Dynamic programming: deterministic and stochastic models Englewood Cliffs, N. J.: Prentice-Hall, 1987.
Dowsland, Kathryn A. and William B. Dowsland Packing Problems Europ. J. Operational Research, 56 (1992), 2–14.
Dowsland, Kathryn A. Some Experiments with Simulated Annealing Techniques for Packing Problems Europ. J. Operational Research, 68 (1993), 389–399.
Scheithauer, G.The Solution of Packing Problems with Pieces of Variable Length and Additional Allocation Constraints Optimization, 34 (1995), 81–86.
Z. Michalewicz. Genetic Algorithms + Data Structures = Evolutionary Programs. Springer Verlag, 1992.
T. J. Reinhart. Composites. Engineered materials handbook, ASM International /Handbook Committee, Metals Park, Ohio: ASM International, 1988.
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
Behnke, H., Kolonko, M., Mertins, U., Schnitter, S. (2001). Optimization and Simulation: Sequential Packing of Flexible Objects Using Evolutionary Algorithms. In: Steinhöfel, K. (eds) Stochastic Algorithms: Foundations and Applications. SAGA 2001. Lecture Notes in Computer Science, vol 2264. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45322-9_10
Download citation
DOI: https://doi.org/10.1007/3-540-45322-9_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43025-4
Online ISBN: 978-3-540-45322-2
eBook Packages: Springer Book Archive