TY - GEN
T1 - Office-space-allocation problem using harmony search algorithm
AU - Awadallah, Mohammed A.
AU - Khader, Ahamad Tajudin
AU - Al-Betar, Mohammed Azmi
AU - Woon, Phuah Chea
PY - 2012
Y1 - 2012
N2 - Office-Space-Allocation problem is a distribution of a set of limited spaces to a set of resources subject to two types of constraints: hard and soft. Hard constraints must be fulfilled while the soft constraints to be satisfied as much as possible. The quality of the solution is determined based on satisfaction of the soft constraints and the best usage of spaces. The harmony search algorithm (HSA) is a population-based metaheuristic inspired by a musical improvisation process. At each iteration, three operators are used to generate the new harmony: memory consideration, random consideration, and pitch adjustment. In this paper, we modify the memory consideration operator to select from the best solution in the population during the search. HSA is evaluated by using three datasets from Nottingham, and Wolverhampton universities. Experimentally, the HSA obtained new results for two datasets, and a comparable result for the third dataset.
AB - Office-Space-Allocation problem is a distribution of a set of limited spaces to a set of resources subject to two types of constraints: hard and soft. Hard constraints must be fulfilled while the soft constraints to be satisfied as much as possible. The quality of the solution is determined based on satisfaction of the soft constraints and the best usage of spaces. The harmony search algorithm (HSA) is a population-based metaheuristic inspired by a musical improvisation process. At each iteration, three operators are used to generate the new harmony: memory consideration, random consideration, and pitch adjustment. In this paper, we modify the memory consideration operator to select from the best solution in the population during the search. HSA is evaluated by using three datasets from Nottingham, and Wolverhampton universities. Experimentally, the HSA obtained new results for two datasets, and a comparable result for the third dataset.
KW - Harmony search
KW - Office-Space-Allocation
KW - Population-based
UR - https://www.scopus.com/pages/publications/84869062841
U2 - 10.1007/978-3-642-34481-7_45
DO - 10.1007/978-3-642-34481-7_45
M3 - Conference contribution
AN - SCOPUS:84869062841
SN - 9783642344800
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 365
EP - 374
BT - Neural Information Processing - 19th International Conference, ICONIP 2012, Proceedings
T2 - 19th International Conference on Neural Information Processing, ICONIP 2012
Y2 - 12 November 2012 through 15 November 2012
ER -