Skip to main content

Research Repository

Advanced Search

Designing difficult office space allocation problem instances with mathematical programming

Ulker, Ozgur; Landa-Silva, Dario

Designing difficult office space allocation problem instances with mathematical programming Thumbnail


Authors

Ozgur Ulker

Profile image of DARIO LANDA SILVA

DARIO LANDA SILVA DARIO.LANDASILVA@NOTTINGHAM.AC.UK
Professor of Computational Optimisation



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.

Citation

Ulker, O., & Landa-Silva, D. (2011). Designing difficult office space allocation problem instances with mathematical programming.

Conference Name Experimental Algorithms10th International Symposium, SEA 2011
Publication Date May 1, 2011
Deposit Date Apr 4, 2016
Publicly Available Date Apr 4, 2016
Peer Reviewed Peer Reviewed
Keywords Space planning, problem formulation, mathematical programming, exact algorithms
Public URL https://nottingham-repository.worktribe.com/output/1010040
Publisher URL http://link.springer.com/chapter/10.1007%2F978-3-642-20662-7_24
Additional Information Published in: Experimental algorithms : 10th International Symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5-7, 2011 : proceedings / Panos M. Pardalos, Steffen Rebennack (eds.). Berlin : Springer, c2011. Lecture notes in computer science, v. 6633, p. 280-291. ISBN 9783642206610
doi: 10.1007/978-3-642-20662-7_24

Files





You might also like



Downloadable Citations