Improved Tabu search heuristics for the dynamic space allocation problem

@article{McKendall2008ImprovedTS,
  title={Improved Tabu search heuristics for the dynamic space allocation problem},
  author={Alan R. McKendall},
  journal={Computers & OR},
  year={2008},
  volume={35},
  pages={3347-3359}
}
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… CONTINUE READING

From This Paper

Topics from this paper.
2 Citations
0 References
Similar Papers

Similar Papers

Loading similar papers…