Probabilistic Move Selection in Tabu Search for Zero-One Mixed Integer Programming Problems

  • Arne Løkketangen
  • Fred Glover
Chapter

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.

Keywords

Heuristics Integer Programming Probabilistic Tabu Search 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.Google Scholar
  2. E. Balas and C. Martin, Pivot and Complement — Heuristic for 0–1 Programming. Management Science 26, No. 1 (1980), pp 86–96.CrossRefGoogle Scholar
  3. D. Connolly, General Purpose Simulated Annealing. Journal of the Operational Research Society, Vol. 43, No. 5, (1992), pp 495–505.Google Scholar
  4. K. A. Dowsland, Simulated Annealing, in: Modern Heuristics for Combinatorial Problems, ed. C. R. Reeves, (Blackwell, Oxford, 1993).Google Scholar
  5. A. Drexl, A Simulated Annealing Approach to the Multi-constraint Zero-One Knapsack Problem. Computing 40 (1988), pp 1–8.CrossRefGoogle Scholar
  6. 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.CrossRefGoogle Scholar
  7. F. Glover, Tabu Search — Part I. ORSA Journal of Computing. Vol 1, No. 3 (1989), pp 190–206.Google Scholar
  8. F. Glover, Tabu Thresholding: Improving Search by Nonmonotonic Trajectories. Working paper, University of Colorado at Boulder (1994). (To appear in ORSA Journal on Computing).Google Scholar
  9. F. Glover and M. Laguna, Tabu Search, in: Modern Heuristics for Combinatorial Problems, ed. C. R. Reeves, (Blackwell, Oxford, 1993).Google Scholar
  10. F. Glover, M. Laguna, E. Taillard and D. de Werra. Annals of Operations Research, Vol 41. (J. C. Baltzer AG, 1993).Google Scholar
  11. 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).Google Scholar
  12. 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).Google Scholar
  13. 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.Google Scholar
  14. 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.CrossRefGoogle Scholar
  15. J. P. Hart and A. W. Shogan, Semi-Greedy Heuristics: An Empirical Study. Operations Research Letters, Vol. 6, No. 3, (1987), pp 107–114CrossRefGoogle Scholar
  16. 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.CrossRefGoogle Scholar
  17. 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.CrossRefGoogle Scholar
  18. R. E. Marsten. XMP Technical Reference Manual, XMP Software. (1989a).Google Scholar
  19. R. E. Marsten. User’s Manual for ZOOM/XMP, XMP Software. (1989b).Google Scholar

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Arne Løkketangen
    • 1
  • Fred Glover
    • 2
  1. 1.Institute of InformaticsMolde CollegeNorway
  2. 2.School of Business, CB 419University of Colorado at BoulderBoulderUSA

Personalised recommendations