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

Integrating facility layout design and aisle structure in manufacturing systems: Formulation and exact solution

Author

Listed:
  • Pourvaziri, Hani
  • Pierreval, Henri
  • Marian, Helene

Abstract

In manufacturing systems, aisles are paths which are used for the movement of workers, transportation devices, and materials. The aisle structure contributes to layout efficiency by reducing material handling costs, mean flow time and the amount of space needed, and providing smooth transportation. Therefore, to achieve a good layout, it is essential to determine the position of facilities such as machines and workstations, but also the corresponding aisle structure. In this article, we analyze the requirements for the design of an efficient aisle structure and propose a formulation of the corresponding layout problem as a mixed-integer linear programming model. This formulation allows the layout of unequal-area facilities and the aisle structure to be simultaneously optimized. In optimizing the aisle structure, issues such as optimizing the number, position, and width of the aisles, the position of the entrance and exit doors, and how to connect them to the aisles are studied. By optimizing the number and width of the aisles, the proposed approach contributes towards optimizing transportation traffic. A branch-and-cut algorithm, improved by adding optimality cuts and efficient branching and node strategies, is used to solve the problem. Finally, a set of computational experiments is performed to show the effectiveness of the proposed approach.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:290:y:2021:i:2:p:499-513
    DOI: 10.1016/j.ejor.2020.08.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221720307037
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2020.08.012?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. 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.
    2. Karaoğlan, İsmail & Erdoğan, Güneş & Koç, Çağrı, 2018. "The Multi-Vehicle Probabilistic Covering Tour Problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 278-287.
    3. Gomez, A. & Fernandez, Q. I. & De la Fuente Garcia, D. & Garcia, P. J., 2003. "Using genetic algorithms to resolve layout problems in facilities where there are aisles," International Journal of Production Economics, Elsevier, vol. 84(3), pages 271-282, June.
    4. Anjos, Miguel F. & Vieira, Manuel V.C., 2017. "Mathematical optimization approaches for facility layout problems: The state-of-the-art and future research directions," European Journal of Operational Research, Elsevier, vol. 261(1), pages 1-16.
    5. Belov, G. & Scheithauer, G., 2006. "A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting," European Journal of Operational Research, Elsevier, vol. 171(1), pages 85-106, May.
    6. Friedrich, C. & Klausnitzer, A. & Lasch, R., 2018. "Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 94867, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    7. Dunker, Thomas & Radons, Gunter & Westkamper, Engelbert, 2005. "Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem," European Journal of Operational Research, Elsevier, vol. 165(1), pages 55-69, August.
    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Ioannou, George, 2006. "Time-phased creation of hybrid manufacturing systems," International Journal of Production Economics, Elsevier, vol. 102(2), pages 183-198, August.
    7. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    8. Dahlbeck, Mirko & Fischer, Anja & Fischer, Frank & Hungerländer, Philipp & Maier, Kerstin, 2023. "Exact approaches for the combined cell layout problem," European Journal of Operational Research, Elsevier, vol. 305(2), pages 530-546.
    9. Zhongwei Zhang & Lihui Wu & Zhaoyun Wu & Wenqiang Zhang & Shun Jia & Tao Peng, 2022. "Energy-Saving Oriented Manufacturing Workshop Facility Layout: A Solution Approach Using Multi-Objective Particle Swarm Optimization," Sustainability, MDPI, vol. 14(5), pages 1-28, February.
    10. Herrán, Alberto & Manuel Colmenar, J. & Duarte, Abraham, 2021. "An efficient variable neighborhood search for the Space-Free Multi-Row Facility Layout problem," European Journal of Operational Research, Elsevier, vol. 295(3), pages 893-907.
    11. B. S. C. Campello & C. T. L. S. Ghidini & A. O. C. Ayres & W. A. Oliveira, 2022. "A residual recombination heuristic for one-dimensional cutting stock problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 194-220, April.
    12. Maxence Delorme & Manuel Iori, 2020. "Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 101-119, January.
    13. John Martinovic & Markus Hähnel & Guntram Scheithauer & Waltenegus Dargie, 2022. "An introduction to stochastic bin packing-based server consolidation with conflicts," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(2), pages 296-331, July.
    14. Vitayasak, Srisatja & Pongcharoen, Pupong & Hicks, Chris, 2017. "A tool for solving stochastic dynamic facility layout problems with stochastic demand using either a Genetic Algorithm or modified Backtracking Search Algorithm," International Journal of Production Economics, Elsevier, vol. 190(C), pages 146-157.
    15. Song, X. & Chu, C.B. & Lewis, R. & Nie, Y.Y. & Thompson, J., 2010. "A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting," European Journal of Operational Research, Elsevier, vol. 202(2), pages 368-378, April.
    16. Krzysztof C. Kiwiel, 2010. "An Inexact Bundle Approach to Cutting-Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 131-143, February.
    17. Fischer, Vera & Pacheco Paneque, Meritxell & Legrain, Antoine & Bürgy, Reinhard, 2024. "A capacitated multi-vehicle covering tour problem on a road network and its application to waste collection," European Journal of Operational Research, Elsevier, vol. 315(1), pages 338-353.
    18. Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
    19. Weckenborg, Christian & Schumacher, Patrick & Thies, Christian & Spengler, Thomas S., 2024. "Flexibility in manufacturing system design: A review of recent approaches from Operations Research," European Journal of Operational Research, Elsevier, vol. 315(2), pages 413-441.
    20. Kratica, Jozef & Stanimirovic, Zorica & Tosic, Dusan & Filipovic, Vladimir, 2007. "Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem," European Journal of Operational Research, Elsevier, vol. 182(1), pages 15-28, October.

    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:290:y:2021:i:2:p:499-513. 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: 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.