Management Science
Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Extensions of a tabu search adaptation to the quadratic assignment problem
Computers and Operations Research - Special issue: heuristic, genetic and tabu search
P-Complete Approximation Problems
Journal of the ACM (JACM)
Computers and Operations Research
Improved Tabu search heuristics for the dynamic space allocation problem
Computers and Operations Research
Hi-index | 0.02 |
The dynamic space allocation problem (DSAP) presented here is a relatively new problem in the literature. It looks at the optimization of space/resource assignments during the implementation of project activities. More specifically, the DSAP assigns project activities and their required resources to workspaces and idle resources to storage spaces with respect to minimizing the sum of the distances the resources travel. In this paper, construction algorithms and a tabu search heuristic are presented for the DSAP, and a set of test problems taken from the literature is used to test the performances of the heuristics. The results show that the proposed tabu search heuristic clearly outperforms the techniques (i.e., simulated annealing heuristics) presented in the literature with respect to solution quality and computation time.