Skip to main content
SpringerLink
Log in

The Multi-Story Space Assignment Problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The Multi-Story Space Assignment Problem (MSAP) is an innovative formulation of the multi-story facility assignment problem that allows one to model the location of departments of unequal size within multi-story facilities as a Generalized Quadratic 3-dimensional Assignment Problem (GQ3AP). Not only can the MSAP generate the design of the location of the departments in the facility, the MSAP also includes the evacuation planning for the facility. The formulation, background mathematical development, and computational experience with a branch and bound algorithm for the MSAP are also presented.

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

References

  • Adams, W. P., & Johnson, T. A. (1994). Improved linear programming-based lower bounds for the quadratic assignment problem. In P. M. Pardalos & H. Wolkowicz (Eds.), DIMACS series in discrete mathematics and theoretical computer science : Vol. 16. Quadratic assignment and related problems (pp. 43–75). Providence: Am. Math. Soc.

    Google Scholar 

  • Adams, W. P., & Sherali, H. D. (1986). A tight linearization and an algorithm for zero-one quadratic programming problems. Management Science, 32, 1274–1290.

    Article  Google Scholar 

  • Adams, W. P., & Sherali, H. D. (1990). Linearization strategies for a class of zero-one mixed integer programming problems. Operations Research, 38, 217–226.

    Article  Google Scholar 

  • Adams, W. P., Guignard, M., Hahn, P. M., & Hightower, W. L. (2007). A level-2 reformulation-linearization technique bound for the quadratic assignment problem. European Journal of Operational Research, 180(3), 983–996.

    Article  Google Scholar 

  • Benjaafar, S. (2002). Modeling and analysis of congestion in the design of facility layouts. Management Science, 48(5), 679–704.

    Article  Google Scholar 

  • Burkard, R. E. (1983). A heuristic for quadratic boolean programs with applications to quadratic assignment problems. European Journal of Operational Research, 13, 374–386.

    Article  Google Scholar 

  • Burke, E. K., Cowling, P., Landa, J. D., & McCollum, B. (2000). Three methods to automate the space allocation process in UK Universities, practice, and theory of automated timetabling III, PATAT 2000. The third international conference on the practice and theory of automated timetabling, Konstanz, Germany, 16–18 August 2000 (pp. 374–393). Selected for post conference publication in Springer Lecture Notes in Computer Science, Vol. 2079. ISBN 3-540-42421-0, 254-273.

  • Burke, E. K., Cowling, P., & Keuthen, R. (2001). Effective local and guided variable neighbourhood search methods for the asymmetric travelling salesman problem. In Lecture notes in computer science : Vol. 2037. Applications of evolutionary computing, EvoWorkshops 2001 (pp. 203–212). Berlin: Springer.

    Chapter  Google Scholar 

  • Connolly, D. T. (1990). An improved annealing scheme for the QAP. European Journal of Operational Research, 46(1), 93–100.

    Article  Google Scholar 

  • Cordeau, J.-F., Gaudioso, M., Laporte, G., & Moccia, L. (2006). A memetic heuristic for the generalized quadratic assignment problem. INFORMS Journal on Computing, 18(4), 433–443.

    Article  Google Scholar 

  • Dickey, J. W., & Hopkins, J. W. (1972). Campus building arrangement using Topaz. Transportation Research, 6, 59–68.

    Article  Google Scholar 

  • Drezner, Z., Hahn, P. M., & Taillard, E. (2005). Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Annals of Operations Research, 139, 65–94.

    Article  Google Scholar 

  • Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman.

    Google Scholar 

  • Hahn, P. M., & Grant, T. (1998). Lower bounds for the quadratic assignment problem based on a dual formulation. Operations Research, 46, 912–922.

    Article  Google Scholar 

  • Hahn, P. M., Hightower, W. L., Johnson, T. A., Guignard-Spielberg, M., & Roucairol, C. (2001). Tree elaboration strategies in branch and bound algorithms for solving the quadratic assignment problem. Yugoslavian Journal of Operational Research, 11(1), 41–60.

    Google Scholar 

  • Hahn, P. M., Kim, ÊB.-J., Hightower, W. L., Stützle, T., Kanthak, S., Samra, H., Ding, Z., & Guignard, M. (2008a). The quadratic three-dimensional assignment problem: exact and heuristic solution methods. European Journal of Operational Research, 184(2), 416–428.

    Article  Google Scholar 

  • Hahn, P. M., Kim, B.-J., Guignard, M., Smith, J. M., & Zhu, Y.-R. (2008b). An algorithm for the generalized quadratic assignment problem. Computational Optimization and Applications, 40(3), 351–372.

    Article  Google Scholar 

  • Hoos, H. H., & Stützle, T. (2004). Stochastic local search: foundations and applications. San Mateo: Morgan Kaufmann.

    Google Scholar 

  • Kim, B.-J. (2006). Investigation of methods for solving new classes of quadratic assignment problems (QAPs). Dissertation in Electrical and Systems Engineering, University of Pennsylvania, Philadelphia, PA.

  • Koopmans, T. C., & Beckmann, M. J. (1957). Assignment problems and the location of economic activities. Econometrica, 25, 53–76.

    Article  Google Scholar 

  • Kouvelis, P., & Kiran, A. S. (1990). The plant layout problem in automated manufacturing systems. Annals of Operations Research, 26, 397–412.

    Google Scholar 

  • Lee, C.-G., & Ma, Z. (2004). The generalized quadratic assignment problem. Research Report, Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, Ontario, M5S 3G8, Canada.

  • Li, W.-J., & MacGregor Smith, J. (1994). Stochastic quadratic assignment problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16, 221–236.

    Google Scholar 

  • Li, W.-J., & MacGregor Smith, J. (1995). An algorithm for quadratic assignment problems. European Journal of Operations Research, 81, 205–216.

    Article  Google Scholar 

  • Li, W.-J., & MacGregor Smith, J. (1998). Evaluation of star, grid, and ring topologies in facility layout and network design. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 40, 219–246.

    Google Scholar 

  • Li, Y., Pardalos, P., & Resende, M. (1994). A greedy randomized adaptive search procedure for the quadratic assignment problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16, 237–261.

    Google Scholar 

  • Loiola, E., Maia de Abreu, N. M., Boaventura-Netto, P. O., Hahn, P. M., & Querido, T. (2007). An analytical survey for the quadratic assignment problem. European Journal of Operational Research, 176, 657–690.

    Article  Google Scholar 

  • Meller, R. D., & Gau, K. Y. (1996). The facility layout problem: Recent and emerging trends and perspectives. Journal of Manufacturing Systems, 15, 351–366.

    Article  Google Scholar 

  • Meller, R. D., & Bozer, Y. A. (1997). Alternative approaches to solve the multi-floor facility layout problem. Journal of Manufacturing Systems, 16(3), 192. ABI/INFORM Global.

    Article  Google Scholar 

  • Pardalos, P. M., Rendl, F., & Wolkowicz, H. (1994). The quadratic assignment problem: a survey and recent developments. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16, 1–41.

    Google Scholar 

  • Pierskalla, W. P. (1967). The multi-dimensional assignment problem. Technical Memorandum No. 93, Operations Research Department, CASE Institute of Technology.

  • Sahni, S., & Gonzalez, T. (1976). P-complete approximation problems. Journal of the Association for Computing Machinery, 23(3), 555–565.

    Google Scholar 

  • Sherali, H. D., & Adams, W. P. (1999). A reformulation-linearization technique for solving discrete and continuous non-convex problems (1st ed.) Dordrecht: Kluwer Academic.

    Google Scholar 

  • Stützle, T. (2006). Iterated local search for the quadratic assignment problem. European Journal of Operational Research, 174(3), 1519–1539.

    Article  Google Scholar 

  • Taillard, E. (1991). Robust taboo search for the quadratic assignment problem. Parallel Computing, 17, 443–455.

    Article  Google Scholar 

  • Taillard, E. D. (1998). FANT: Fast ant system (Technical report IDSIA-46-98). IDSIA, Lugano, 1998.

  • Weng, Y., & MacGregor Smith, J. (2006). On the equi-area partitioning problem for rectilinear simple polygons. Department of Mechanical and Industrial Engineering, University of Massachusetts, Amherst Campus (in review).

  • Yang, T., & Benjaafar, S. (2001). FLQ: A software for facility layout with queueing (Technical report 0015). Division of Industrial Engineering, Department of Mechanical Engineering, University of Minnesota, Minneapolis, MN.

  • Zhu, Y.-R. (2007). Recent advances and challenges in the quadratic assignment and related problems. A Dissertation in Electrical and Systems Engineering. University of Pennsylvania, August. Available on the Internet at http://www.seas.upenn.edu/~hahn/Dissertation_yrz.pdf.

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Systems Engineering, University of Pennsylvania, Philadelphia, 2127 Tryon St., PA, 19146-1228, USA

    Peter Hahn & Yi-Rong Zhu

  2. Department of Mechanical and Industrial Engineering, University of Massachusetts Amherst, Amherst, MA, 01003, USA

    J. MacGregor Smith

Authors
  1. Peter Hahn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. MacGregor Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yi-Rong Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peter Hahn.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hahn, P., MacGregor Smith, J. & Zhu, YR. The Multi-Story Space Assignment Problem. Ann Oper Res 179, 77–103 (2010). https://doi.org/10.1007/s10479-008-0474-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-008-0474-3

Keywords

Search

Navigation