![A tabu search heuristic for the dynamic space allocation problem [An article from: Computers and Operations Research]](https://www.ebooknetworking.net/books/B00/0RR/bigB000RR7S10.jpg)
A tabu search heuristic for the dynamic space allocation problem [An article from: Computers and Operations Research]
Price not available for France
You can still browse on Amazon. Try another country above.
Book Details
Author(s)
A.R. McKendall, J.R. Jaramillo
Publisher
Elsevier
ISBN / ASIN
B000RR7S10
ISBN-13
978B000RR7S18
Marketplace
France 🇫🇷
Ratings & Reviews
No reviews yet — be the first!
No reviews yet.
Description
This digital document is a journal article from Computers and Operations Research, published by Elsevier in . The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
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.
Description:
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.
