New bounds for Office Space Allocation using Tabu search

Francisco Castillo, María Cristina Riff, Elizabeth Montero

Resultado de la investigación: Contribución a los tipos de informe/libroContribución a la conferencia

1 Cita (Scopus)

Resumen

The Office Space Allocation problem is a combinatorial optimization problem which focuses into determining the way to assign spaces to entities in order to optimize the use of available space in an organization. This allocation process considers a set of preferences, constraints and requirements. In this paper we propose a metaheuristic approach that includes a construction step and an improvement step, based on Greedy and Tabu Search techniques respectively. Here, we propose a construction method specially designed to deal with the misused space and hard/soft constraints of the problem. Then, Tabu Search performs a fast analysis that allows it to find good quality neighborhoods to analyze. We used an automated tuning method to determine the best parameter values for the entire set of benchmarks. Results show that our approach was able to obtain new lower bounds for seven problem instances.

Idioma originalInglés
Título de la publicación alojadaGECCO 2016 - Proceedings of the 2016 Genetic and Evolutionary Computation Conference
EditoresTobias Friedrich
EditorialAssociation for Computing Machinery, Inc
Páginas869-876
Número de páginas8
ISBN (versión digital)9781450342063
DOI
EstadoPublicada - 20 jul 2016
Evento2016 Genetic and Evolutionary Computation Conference, GECCO 2016 - Denver, Estados Unidos
Duración: 20 jul 201624 jul 2016

Conferencia

Conferencia2016 Genetic and Evolutionary Computation Conference, GECCO 2016
PaísEstados Unidos
CiudadDenver
Período20/07/1624/07/16

Áreas temáticas de ASJC Scopus

  • Informática aplicada
  • Teoría computacional y matemáticas
  • Software

Huella Profundice en los temas de investigación de 'New bounds for Office Space Allocation using Tabu search'. En conjunto forman una huella única.

  • Citar esto

    Castillo, F., Riff, M. C., & Montero, E. (2016). New bounds for Office Space Allocation using Tabu search. En T. Friedrich (Ed.), GECCO 2016 - Proceedings of the 2016 Genetic and Evolutionary Computation Conference (pp. 869-876). Association for Computing Machinery, Inc. https://doi.org/10.1145/2908812.2908932