Office space allocation optimization

摘要

In large organizations, the allocation of buildings and office space to departments and employees is a challenging task. Optimal office space allocation has the potential to maximize synergies between employees within an organization. In this paper, we study the performance of a greedy search algorithm and a tabu search algorithm for generating high quality solutions to the office space allocation problem. The objectives are to maximize synergies in the organization, minimize the overusage of limited office space and maximize the number of buildings and rooms that can be completely closed. Computational experiments show that a tabu search algorithm generates higher quality solutions than a greedy local search algorithm with the same computational budget.