article

Improved Tabu search heuristics for the dynamic space allocation problem

Author:

Alan R. McKendall Jr.Authors Info & Claims

Computers and Operations Research, Volume 35, Issue 10

Pages 3347 - 3359

https://doi.org/10.1016/j.cor.2007.03.002

Published: 01 October 2008 Publication History

Abstract

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.

References

[1]

McKendall, A.R., Noble, J.S. and Klein, C.M., Simulated annealing heuristics for managing resources during planned outages at electric power plants. Computers & Operations Research. v32 i1. 107-125.

[2]

McKendall, A.R. and Jaramillo, J.R., A tabu search heuristic for the dynamic space allocation problem. Computers & Operations Research. v33 i3. 768-789.

[3]

Patterson, J.H. and Huber, W.D., A horizon-varying zero-one approach to project scheduling. Management Science. v20 i6. 990-998.

[4]

Koopmans, T. and Beckmann, M., Assignment problems and the location of economic activities. Econometrica. v25. 53-76.

[5]

Rosenblatt, M.J., The dynamics of plant layout. Management Science. v32 i1. 76-86.

[6]

Lee C-G, Ma Z. The generalized quadratic assignment problem. Working paper, Department of Mechanical and Industrial Engineering, University of Toronto; 2005.

[7]

Gharbi, A., Pellerin, R. and Villeneuve, L., A new constraint-based approach for overhaul project scheduling with work space constraints. International Journal of Industrial Engineering. v6 i2. 123-131.

[8]

Zouein, P.P. and Tommelein, I.D., Dynamic layout planning using a hybrid incremental solution method. Journal of Construction Engineering and Management. v125 i6. 400-408.

[9]

Glover, F., Future paths for integer programming and links to artificial intelligence. Computers & Operations Research. v1 i3. 533-549.

[10]

Skorin-Kapov, J., Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing. v2. 33-45.

[11]

Taillard, E., Robust taboo search for the quadratic assignment problem. Parallel Computing. v17. 443-455.

[12]

Battiti, R. and Tecchiolli, G., The reactive tabu search. ORSA Journal on Computing. v6. 126-140.

[13]

Skorin-Kapov, J., Extensions of a tabu search adaptation to the quadratic assignment problem. Computers & Operations Research. v21 i8. 855-865.

[14]

Chiang, W-C. and Kouvelis, P., An improved tabu search heuristic for solving facility layout design problems. International Journal of Production Research. v34 i9. 2565-2585.

[15]

Chiang, W-C. and Chiang, C., Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation. European Journal of Operational Research. v106. 457-488.

[16]

Kaku, B.K. and Mazzola, J.B., A tabu-search heuristic for the dynamic plant layout problem. INFORMS Journal on Computing. v9 i4. 374-384.

[17]

Osman, I.H., Heuristics for the generalized assignment problem: simulated annealing and tabu search approaches. OR Spektrum. v17. 211-225.

[18]

Laguna, M., Kelly, J.P., Gonzalez-Velarde, J.L. and Glover, F., Tabu search for the multilevel generalized assignment problem. European Journal of Operational Research. v82. 176-189.

[19]

Diaz, J.A. and Fernandez, E., A tabu search heuristic for the generalized assignment problem. European Journal of Operational Research. v132. 22-38.

[20]

Higgins, A.J., A dynamic tabu search for large-scale generalized assignment problems. Computers & Operations Research. v28. 1039-1048.

[21]

Lim, A., Rodrigues, B., Xiao, F. and Zhu, Y., Crane scheduling with spatial constraints. Naval Research Logistics. v51. 386-406.

Cited By

Hu MChen MKu M(2016)Storage Location Assignment and I/O Location Design on Storage PlanningInternational Journal of Information Systems and Supply Chain Management10.4018/IJISSCM.20161001039:4(43-57)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.4018/IJISSCM.2016100103
da Silva GBahiense LSatoru Ochi LBoaventura-Netto P(2012)The dynamic space allocation problemComputers and Operations Research10.1016/j.cor.2011.05.01639:3(671-677)Online publication date: 1-Mar-2012
https://dl.acm.org/doi/10.1016/j.cor.2011.05.016

Index Terms

Improved Tabu search heuristics for the dynamic space allocation problem
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies
2. Mathematics of computing
  1. Probability and statistics
    1. Probabilistic algorithms
    2. Probabilistic reasoning algorithms
      1. Markov-chain Monte Carlo methods
      2. Sequential Monte Carlo methods

Recommendations

A tabu search heuristic for the dynamic space allocation problem

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 ...
An efficient tabu search for solving the uncapacitated single allocation hub location problem

Given an efficient tabu search the uncapacitated single allocation hub location problem.Given some new tabu rules.Given some new theoretical results for computing the changes in the objective function's value for three types of moves.Improved the best ...
The dynamic space allocation problem

This work is devoted to the Dynamic Space Allocation Problem, where project duration is divided into a number of consecutive periods, each of them associated with a number of activities. The resources required by the activities have to be available in ...

Comments

Information & Contributors

Information

Published In

Copyright © Elsevier Ltd © 2007.

Publisher

Elsevier Science Ltd.

United Kingdom

Publication History

Published: 01 October 2008

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Hu MChen MKu M(2016)Storage Location Assignment and I/O Location Design on Storage PlanningInternational Journal of Information Systems and Supply Chain Management10.4018/IJISSCM.20161001039:4(43-57)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.4018/IJISSCM.2016100103
da Silva GBahiense LSatoru Ochi LBoaventura-Netto P(2012)The dynamic space allocation problemComputers and Operations Research10.1016/j.cor.2011.05.01639:3(671-677)Online publication date: 1-Mar-2012
https://dl.acm.org/doi/10.1016/j.cor.2011.05.016

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents