A tabu search heuristic for the dynamic space allocation problem

Authors:
Alan R. McKendall, Jr.;J. R. Jaramillo
Affiliations:
Department of Industrial & Management Systems Engineering, West Virginia University, 325A Mineral Resources Building, Morgantown, WV 26506, USA;Department of Industrial & Management Systems Engineering, West Virginia University, 325A Mineral Resources Building, Morgantown, WV 26506, USA
Venue:
Computers and Operations Research
Year:
2006

Citing 5
Cited 3

The dynamics of plant layout

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)
Simulated annealing heuristics for managing resources during planned outages at electric power plants

Computers and Operations Research

A heuristics method based on ant colony optimisation for redundancy allocation problems

International Journal of Computer Applications in Technology
The dynamic space allocation problem: Applying hybrid GRASP and Tabu search metaheuristics

Computers and Operations Research
Cell assignment in hybrid CMOS/nanodevices architecture using Tabu Search

Applied Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.