IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v33y2022i2d10.1007_s10845-021-01853-5.html
   My bibliography  Save this article

Simulation-based layout optimization for multi-station assembly lines

Author

Listed:
  • Daria Leiber

    (Institute for Machine Tools and Industrial Management, Technical University of Munich)

  • David Eickholt

    (Institute for Machine Tools and Industrial Management, Technical University of Munich)

  • Anh-Tu Vuong

    (Institute for Machine Tools and Industrial Management, Technical University of Munich)

  • Gunther Reinhart

    (Institute for Machine Tools and Industrial Management, Technical University of Munich)

Abstract

This article presents a novel approach for the automated 3D-layout planning of multi-station assembly lines. The planning method is based on a comprehensive model of the used production resources, including their geometry, kinematic properties, and general characteristics. Different resource types can be included in the planning system. A genetic algorithm generates and optimizes possible layouts for a line. The optimization aims to minimize the line’s area and the costs for assembling the line while simultaneously optimizing the resources’ positioning to perform their tasks. The line’s cycle time is considered as a boundary condition. For the evaluation of different layout alternatives, a multi-body simulation is performed. A parameter study is used to set the algorithm’s parameters. Afterward, the algorithm is applied to three increasingly complex examples to validate and evaluate its functionality. The approach is promising for industrial applications as it allows the integration of various resource types and individualization of the optimization function.

Suggested Citation

  • Daria Leiber & David Eickholt & Anh-Tu Vuong & Gunther Reinhart, 2022. "Simulation-based layout optimization for multi-station assembly lines," Journal of Intelligent Manufacturing, Springer, vol. 33(2), pages 537-554, February.
    • Handle: RePEc:spr:joinma:v:33:y:2022:i:2:d:10.1007_s10845-021-01853-5
    DOI: 10.1007/s10845-021-01853-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-021-01853-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10845-021-01853-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Pablo Pérez-Gosende & Josefa Mula & Manuel Díaz-Madroñero, 2021. "Facility layout planning. An extended literature review," International Journal of Production Research, Taylor & Francis Journals, vol. 59(12), pages 3777-3816, June.
    2. Silu Liu & Zeqiang Zhang & Chao Guan & Lixia Zhu & Min Zhang & Peng Guo, 2021. "An improved fireworks algorithm for the constrained single-row facility layout problem," International Journal of Production Research, Taylor & Francis Journals, vol. 59(8), pages 2309-2327, April.
    3. Mariem Besbes & Marc Zolghadri & Roberta Costa Affonso & Faouzi Masmoudi & Mohamed Haddar, 2021. "3D facility layout problem," Journal of Intelligent Manufacturing, Springer, vol. 32(4), pages 1065-1090, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Rui Li & Yali Chen & Jinzhao Song & Ming Li & Yu Yu, 2023. "Multi-Objective Optimization Method of Industrial Workshop Layout from the Perspective of Low Carbon," Sustainability, MDPI, vol. 15(16), pages 1-23, August.
    2. Mehmet Burak Şenol & Ekrem Alper Murat, 2023. "A sequential solution heuristic for continuous facility layout problems," Annals of Operations Research, Springer, vol. 320(1), pages 355-377, January.
    3. Nurul Nadia Nordin & Ruzanna Ab Razak & Govindan Marthandan, 2023. "A Unique Strategy for Improving Facility Layout: An Introduction of The Origin Algorithm," Sustainability, MDPI, vol. 15(14), pages 1-13, July.
    4. Gintaras Palubeckis & Armantas Ostreika & Jūratė Platužienė, 2022. "A Variable Neighborhood Search Approach for the Dynamic Single Row Facility Layout Problem," Mathematics, MDPI, vol. 10(13), pages 1-27, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joinma:v:33:y:2022:i:2:d:10.1007_s10845-021-01853-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.