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

Heuristics for the dynamic facility layout problem with unequal-area departments

Author

Listed:
  • McKendall Jr., Alan R.
  • Hakobyan, Artak

Abstract

The dynamic facility layout problem (DFLP) is the problem of finding positions of departments on the plant floor for multiple periods (material flows between departments change during the planning horizon) such that departments do not overlap, and the sum of the material handling and rearrangement costs is minimized. In this paper, the departments may have unequal-areas and free orientations, and the layout for each period is generated on the continuous plant floor. Because of the complexity of the problem, only small-size problems can be solved in reasonable time using exact techniques. As a result, a boundary search (construction) technique, which places departments along the boundaries of already placed departments, is developed for the DFLP. The solution is improved using a tabu search heuristic. The heuristics were tested on some instances from the DFLP and static facility layout problem (SFLP) literature. The results obtained demonstrate the effectiveness of the heuristics.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:201:y:2010:i:1:p:171-182
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(09)00124-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Benoit Montreuil & Uday Venkatadri, 1991. "Strategic Interpolative Design of Dynamic Manufacturing Systems Layouts," Management Science, INFORMS, vol. 37(6), pages 682-694, June.
    2. Balakrishnan, Jaydeep & Cheng, Chun Hung, 1998. "Dynamic layout algorithms: a state-of-the-art survey," Omega, Elsevier, vol. 26(4), pages 507-521, August.
    3. Goetschalckx, Marc, 1992. "An interactive layout heuristic based on hexagonal adjacency graphs," European Journal of Operational Research, Elsevier, vol. 63(2), pages 304-321, December.
    4. Roberto Battiti & Giampietro Tecchiolli, 1994. "The Reactive Tabu Search," INFORMS Journal on Computing, INFORMS, vol. 6(2), pages 126-140, May.
    5. Montreuil, Benoit & Laforge, Andree, 1992. "Dynamic layout design given a scenario tree of probable futures," European Journal of Operational Research, Elsevier, vol. 63(2), pages 271-286, December.
    6. Chiang, Wen-Chyuan & Chiang, Chi, 1998. "Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 457-488, April.
    7. Kusiak, Andrew & Heragu, Sunderesh S., 1987. "The facility layout problem," European Journal of Operational Research, Elsevier, vol. 29(3), pages 229-251, June.
    8. 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.
    9. 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.
    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. Meir J. Rosenblatt, 1986. "The Dynamics of Plant Layout," Management Science, INFORMS, vol. 32(1), pages 76-86, January.
    12. Jadranka Skorin-Kapov, 1990. "Tabu Search Applied to the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 33-45, February.
    13. Bharat K. Kaku & Joseph B. Mazzola, 1997. "A Tabu-Search Heuristic for the Dynamic Plant Layout Problem," INFORMS Journal on Computing, INFORMS, vol. 9(4), pages 374-384, November.
    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. 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.
    2. 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.
    3. Pourvaziri, Hani & Pierreval, Henri, 2017. "Dynamic facility layout problem based on open queuing network theory," European Journal of Operational Research, Elsevier, vol. 259(2), pages 538-553.
    4. 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.
    5. SeyedReza RazaviAlavi & Simaan AbouRizk, 2021. "Construction Site Layout Planning Using a Simulation-Based Decision Support Tool," Logistics, MDPI, vol. 5(4), pages 1-25, September.
    6. 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.
    7. 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.

    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. 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.
    2. 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.
    3. 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.
    4. Balakrishnan, Jaydeep & Cheng, Chun Hung, 1998. "Dynamic layout algorithms: a state-of-the-art survey," Omega, Elsevier, vol. 26(4), pages 507-521, August.
    5. Kulturel-Konak, Sadan, 2012. "A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays," European Journal of Operational Research, Elsevier, vol. 223(3), pages 614-625.
    6. 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.
    7. 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.
    8. 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.
    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. Hassan, Mohsen M. D., 2000. "Toward re-engineering models and algorithms of facility layout," Omega, Elsevier, vol. 28(6), pages 711-723, December.
    11. 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.
    12. 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.
    13. E Erel & J B Ghosh & J T Simon, 2003. "New heuristic for the dynamic layout problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(12), pages 1275-1282, December.
    14. 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.
    15. Lin, Jin-Ling & Foote, Bobbie & Pulat, Simin & Chang, Chir-Ho & Cheung, John Y., 1996. "Solving the failure-to-fit problem for plant layout: By changing department shapes and sizes," European Journal of Operational Research, Elsevier, vol. 89(1), pages 135-146, February.
    16. 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.
    17. 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.
    18. 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.
    19. Stutzle, Thomas, 2006. "Iterated local search for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1519-1539, November.
    20. Zvi Drezner & Peter Hahn & Éeric Taillard, 2005. "Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods," Annals of Operations Research, Springer, vol. 139(1), pages 65-94, 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:201:y:2010:i:1:p:171-182. 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.