Skip to main content
SpringerLink
Log in

Optimization and Simulation: Sequential Packing of Flexible Objects Using Evolutionary Algorithms

  • Conference paper
  • First Online:
Stochastic Algorithms: Foundations and Applications (SAGA 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2264))

Included in the following conference series:

  • 375 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bertsekas, Dimitri P. Dynamic programming: deterministic and stochastic models Englewood Cliffs, N. J.: Prentice-Hall, 1987.

    MATH  Google Scholar 

  2. Dowsland, Kathryn A. and William B. Dowsland Packing Problems Europ. J. Operational Research, 56 (1992), 2–14.

    Article  MATH  Google Scholar 

  3. Dowsland, Kathryn A. Some Experiments with Simulated Annealing Techniques for Packing Problems Europ. J. Operational Research, 68 (1993), 389–399.

    Article  MATH  Google Scholar 

  4. Scheithauer, G.The Solution of Packing Problems with Pieces of Variable Length and Additional Allocation Constraints Optimization, 34 (1995), 81–86.

    Google Scholar 

  5. Z. Michalewicz. Genetic Algorithms + Data Structures = Evolutionary Programs. Springer Verlag, 1992.

    Google Scholar 

  6. T. J. Reinhart. Composites. Engineered materials handbook, ASM International /Handbook Committee, Metals Park, Ohio: ASM International, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematik, Technical University Clausthal, D-38678, Clausthal-Zellerfeld, Germany

    Henning Behnke, Michael Kolonko, Ulrich Mertins & Stefan Schnitter

Authors
  1. Henning Behnke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Kolonko
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ulrich Mertins
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Stefan Schnitter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Computer Architecture and Software Engineering, GMD - National ResearchCenter for Information Technology, Kekuléstr.7, 12489, Berlin-Adlershof, Germany

    Kathleen Steinhöfel

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation