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

Combining Wang–Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem

Author

Listed:
  • Liu, Jingfa
  • Wang, Dawen
  • He, Kun
  • Xue, Yu

Abstract

The dynamic facility layout problem (DFLP) is the problem of placing facilities in a certain plant floor for multiple stages so that facilities do not overlap and the sum of the material handling and rearrangement costs are minimized. We describe a model, where the facilities have unequal-areas and the layout for each stage is produced on the continuous plant floor. The most difficulty of solving this problem consists in the lack of a powerful optimization method. Wang–Landau (WL) sampling algorithm is an improved Monte Carlo method, and has been successfully applied to solve many optimization problems. In this paper, we combine the WL sampling algorithm and some heuristic strategies to solve the unequal-area DFLP. In the WL sampling algorithm, a vacant point strategy is applied to update layout at one stage. To prevent overlapping of facilities and reduce the empty space among facilities, a pushing strategy and a pressuring strategy are applied. We have tested the proposed algorithm on four groups of cases and the computational results show that the proposed algorithm is effective in solving the unequal-area DFLP.

Suggested Citation

  • Liu, Jingfa & Wang, Dawen & He, Kun & Xue, Yu, 2017. "Combining Wang–Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem," European Journal of Operational Research, Elsevier, vol. 262(3), pages 1052-1063.
  • Handle: RePEc:eee:ejores:v:262:y:2017:i:3:p:1052-1063
    DOI: 10.1016/j.ejor.2017.04.002
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.ejor.2017.04.002?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. Balakrishnan, Jaydeep & Cheng, Chun Hung, 1998. "Dynamic layout algorithms: a state-of-the-art survey," Omega, Elsevier, vol. 26(4), pages 507-521, August.
    2. Komarudin & Wong, Kuan Yew, 2010. "Applying Ant System for solving Unequal Area Facility Layout Problems," European Journal of Operational Research, Elsevier, vol. 202(3), pages 730-746, May.
    3. 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.
    4. Meir J. Rosenblatt, 1986. "The Dynamics of Plant Layout," Management Science, INFORMS, vol. 32(1), pages 76-86, January.
    5. Benoit Montreuil & Uday Venkatadri, 1991. "Strategic Interpolative Design of Dynamic Manufacturing Systems Layouts," Management Science, INFORMS, vol. 37(6), pages 682-694, June.
    6. McKendall Jr., Alan R. & Hakobyan, Artak, 2010. "Heuristics for the dynamic facility layout problem with unequal-area departments," European Journal of Operational Research, Elsevier, vol. 201(1), pages 171-182, February.
    7. Gonçalves, José Fernando & Resende, Mauricio G.C., 2015. "A biased random-key genetic algorithm for the unequal area facility layout problem," European Journal of Operational Research, Elsevier, vol. 246(1), pages 86-107.
    8. Hanif D. Sherali & Barbara M. P. Fraticelli & Russell D. Meller, 2003. "Enhanced Model Formulations for Optimal Facility Layout," Operations Research, INFORMS, vol. 51(4), pages 629-644, August.
    9. Miguel F. Anjos & Anthony Vannelli, 2006. "A New Mathematical-Programming Framework for Facility-Layout Design," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 111-118, February.
    10. Yang, Taho & Peters, Brett A., 1998. "Flexible machine layout design for dynamic and uncertain production environments," European Journal of Operational Research, Elsevier, vol. 108(1), pages 49-64, July.
    11. Kouvelis, Panagiotis & Kurawarwala, Abbas A. & Gutierrez, Genaro J., 1992. "Algorithms for robust single and multiple period layout planning for manufacturing systems," European Journal of Operational Research, Elsevier, vol. 63(2), pages 287-303, December.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Pablo Pérez-Gosende & Josefa Mula & Manuel Díaz-Madroñero, 2020. "Overview of Dynamic Facility Layout Planning as a Sustainability Strategy," Sustainability, MDPI, vol. 12(19), pages 1-16, October.

    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. McKendall Jr., Alan R. & Hakobyan, Artak, 2010. "Heuristics for the dynamic facility layout problem with unequal-area departments," European Journal of Operational Research, Elsevier, vol. 201(1), pages 171-182, February.
    2. Saif Benjaafar & Sunderesh S. Heragu & Shahrukh A. Irani, 2002. "Next Generation Factory Layouts: Research Challenges and Recent Progress," Interfaces, INFORMS, vol. 32(6), pages 58-76, December.
    3. Ali Derakhshan Asl & Kuan Yew Wong, 2017. "Solving unequal-area static and dynamic facility layout problems using modified particle swarm optimization," Journal of Intelligent Manufacturing, Springer, vol. 28(6), pages 1317-1336, August.
    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. 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.
    6. Xie, Yue & Zhou, Shenghan & Xiao, Yiyong & Kulturel-Konak, Sadan & Konak, Abdullah, 2018. "A β-accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics," European Journal of Operational Research, Elsevier, vol. 265(1), pages 26-38.
    7. 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.
    8. Gonçalves, José Fernando & Resende, Mauricio G.C., 2015. "A biased random-key genetic algorithm for the unequal area facility layout problem," European Journal of Operational Research, Elsevier, vol. 246(1), pages 86-107.
    9. 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.
    10. Paes, Frederico Galaxe & Pessoa, Artur Alves & Vidal, Thibaut, 2017. "A hybrid genetic algorithm with decomposition phases for the Unequal Area Facility Layout Problem," European Journal of Operational Research, Elsevier, vol. 256(3), pages 742-756.
    11. Minhee Kim & Junjae Chae, 2019. "Monarch Butterfly Optimization for Facility Layout Design Based on a Single Loop Material Handling Path," Mathematics, MDPI, vol. 7(2), pages 1-21, February.
    12. Ali Derakhshan Asl & Kuan Yew Wong & Manoj Kumar Tiwari, 2016. "Unequal-area stochastic facility layout problems: solutions using improved covariance matrix adaptation evolution strategy, particle swarm optimisation, and genetic algorithm," International Journal of Production Research, Taylor & Francis Journals, vol. 54(3), pages 799-823, February.
    13. Bock, Stefan & Hoberg, Kai, 2007. "Detailed layout planning for irregularly-shaped machines with transportation path design," European Journal of Operational Research, Elsevier, vol. 177(2), pages 693-718, March.
    14. Balakrishnan, Jaydeep & Cheng, Chun Hung, 2007. "Multi-period planning and uncertainty issues in cellular manufacturing: A review and future directions," European Journal of Operational Research, Elsevier, vol. 177(1), pages 281-309, February.
    15. Balakrishnan, Jaydeep & Cheng, Chun Hung, 1998. "Dynamic layout algorithms: a state-of-the-art survey," Omega, Elsevier, vol. 26(4), pages 507-521, August.
    16. Yifei Zhao & Stein W. Wallace, 2016. "Appraising redundancy in facility layout," International Journal of Production Research, Taylor & Francis Journals, vol. 54(3), pages 665-679, February.
    17. 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.
    18. I. Jerin Leno & S. Saravana Sankar & S. G. Ponnambalam, 2018. "MIP model and elitist strategy hybrid GA–SA algorithm for layout design," Journal of Intelligent Manufacturing, Springer, vol. 29(2), pages 369-387, February.
    19. Balakrishnan, Jaydeep & Cheng, Chun Hung, 2006. "A note on "a hybrid genetic algorithm for the dynamic plant layout problem"," International Journal of Production Economics, Elsevier, vol. 103(1), pages 87-89, September.
    20. Asef-Vaziri, Ardavan & Jahandideh, Hossein & Modarres, Mohammad, 2017. "Loop-based facility layout design under flexible bay structures," International Journal of Production Economics, Elsevier, vol. 193(C), pages 713-725.

    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:262:y:2017:i:3:p:1052-1063. 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.