Designing Difficult Office Space Allocation Problem Instances with Mathematical Programming

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.

[1]  Edmund K. Burke,et al.  Combining Hybrid Metaheuristics and Populations for the Multiobjective Optimisation of Space Allocation Problems , 2001 .

[2]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling II , 1997, Lecture Notes in Computer Science.

[3]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[4]  Elia El-Darzi,et al.  An Integer Goal Programming Model to Allocate Offices to Staff in an Academic Institution , 1995 .

[5]  Edmund K. Burke,et al.  Asynchronous Cooperative Local Search for the Office-Space-Allocation Problem , 2007, INFORMS J. Comput..

[6]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[7]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation) , 2006 .

[8]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[9]  E.K. Burke,et al.  Hybrid population-based metaheuristic approaches for the space allocation problem , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[10]  Edmund K. Burke,et al.  Space Allocation: An Analysis of Higher Education Requirements , 1997, PATAT.

[11]  Dario Landa Silva,et al.  A 0/1 Integer Programming Model for the Office Space Allocation Problem , 2010, Electron. Notes Discret. Math..

[12]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[13]  Rui Pereira,et al.  Office space allocation optimization , 2010, 2010 IEEE Systems and Information Engineering Design Symposium.

[14]  Colin O. Benjamin,et al.  Planning Facilities at the University of Missouri-Rolla , 1992 .

[15]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[16]  Jens Gottlieb,et al.  Evolutionary Computation in Combinatorial Optimization , 2006, Lecture Notes in Computer Science.

[17]  Landa Silva,et al.  Metaheuristic and Multiobjective Approaches for Space Allocation , 2003 .

[18]  Rui Lopes,et al.  The Office-Space-Allocation Problem in Strongly Hierarchized Organizations , 2010, EvoCOP.

[19]  L. V. Wassenhove,et al.  A survey of algorithms for the generalized assignment problem , 1992 .

[20]  Edmund Ph. D. Burke,et al.  Practice and theory of automated timetabling II : second International Conference, PATAT '97, Toronto, Canada, August 20-22, 1997 : selected papers , 1998 .

[21]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling III , 2001, Lecture Notes in Computer Science.

[22]  Robert Jacobs,et al.  A Multiple Objective Approach to Space Planning for Academic Facilities , 1979 .

[23]  Peter I. Cowling,et al.  Three Methods to Automate the Space Allocation Process in UK Universities , 2000, PATAT.

[24]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.