Name
Title | ||
|---|---|---|
Designing difficult office space allocation problem instances with mathematical programming |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-20662-7_24 | SEA |
Keywords | Field | DocType |
test instance,office space allocation,mathematical programming approach,room space,space misuse,important combinatorial optimisation problem,additional constraint,space utilisation,OSA problem instance,constraint violation,difficult office space allocation | Mathematical optimization,Computer science,Space allocation,Integer programming | Conference |
Volume | ISSN | Citations |
6630 | 0302-9743 | 2 |
PageRank | References | Authors |
0.43 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Özgür Ülker | 1 | 39 | 2.91 |
| Dario Landa Silva | 2 | 316 | 28.38 |