Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Space Allocation: An Analysis of Higher Education Requirements
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Three Methods to Automate the Space Allocation Process in UK Universities
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Asynchronous Cooperative Local Search for the Office-Space-Allocation Problem
INFORMS Journal on Computing
The office-space-allocation problem in strongly hierarchized organizations
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Hi-index | 0.00 |
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.