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
A dynamic tabu search for large-scale generalised assignment problems
Computers and Operations Research
Computers and Operations Research
A tabu search heuristic for the dynamic space allocation problem
Computers and Operations Research
Paper: Robust taboo search for the quadratic assignment problem
Parallel Computing
The dynamic space allocation problem: Applying hybrid GRASP and Tabu search metaheuristics
Computers and Operations Research
| Hi-index | 0.01 |
The dynamic space allocation problem (DSAP) presented in this paper considers the task of assigning items (resources) to locations during a multi-period planning horizon such that the cost of rearranging the items is minimized. Three tabu search heuristics are presented for this problem. The first heuristic is a simple basic tabu search heuristic. The second heuristic adds diversification and intensification strategies to the first, and the third heuristic is a probabilistic tabu search heuristic. To test the performances of the heuristics, a set of test problems from the literature is used in the analysis. The results show that the tabu search heuristics are efficient techniques for solving the DSAP. More importantly, the proposed tabu search heuristic with diversification/intensification strategies found new best solutions using less computation time for one-half of all the test problems.