Designing difficult office space allocation problem instances with mathematical programming

Ulker, Ozgur and Landa-Silva, Dario (2011) Designing difficult office space allocation problem instances with mathematical programming. In: Experimental Algorithms10th International Symposium, SEA 2011, May 5-7, 2011, Crete, Greece.

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (399kB) | Preview

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.

Item Type: Conference or Workshop Item (Paper)
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
Keywords: Space planning, problem formulation, mathematical programming, exact algorithms
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Depositing User: Landa-Silva, Dario
Date Deposited: 04 Apr 2016 08:32
Last Modified: 24 Sep 2016 15:44
URI: http://eprints.nottingham.ac.uk/id/eprint/32608

Actions (Archive Staff Only)

Edit View Edit View