Abstract
We extend our previous work applying first-level Tabu Search mechanisms to 0/1 MIP problems, introducing probabilistic measures for move selection. These are especially applicable when the move evaluation function is contaminated by noise or contains elements not directly related to the objective function value. We also look at the possibility of replacing tabu memory completely by associated probabilistic guidance. Our approach is designed with the ability to solve general 0/1 MCP problems, and thus contains no problem domain specific knowledge. The outcome improves significantly on the solutions obtained by the first-level Tabu Search mechanisms previously employed. The probabilistic measures are extremely simple to implement, and can be readily incorporated in standard Tabu Search designs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Aboudi and K. Jörnsten, Tabu Search for general Zero-One Integer Programs using the Pivot and Complement Heuristic. ORSA Journal on Computing, Vol 6, No. 1 (1994), pp 82–93.
E. Balas and C. Martin, Pivot and Complement — Heuristic for 0–1 Programming. Management Science 26, No. 1 (1980), pp 86–96.
D. Connolly, General Purpose Simulated Annealing. Journal of the Operational Research Society, Vol. 43, No. 5, (1992), pp 495–505.
K. A. Dowsland, Simulated Annealing, in: Modern Heuristics for Combinatorial Problems, ed. C. R. Reeves, (Blackwell, Oxford, 1993).
A. Drexl, A Simulated Annealing Approach to the Multi-constraint Zero-One Knapsack Problem. Computing 40 (1988), pp 1–8.
M. Gendreau, A. Hertz and G. Laporte, A Tabu Search Heuristic for the Vehicle Routing Problem. Management Science, Vol 40, No. 10, (1994), pp 1276–1290.
F. Glover, Tabu Search — Part I. ORSA Journal of Computing. Vol 1, No. 3 (1989), pp 190–206.
F. Glover, Tabu Thresholding: Improving Search by Nonmonotonic Trajectories. Working paper, University of Colorado at Boulder (1994). (To appear in ORSA Journal on Computing).
F. Glover and M. Laguna, Tabu Search, in: Modern Heuristics for Combinatorial Problems, ed. C. R. Reeves, (Blackwell, Oxford, 1993).
F. Glover, M. Laguna, E. Taillard and D. de Werra. Annals of Operations Research, Vol 41. (J. C. Baltzer AG, 1993).
F. Glover and A. Løkketangen. Solving Zero-One Mixed Integer Programming Problems using Tabu Search. Working Paper, Institute of Informatics, Molde College, Norway, (1995a).
F. Glover and A. Løkketangen. Probabilistic Tabu Search for Zero-One Mixed Integer Programming Problems. Working Paper, Institute of Informatics, Molde College, Norway, (1995b).
F. Glover, E. Taillard and D. de Werra. A User’s Guide to Tabu Search in: Annals of Operations Research, Vol 41, (1993), pp 3–28.
F. Glover and C. McMillan. The General Employee Scheduling Problem: An Integration of Management Science and Artificial Intelligence. Computers and Operations Research, Vol. 15, No. 5 (1986), 563–593.
J. P. Hart and A. W. Shogan, Semi-Greedy Heuristics: An Empirical Study. Operations Research Letters, Vol. 6, No. 3, (1987), pp 107–114
J.P. Kelly, B. Golden and A.A. Assad, Large-Scale Controlled Rounding Using Tabu Search with Strategic Oscillation. Annals of Operations Research. Vol. 41 (1993), pp 69–84.
A. Løkketangen, K. Jörnsten and S. Storøy. Tabu Search Within a Pivot and Complement Framework. International Transactions of Operations Research Vol. 1, No. 3, (1994), pp 305–316.
R. E. Marsten. XMP Technical Reference Manual, XMP Software. (1989a).
R. E. Marsten. User’s Manual for ZOOM/XMP, XMP Software. (1989b).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Løkketangen, A., Glover, F. (1996). Probabilistic Move Selection in Tabu Search for Zero-One Mixed Integer Programming Problems. In: Osman, I.H., Kelly, J.P. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1361-8_28
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1361-8_28
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8587-8
Online ISBN: 978-1-4613-1361-8
eBook Packages: Springer Book Archive