The Multi-Story Space Assignment problem

Annals of Operations Research

Volumn 179, Issue 1, 2010, Pages 77-103

  Hahn, Peter ^a   MacGregor Smith, J ^b   Zhu, Yi Rong ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b University of Massachusetts   (United States)

Author keywords

Evacuation; Multi story; Space assignment

Indexed keywords

EID: 77956062025     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-008-0474-3     Document Type: Article

References (43)

1. 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.
2. Adams, W. P., & Sherali, H. D. (1986). A tight linearization and an algorithm for zero-one quadratic programming problems. Management Science, 32, 1274-1290.
3. Adams, W. P., & Sherali, H. D. (1990). Linearization strategies for a class of zero-one mixed integer programming problems. Operations Research, 38, 217-226.
4. 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.
5. Benjaafar, S. (2002). Modeling and analysis of congestion in the design of facility layouts. Management Science, 48(5), 679-704.
6. Burkard, R. E. (1983). A heuristic for quadratic boolean programs with applications to quadratic assignment problems. European Journal of Operational Research, 13, 374-386.
7. 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.
8. 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.
9. Burkard, R. E. (1983). A heuristic for quadratic boolean programs with applications to quadratic assignment problems. European Journal of Operational Research, 13, 374-386.
10. 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.
11. 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.
12. Ciriani, V., Pisanti, N. and Bernasconi, A. (2004). Room allocation: a polynomial subcase of the quadratic assignment problem. Discrete Applied Mathematics, 144(3), 263-269.
13. Connolly, D. T. (1990). An improved annealing scheme for the QAP. European Journal of Operational Research, 46(1), 93-100.
14. 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.
15. Dickey, J. W., & Hopkins, J. W. (1972). Campus building arrangement using Topaz. Transportation Research, 6, 59-68.
16. 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.
17. 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.
18. Hahn, P. M., & Grant, T. (1998). Lower bounds for the quadratic assignment problem based on a dual formulation. Operations Research, 46, 912-922.
19. 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.
20. 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.
21. 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.
22. 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.
23. Li, W.-J., & MacGregor Smith, J. (1994). Stochastic quadratic assignment problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16, 221-236.
24. Koopmans, T. C., & Beckmann, M. J. (1957). Assignment problems and the location of economic activities. Econometrica, 25, 53-76.
25. Kouvelis, P., & Kiran, A. S. (1990). The plant layout problem in automated manufacturing systems. Annals of Operations Research, 26, 397-412.
26. 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.
27. Li, W.-J., & MacGregor Smith, J. (1994). Stochastic quadratic assignment problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16, 221-236.
28. Li, W.-J., & MacGregor Smith, J. (1995). An algorithm for quadratic assignment problems. European Journal of Operations Research, 81, 205-216.
29. 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.
30. 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.
31. 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.
32. Meller, R. D., & Gau, K. Y. (1996). The facility layout problem: Recent and emerging trends and perspectives. Journal of Manufacturing Systems, 15, 351-366.
33. 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.
34. 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.
35. Taillard, E. (1991). Robust taboo search for the quadratic assignment problem. Parallel Computing, 17, 443-455.
36. Sahni, S., & Gonzalez, T. (1976). P-complete approximation problems. Journal of the Association for Computing Machinery, 23(3), 555-565.
37. 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).
38. Stützle, T. (2006). Iterated local search for the quadratic assignment problem. European Journal of Operational Research, 174(3), 1519-1539.
39. Taillard, E. (1991). Robust taboo search for the quadratic assignment problem. Parallel Computing, 17, 443-455.