Abstract
Whenever a social institution plans new buildings or a modification of buildings (e.g. a hospital or a nursing home) the question arises how to arrange the rooms and functional units. One criterion is certainly the total walking distance of staff members, patients/clients and visitors.
Most of the existing approaches to the facilities layout problem either assume only one objective or they deal with several criteria but end up with only a single solution. Our approach focuses on determining Pareto-solutions which are presented to the decision makers. On that basis, it is possible to make a sound decision about the arrangement — by potentially incorporating those implicit criteria, which exist but have not been formulated before.
Furthermore, input data is most often assumed to be completely known which is in general not true. We show how uncertainty could be taken into account such that finally a robust solution is attained.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adams, W. P. and Johnson, T. A. (1994) Improved Linear Programming-Based Lower Bounds for the Quadratic Assignment Problem. DIM ACS 19, 43–75
Adams, W. P. and Sherali, H. D. (1986) A tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems. Management Science 32, 1274–1290
Burkard, R. E. and Çela, E. and Klinz, B. (1994) On the Biquadratic Assignment Problems. DIMACS 16, 117–146
Çela, E. (1998) The Quadratic Assignment Problem, Theory and Algorithms. Kluwer Academic Publishers
Ehrgott, M., Harnacher, H. W, Klamroth, K., Nickel, S., and Schoebel, A. (1997) A note on the equivalence of balace points and Pareto solutions in multiple-objective programming. Journal of Optimization Theory and Applications, 92(1), 209–212
Frieze, A. M. and Yadegar, J. (1983) On the Quadratic Assignment Problem. Discrete Applied Mathematics 5, 98–98
Glover, F. (1972) Improved linear representation of deserete mathematical programs. Management Science Report Series, University of Colorado
Harnacher, H. W. and Queyranne, M. (1985) K best Solutions to combinatorial optimization problems. Annals of Operations Research 6, 123–143
Kaufman, L. and Broeckx, F.(1978) An algorithm for the quadratic assignment problem using Benders’ decomposition. European Journal of Operational Research 2, 204–211
Li, W.-J. and MacGregor Smith, J. (1994) Stochastic Quadratic Assignment Problems. DIMACS 16, 221–236
Padberg, M. W. and Rijal, M. P. (1996) Location, Scheduling, Design and Integer Programming. Kluwer Academic Publishers, Boston
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hamacher, H.W., Nickel, S., Tenfelde-Podehl, D. (2002). Facilities Layout for Social Institutions. In: Chamoni, P., Leisten, R., Martin, A., Minnemann, J., Stadtler, H. (eds) Operations Research Proceedings 2001. Operations Research Proceedings 2001, vol 2001. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-50282-8_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-50282-8_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43344-6
Online ISBN: 978-3-642-50282-8
eBook Packages: Springer Book Archive