Abstract
Office space allocation (OSA) refers to the assignment of room space to a set of entities (people, machines, roles, etc.), with the goal of optimising the space utilisation while satisfying a set of additional constraints. In this paper, a mathematical programming approach is developed to model and generate test instances for this difficult and important combinatorial optimisation problem. Systematic experimentation is then carried out to study the difficulty of the generated test instances when the parameters for adjusting space misuse (overuse and underuse) and constraint violations are subject to variation. The results show that the difficulty of solving OSA problem instances can be greatly affected by the value of these parameters.
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
Benjamin, C., Ehie, I., Omurtag, Y.: Planning facilities at the university of missouri-rolla. Interfaces 22(4) (1992)
Burke, E.K., Cowling, P., Landa Silva, J.D.: Hybrid population-based metaheuristic approaches for the space allocation problem. In: Proceedings of the 2001 Congress on Evolutionary Computation (CEC 2001), pp. 232–239 (2001)
Burke, E.K., Cowling, P., Landa Silva, J.D., McCollum, B.: Three methods to automate the space allocation process in UK universities. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 254–273. Springer, Heidelberg (2001)
Burke, E.K., Cowling, P., Landa Silva, J.D., Petrovic, S.: Combining hybrid metaheuristics and populations for the multiobjective optimisation of space allocation problems. In: Proceedings of the 2001 Genetic and Evolutionary Computation Conference (GECCO 2001), pp. 1252–1259 (2001)
Burke, E.K., Varley, D.B.: Space allocation: An analysis of higher education requirements. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 20–33. Springer, Heidelberg (1998)
Cattrysse, D.G., Van Wassenhove, L.N.: A survey of algorithms for the generalized assignment problem. European Journal of Operational Research 60(3), 260–272 (1992)
Coello Coello, C.A., Lamont, G.B., Van Veldhuizen, D.A.: Evolutionary Algorithms for Solving Multi-Objective Problems, 2nd edn. Springer, Heidelberg (2006)
Giannikos, J., El-Darzi, E., Lees, P.: An integer goal programming model to allocate offices to staff in an academic instituition. Journal of the Operational Research Society 46(6), 713–720 (1995)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning, 1st edn. Addison-Wesley, Reading (1989)
Gurobi Optimization: Gurobi (2010), http://www.gurobi.com
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Landa-Silva, D., Burke, E.K.: Asynchronous cooperative local search for the office-space-allocation problem. INFORMS J. on Computing 19(4), 575–587 (2007)
Landa-Silva, J.D.: Metaheuristics and Multiobjective Approaches for Space Allocation. Ph.D. thesis, School of Computer Science and Information Technology, University of Nottingham (2003)
Lopes, R., Girimonte, D.: The office-space-allocation problem in strongly hierarchized organizations. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 143–153. Springer, Heidelberg (2010)
Martello, S., Toth, P.: Knapsack problems: algorithms and computer implementations. John Wiley & Sons, Inc., New York (1990)
Pereira, R., Cummiskey, K., Kincaid, R.: Office space allocation optimization. In: IEEE Systems and Information Engineering Design Symposium (SIEDS 2010), pp. 112–117 (2010)
Ritzman, L., Bradford, J., Jacobs, R.: A multiple objective approach to space planning for academic facilities. Managament Science 25(9), 895–906 (1980)
Ülker, O., Landa-Silva, D.: A 0/1 integer programming model for the office space allocation problem. Electronic Notes in Discrete Mathematics 36, 575–582 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ülker, Ö., Landa-Silva, D. (2011). Designing Difficult Office Space Allocation Problem Instances with Mathematical Programming. In: Pardalos, P.M., Rebennack, S. (eds) Experimental Algorithms. SEA 2011. Lecture Notes in Computer Science, vol 6630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20662-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-20662-7_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20661-0
Online ISBN: 978-3-642-20662-7
eBook Packages: Computer ScienceComputer Science (R0)