Skip to main content
SpringerLink
Log in

Hospital Layout as a Quadratic Assignment Problem

  • Case-Oriented Paper
  • Published:
Journal of the Operational Research Society

Abstract

The problem of locating hospital departments so as to minimize the total distance travelled by patients can be formulated as a Quadratic Assignment Problem. In this paper we discuss some practical considerations of the problem, its formulation, we present a heuristic procedure to solve it and comment on our computational experience with the heuristic.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. The Institute of National Planning, Cairo, Egypt

    Alwalid N. Elshafei

Authors
  1. Alwalid N. Elshafei
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This paper was presented at the ORS Annual Conference, Loughborough, 23-26 Sept. 1975.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Elshafei, A. Hospital Layout as a Quadratic Assignment Problem. J Oper Res Soc 28, 167–179 (1977). https://doi.org/10.1057/jors.1977.29

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.1977.29

Search

Navigation