The Office-Space-Allocation Problem in Strongly Hierarchized Organizations

Lopes, Rui; Girimonte, Daniela

doi:10.1007/978-3-642-12139-5_13

Cited by 6 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They reported that tabu search performed better on their OSA problem instances. Lopes and Girimonte [14] analysed a variant of the OSA problem (similar to the one described in [12]) arising in the European Space Agency (ESA). They implemented four types of metaheuristics: hill climbing, simulated annealing, tabu search and the hybrid metaheuristic in [2].…”

Section: Outline Of Previous Related Workmentioning

confidence: 99%

Designing Difficult Office Space Allocation Problem Instances with Mathematical Programming

Ülker

Landa-Silva

2011

Experimental Algorithms

View full text Add to dashboard Cite

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.

show abstract

Section: Outline Of Previous Related Workmentioning

confidence: 99%

Designing Difficult Office Space Allocation Problem Instances with Mathematical Programming

Ülker

Landa-Silva

2011

Experimental Algorithms

View full text Add to dashboard Cite

show abstract

“…Lopes and Girimonte [15] extended the work in [14] to tackle the OSA problem in European Space Agency. In addition to the previous constraint types in the literature, the authors introduced a few new ones (grouping constraints at different levels, avoid spreading constraint to prevent the split of the departments and avoid sharing across constraint to prevent the sharing of offices between departments).…”

Section: Introductionmentioning

confidence: 99%

Evolutionary local search for solving the office space allocation problem

Ülker

Landa-Silva

2012

2012 IEEE Congress on Evolutionary Computation

View full text Add to dashboard Cite

Abstract-Office Space Allocation (OSA) is the task of correctly allocating the spatial resources of an institution to a set of entities by minimising the wastage of space and the violation of additional constraints. In this paper, an evolutionary local search algorithm is presented to tackle this problem. The evolutionary components of the algorithm include standard crossover and mutation operators and a relatively small population of individuals. The offspring produced by the evolutionary operators are subjected to a short but intense local search process. A very fast cost calculation method tailored for searching a large section of the search space is implemented. Extensive experimentation is carried out related to several parameters of the algorithm: the mutation rate, the population size, the length of the local search procedure after each mutation, hence the balance between the evolutionary and the local search stages, and the level of greediness of the local search process. The final results on 72 different data instances show that this hybrid evolutionary algorithm is very competitive with an integer programming model.

show abstract