DARIO LANDA SILVA DARIO.LANDASILVA@NOTTINGHAM.AC.UK
Professor of Computational Optimisation
Asynchronous cooperative local search for the office-space-allocation problem
Landa-Silva, Dario; Burke, Dmund K.
Authors
Dmund K. Burke
Abstract
We investigate cooperative local search to improve upon known results of the office-space-allocation problem in universities and other organizations. A number of entities (e.g., research students, staff, etc.) must be allocated into a set of rooms so that the physical space is utilized as efficiently as possible while satisfying a number of hard and soft constraints. We develop an asynchronous cooperative local search approach in which a population of local search threads cooperate asynchronously to find better solutions. The approach incorporates a cooperation mechanism in which a pool of genes (parts of solutions) is shared to improve the global search strategy. Our implementation is single-processor and we show that asynchronous cooperative search is also advantageous in this case. We illustrate this by extending four single-solution metaheuristics (hill-climbing, simulated annealing, tabu search, and a hybrid metaheuristic) to population-based variants using our asynchronous cooperative mechanism. In each case, the population-based approach performs better than the single-solution one using comparable computation time. The asynchronous cooperative metaheuristics developed here improve upon known results for a number of test instances. © 2007 INFORMS.
Citation
Landa-Silva, D., & Burke, D. K. (2007). Asynchronous cooperative local search for the office-space-allocation problem. INFORMS Journal on Computing, 19(4), 575-587. https://doi.org/10.1287/ijoc.1060.0200
Journal Article Type | Article |
---|---|
Acceptance Date | Jul 1, 2006 |
Online Publication Date | Nov 1, 2007 |
Publication Date | Oct 1, 2007 |
Deposit Date | Feb 10, 2020 |
Journal | INFORMS Journal on Computing |
Print ISSN | 1091-9856 |
Electronic ISSN | 1526-5528 |
Publisher | INFORMS |
Peer Reviewed | Peer Reviewed |
Volume | 19 |
Issue | 4 |
Pages | 575-587 |
DOI | https://doi.org/10.1287/ijoc.1060.0200 |
Public URL | https://nottingham-repository.worktribe.com/output/3088181 |
Publisher URL | https://pubsonline.informs.org/doi/10.1287/ijoc.1060.0200 |
You might also like
Evolving Deep CNN-LSTMs for Inventory Time Series Prediction
(2019)
Conference Proceeding
An agent based modelling approach for the office space allocation problem
(2018)
Conference Proceeding
Lookahead policy and genetic algorithm for solving nurse rostering problems
(2018)
Conference Proceeding
A genetic algorithm with composite chromosome for shift assignment of part-time employees
(2018)
Conference Proceeding
Downloadable Citations
About Repository@Nottingham
Administrator e-mail: digital-library-support@nottingham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search