IDEAS home Printed from https://ideas.repec.org/p/han/dpaper/dp-527.html
   My bibliography  Save this paper

A hierarchical facility layout planning approach for large and complex hospitals

Author

Listed:
  • Helber, Stefan
  • Böhme, Daniel
  • Oucherif, Farid
  • Lagershausen, Svenja
  • Kasper, Steffen

Abstract

The transportation processes for patients, personnel, and material in large and complex maximum-care hospitals with many departments can consume significant resources and thus induce substantial logistics costs. These costs are largely determined by the allocation of the different departments and wards in possibly multiple connected hospital buildings. We develop a hierarchical layout planning approach based on an analysis of organizational and operational data from the Hannover Medical School, a large and complex university hospital in Hannover, Germany. The purpose of this approach is to propose locations for departments and wards for a given system of buildings such that the consumption of resources due to those transportation processes is minimized. We apply the approach to this real-world organizational and operational dataset as well as to a fictitious hospital building and analyze the algorithmic behavior and resulting layout.

Suggested Citation

  • Helber, Stefan & Böhme, Daniel & Oucherif, Farid & Lagershausen, Svenja & Kasper, Steffen, 2014. "A hierarchical facility layout planning approach for large and complex hospitals," Hannover Economic Papers (HEP) dp-527, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    • Handle: RePEc:han:dpaper:dp-527
    as

    Download full text from publisher

    File URL: http://diskussionspapiere.wiwi.uni-hannover.de/pdf_bib/dp-527.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Leti Vos & Siebren Groothuis & Godefridus Merode, 2007. "Evaluating hospital design from an operations management perspective," Health Care Management Science, Springer, vol. 10(4), pages 357-364, December.
    2. L. R. Foulds, 1983. "Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent," Management Science, INFORMS, vol. 29(12), pages 1414-1426, December.
    3. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    4. Heragu, Sunderesh S. & Kusiak, Andrew, 1991. "Efficient models for the facility layout problem," European Journal of Operational Research, Elsevier, vol. 53(1), pages 1-13, July.
    5. Gordon C. Armour & Elwood S. Buffa, 1963. "A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities," Management Science, INFORMS, vol. 9(2), pages 294-309, January.
    6. Yavuz A. Bozer & Russell D. Meller & Steven J. Erlebacher, 1994. "An Improvement-Type Layout Algorithm for Single and Multiple-Floor Facilities," Management Science, INFORMS, vol. 40(7), pages 918-932, July.
    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. Beraldi, P. & Bruni, M.E., 2009. "A probabilistic model applied to emergency service vehicle location," European Journal of Operational Research, Elsevier, vol. 196(1), pages 323-331, July.
    9. Frederick S. Hillier & Michael M. Connors, 1966. "Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities," Management Science, INFORMS, vol. 13(1), pages 42-57, September.
    10. Helber, Stefan & Sahling, Florian, 2010. "A fix-and-optimize approach for the multi-level capacitated lot sizing problem," International Journal of Production Economics, Elsevier, vol. 123(2), pages 247-256, February.
    11. Muhittin Oral & Ossama Kettani, 1992. "A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems," Operations Research, INFORMS, vol. 40(1-supplem), pages 109-116, February.
    12. Peter Hahn & J. MacGregor Smith & Yi-Rong Zhu, 2010. "The Multi-Story Space Assignment Problem," Annals of Operations Research, Springer, vol. 179(1), pages 77-103, September.
    13. Warren P. Adams & Hanif D. Sherali, 1986. "A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems," Management Science, INFORMS, vol. 32(10), pages 1274-1290, October.
    14. Peter M. Hahn & Yi-Rong Zhu & Monique Guignard & William L. Hightower & Matthew J. Saltzman, 2012. "A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 24(2), pages 202-209, May.
    15. Burkard, R. E. & Karisch, S. & Rendl, F., 1991. "QAPLIB-A quadratic assignment problem library," European Journal of Operational Research, Elsevier, vol. 55(1), pages 115-119, 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. Abdelahad Chraibi & Ibrahim H. Osman & Said Kharraja, 2019. "Adaptive layout for operating theatre in hospitals: different mathematical models for optimal layouts," Annals of Operations Research, Springer, vol. 272(1), pages 493-527, January.
    2. 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.
    3. Farouq Halawa & Sreenath Chalil Madathil & Alice Gittler & Mohammad T. Khasawneh, 2020. "Advancing evidence-based healthcare facility design: a systematic literature review," Health Care Management Science, Springer, vol. 23(3), pages 453-480, September.
    4. Feng, Yanling & Li, Guo & Sethi, Suresh P., 2018. "A three-layer chromosome genetic algorithm for multi-cell scheduling with flexible routes and machine sharing," International Journal of Production Economics, Elsevier, vol. 196(C), pages 269-283.
    5. T. G. Pradeepmon & Vinay V. Panicker & R. Sridharan, 2021. "A variable neighbourhood search enhanced estimation of distribution algorithm for quadratic assignment problems," OPSEARCH, Springer;Operational Research Society of India, vol. 58(1), pages 203-233, March.
    6. Alexander Hübner & Heinrich Kuhn & Manuel Walther, 2018. "Combining clinical departments and wards in maximum-care hospitals," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(3), pages 679-709, July.

    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. 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.
    2. Ravi Kumar, K. & Hadjinicola, George C. & Lin, Ting-li, 1995. "A heuristic procedure for the single-row facility layout problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 65-73, November.
    3. 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.
    4. 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.
    5. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    6. 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.
    7. Nihal Berktaş & Hande Yaman, 2021. "A Branch-and-Bound Algorithm for Team Formation on Social Networks," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1162-1176, July.
    8. Jean-Paul Arnaout, 2018. "Worm optimization for the multiple level warehouse layout problem," Annals of Operations Research, Springer, vol. 269(1), pages 29-51, October.
    9. Monique Guignard, 2020. "Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0–1 optimization problems with linear constraints," Annals of Operations Research, Springer, vol. 286(1), pages 173-200, March.
    10. Kazuhiro Tsuchiya & Sunil Bharitkar & Yoshiyasu Takefuji, 1996. "A neural network approach to facility layout problems," European Journal of Operational Research, Elsevier, vol. 89(3), pages 556-563, March.
    11. Jerzy Grobelny & Rafal Michalski, 2016. "A concept of a flexible approach to the facilities layout problems in logistics systems," WORking papers in Management Science (WORMS) WORMS/16/11, Department of Operations Research and Business Intelligence, Wroclaw University of Science and Technology.
    12. Kim, J. -Y. & Kim, Y. -D., 1995. "Graph theoretic heuristics for unequal-sized facility layout problems," Omega, Elsevier, vol. 23(4), pages 391-401, August.
    13. Ignacio Castillo & Thaddeus Sim, 2004. "A spring-embedding approach for the facility layout problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(1), pages 73-81, January.
    14. Li, Wu-Ji & Smith, J. MacGregor, 1995. "An algorithm for Quadratic Assignment Problems," European Journal of Operational Research, Elsevier, vol. 81(1), pages 205-216, February.
    15. Silva, Allyson & Coelho, Leandro C. & Darvish, Maryam, 2021. "Quadratic assignment problem variants: A survey and an effective parallel memetic iterated tabu search," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1066-1084.
    16. 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.
    17. Lee, Geun-Cheol & Kim, Yeong-Dae, 2000. "Algorithms for adjusting shapes of departments in block layouts on the grid-based plane," Omega, Elsevier, vol. 28(1), pages 111-122, February.
    18. Bolte, Andreas & Thonemann, Ulrich Wilhelm, 1996. "Optimizing simulated annealing schedules with genetic programming," European Journal of Operational Research, Elsevier, vol. 92(2), pages 402-416, July.
    19. Yu, Junfang & Sarker, Bhaba R., 2003. "Directional decomposition heuristic for a linear machine-cell location problem," European Journal of Operational Research, Elsevier, vol. 149(1), pages 142-184, August.
    20. 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.

    More about this item

    Keywords

    Hospital layout planning; quadratic assignment problem; fix-and-optimize heuristic;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:han:dpaper:dp-527. 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: Heidrich, Christian (email available below). General contact details of provider: https://edirc.repec.org/data/fwhande.html .

    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.