IDEAS home Printed from
   My bibliography  Save this paper

A hierarchical facility layout planning approach for large and complex hospitals


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


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

    Download full text from publisher

    File URL:
    Download Restriction: no

    References listed on IDEAS

    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. 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.
    9. 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.
    10. 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.
    11. 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.
    12. 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 are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. repec:spr:joinma:v:29:y:2018:i:2:d:10.1007_s10845-015-1113-x is not listed on IDEAS
    2. I. Jerin Leno & S. Saravana Sankar & S. G. Ponnambalam, 0. "MIP model and elitist strategy hybrid GA–SA algorithm for layout design," Journal of Intelligent Manufacturing, Springer, vol. 0, pages 1-19.
    3. repec:spr:orspec:v:40:y:2018:i:3:d:10.1007_s00291-018-0522-6 is not listed on IDEAS

    More about this item


    Hospital layout planning; quadratic assignment problem; fix-and-optimize heuristic;

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Heidrich, Christian). General contact details of provider: .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.