A 0/1 integer programming model for the office space allocation problem
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 propos...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
Elsevier
2010
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/35596/ |
| _version_ | 1848795117251461120 |
|---|---|
| author | Ulker, Ozgr Landa-Silva, Dario |
| author_facet | Ulker, Ozgr Landa-Silva, Dario |
| author_sort | Ulker, Ozgr |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T19:26:59Z |
| format | Article |
| id | nottingham-35596 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T19:26:59Z |
| publishDate | 2010 |
| publisher | Elsevier |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-355962020-05-04T16:29:23Z https://eprints.nottingham.ac.uk/35596/ A 0/1 integer programming model for the office space allocation problem Ulker, Ozgr Landa-Silva, Dario 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. Elsevier 2010-08-01 Article PeerReviewed Ulker, Ozgr and Landa-Silva, Dario (2010) A 0/1 integer programming model for the office space allocation problem. Electronic Notes in Discrete Mathematics, 36 . pp. 575-582. ISSN 1571-0653 space planning problem formulation mathematical programming exact algorithms http://www.sciencedirect.com/science/article/pii/S1571065310000740 doi:10.1016/j.endm.2010.05.073 doi:10.1016/j.endm.2010.05.073 |
| spellingShingle | space planning problem formulation mathematical programming exact algorithms Ulker, Ozgr Landa-Silva, Dario A 0/1 integer programming model for the office space allocation problem |
| title | A 0/1 integer programming model for the office space allocation problem |
| title_full | A 0/1 integer programming model for the office space allocation problem |
| title_fullStr | A 0/1 integer programming model for the office space allocation problem |
| title_full_unstemmed | A 0/1 integer programming model for the office space allocation problem |
| title_short | A 0/1 integer programming model for the office space allocation problem |
| title_sort | 0/1 integer programming model for the office space allocation problem |
| topic | space planning problem formulation mathematical programming exact algorithms |
| url | https://eprints.nottingham.ac.uk/35596/ https://eprints.nottingham.ac.uk/35596/ https://eprints.nottingham.ac.uk/35596/ |