New bounds for Office Space Allocation using Tabu search

Francisco Castillo, María Cristina Riff, Elizabeth Montero

Resultado de la investigación: Conference contribution

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 originalEnglish
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
EstadoPublished - 20 jul 2016
Evento2016 Genetic and Evolutionary Computation Conference, GECCO 2016 - Denver, United States
Duración: 20 jul 201624 jul 2016

Conference

Conference2016 Genetic and Evolutionary Computation Conference, GECCO 2016
PaísUnited States
CiudadDenver
Período20/07/1624/07/16

Huella dactilar

Tabu search
Combinatorial optimization
Tuning

ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Software

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
Castillo, Francisco ; Riff, María Cristina ; Montero, Elizabeth. / New bounds for Office Space Allocation using Tabu search. GECCO 2016 - Proceedings of the 2016 Genetic and Evolutionary Computation Conference. editor / Tobias Friedrich. Association for Computing Machinery, Inc, 2016. pp. 869-876
@inproceedings{6a865856eb4247bba77c88ff6c9a2cc4,
title = "New bounds for Office Space Allocation using Tabu search",
abstract = "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.",
keywords = "Greedy, Local search, Office space allocation, Tabu search",
author = "Francisco Castillo and Riff, {Mar{\'i}a Cristina} and Elizabeth Montero",
year = "2016",
month = "7",
day = "20",
doi = "10.1145/2908812.2908932",
language = "English",
pages = "869--876",
editor = "Tobias Friedrich",
booktitle = "GECCO 2016 - Proceedings of the 2016 Genetic and Evolutionary Computation Conference",
publisher = "Association for Computing Machinery, Inc",

}

Castillo, F, Riff, MC & 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. Association for Computing Machinery, Inc, pp. 869-876, 2016 Genetic and Evolutionary Computation Conference, GECCO 2016, Denver, United States, 20/07/16. https://doi.org/10.1145/2908812.2908932

New bounds for Office Space Allocation using Tabu search. / Castillo, Francisco; Riff, María Cristina; Montero, Elizabeth.

GECCO 2016 - Proceedings of the 2016 Genetic and Evolutionary Computation Conference. ed. / Tobias Friedrich. Association for Computing Machinery, Inc, 2016. p. 869-876.

Resultado de la investigación: Conference contribution

TY - GEN

T1 - New bounds for Office Space Allocation using Tabu search

AU - Castillo, Francisco

AU - Riff, María Cristina

AU - Montero, Elizabeth

PY - 2016/7/20

Y1 - 2016/7/20

N2 - 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.

AB - 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.

KW - Greedy

KW - Local search

KW - Office space allocation

KW - Tabu search

UR - http://www.scopus.com/inward/record.url?scp=84985904989&partnerID=8YFLogxK

U2 - 10.1145/2908812.2908932

DO - 10.1145/2908812.2908932

M3 - Conference contribution

SP - 869

EP - 876

BT - GECCO 2016 - Proceedings of the 2016 Genetic and Evolutionary Computation Conference

A2 - Friedrich, Tobias

PB - Association for Computing Machinery, Inc

ER -

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