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

Tools

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

Full text not available from this repository.

Official URL: http://www.sciencedirect.com/science/article/pii/S1571065310000740

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.

Item Type:	Article
RIS ID:	https://nottingham-repository.worktribe.com/output/706431
Additional Information:	Note: Presented at the 2010 International Symposium on Combinatorial Optimization (ISCO 2010), Hammamet Tunisia, March 2010.
Keywords:	space planning, problem formulation, mathematical programming, exact algorithms
Schools/Departments:	University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number:	https://doi.org/10.1016/j.endm.2010.05.073
Depositing User:	Landa-Silva, Dario
Date Deposited:	01 Aug 2016 08:45
Last Modified:	04 May 2020 16:29
URI:	https://eprints.nottingham.ac.uk/id/eprint/35596

Actions (Archive Staff Only)

Edit View

LoginAdmin