IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v270y2018i3p837-851.html
   My bibliography  Save this article

Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance

Author

Listed:
  • Friedrich, Christian
  • Klausnitzer, Armin
  • Lasch, Rainer

Abstract

The designer of a plant layout faces mutually dependent subproblems that are traditionally solved in a sequential process. In this paper, a slicing tree based parallel tempering heuristic is used to solve the facility layout problem, including the location of the material handling points of each facility. To determine the input and output points on the perimeters of the departments for a given layout, two heuristic methods are presented and compared to an integer linear programming approach. The shortest paths along the perimeter of the departments are used to calculate the distance of the material flow paths from output to input points. The methods are embedded in a superordinate parallel tempering algorithm, which represents a novel approach to solving the facility layout problem. To compare the efficiency of the superordinate parallel tempering algorithm, two variants of the variable neighbourhood search are implemented as well. The effectiveness of the approach in terms of the objective function value is shown by comparing the results to those in the literature.

Suggested Citation

  • Friedrich, Christian & Klausnitzer, Armin & Lasch, Rainer, 2018. "Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance," European Journal of Operational Research, Elsevier, vol. 270(3), pages 837-851.
    • Handle: RePEc:eee:ejores:v:270:y:2018:i:3:p:837-851
    DOI: 10.1016/j.ejor.2018.01.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718300018
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2018.01.001?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Siyu Xu & Yufei Wang & Xiao Feng, 2020. "Plant Layout Optimization for Chemical Industry Considering Inner Frame Structure Design," Sustainability, MDPI, vol. 12(6), pages 1-19, March.
    2. Hua, Hao & Hovestadt, Ludger & Tang, Peng & Li, Biao, 2019. "Integer programming for urban design," European Journal of Operational Research, Elsevier, vol. 274(3), pages 1125-1137.
    3. Mariem Besbes & Marc Zolghadri & Roberta Costa Affonso & Faouzi Masmoudi & Mohamed Haddar, 2020. "A methodology for solving facility layout problem considering barriers: genetic algorithm coupled with A* search," Journal of Intelligent Manufacturing, Springer, vol. 31(3), pages 615-640, March.
    4. Pourvaziri, Hani & Pierreval, Henri & Marian, Helene, 2021. "Integrating facility layout design and aisle structure in manufacturing systems: Formulation and exact solution," European Journal of Operational Research, Elsevier, vol. 290(2), pages 499-513.
    5. 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.
    6. Erfan Babaee Tirkolaee & Alireza Goli & Abbas Mardani, 2023. "A novel two-echelon hierarchical location-allocation-routing optimization for green energy-efficient logistics systems," Annals of Operations Research, Springer, vol. 324(1), pages 795-823, May.

    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:eee:ejores:v:270:y:2018:i:3:p:837-851. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.