Office space allocation by using mathematical programming and meta-heuristics

Tools

Ulker, Ozgur (2013) Office space allocation by using mathematical programming and meta-heuristics. PhD thesis, University of Nottingham.

This is the latest version of this item.

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

Abstract

Office Space Allocation (OSA) is the task of efficient usage of spatial resources of an organisation. A common goal in a typical OSA problem is to minimise the wastage of space either by limiting the overuse or underuse of the facilities. The problem also contains a myriad of hard and soft constraints based on the preferences of respective organisations. In this thesis, the OSA variant usually encountered in academic institutions is investigated. Previous research in this area is rather sparse. This thesis provides a definition, extension, and literature review for the problem as well as a new parametrised data instance generator.

In this thesis, two main algorithmic approaches for tackling the OSA are proposed: The first one is integer linear programming. Based on the definition of several constraints and some additional variables, two different mathematical models are proposed. These two models are not strictly alternatives to each other. While one of them provides more performance for the types of instances it is applicable, it lacks generality. The other approach provides less performance; however, it is easier to apply this model to different OSA problems. The second algorithmic approach is based on metaheuristics. A three step process in heuristic development is followed. In the first step, general local search techniques (descent methods, threshold acceptance, simulated annealing, great deluge) traverse within the neighbourhood via random relocation and swap moves. The second step of heuristic development aims to investigate large sections of the whole neighbourhood greedily via very fast cost calculation, cost update, and search for best move procedures within an evolutionary local search framework. The final step involves refinements and hybridisation of best performing (in terms of solution quality) mathematical programming and meta-heuristic techniques developed in prior steps.

This thesis aims to be one of the pioneering works in the research area of OSA. The major contributions are: the analysis of the problem, a new parametrised data instance generator, mathematical programming models, and meta-heuristic approaches in order to extend the state-of-the art in this area.

Item Type: Thesis (University of Nottingham only) (PhD)
Supervisors: Landa-Silva, Dario
Keywords: Office buildings; Space (Architecture); Integer programming; Heuristic programming; Combinatorial optimization
Subjects: T Technology > T Technology (General)
Faculties/Schools: UK Campuses > Faculty of Science > School of Computer Science
Item ID: 13604
Depositing User: EP, Services
Date Deposited: 10 Feb 2014 10:59
Last Modified: 16 Dec 2017 13:27
URI: https://eprints.nottingham.ac.uk/id/eprint/13604

Available Versions of this Item

Actions (Archive Staff Only)

Edit View Edit View