A 0/1 integer programming model for the office space allocation problem

Ulker, Ozgr; Landa-Silva, Dario

Abstract

We propose a 0/1 integer programming model to tackle the office space allocation (OSA) problem which refers to assigning 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 requirements. In the proposed approach, these requirements can be modelled as constraints (hard constraints) or as objectives (soft constraints). Then, we conduct some experiments on benchmark instances and observe that setting certain constraints as hard (actual constraints) or soft (objectives) has a significant impact on the computational difficulty on this combinatorial optimisation problem.

Citation

Ulker, O., & Landa-Silva, D. (2010). A 0/1 integer programming model for the office space allocation problem. Electronic Notes in Discrete Mathematics, 36, https://doi.org/10.1016/j.endm.2010.05.073

• Journal Article Type: Article
• Acceptance Date: Jan 22, 2010
• Publication Date: Aug 1, 2010
• Deposit Date: Aug 1, 2016
• Publicly Available Date: Aug 1, 2016
• Journal: Electronic Notes in Discrete Mathematics
• Print ISSN: 1571-0653
• Electronic ISSN: 1571-0653
• Publisher: Elsevier
• Peer Reviewed: Peer Reviewed
• Volume: 36
• DOI: https://doi.org/10.1016/j.endm.2010.05.073
• Keywords: space planning, problem formulation, mathematical programming, exact algorithms
• Public URL: https://nottingham-repository.worktribe.com/output/706431
• Publisher URL: http://www.sciencedirect.com/science/article/pii/S1571065310000740
• Additional Information: Note: Presented at the 2010 International Symposium on Combinatorial Optimization (ISCO 2010), Hammamet Tunisia, March 2010.