Skip to main content

Tabu Search

  • Chapter
  • First Online:
Handbook of Metaheuristics

Abstract

This chapter presents the fundamental concepts of tabu search (TS) in a tutorial fashion. Special emphasis is put on showing the relationships with classical local search methods and on the basic elements of any TS heuristic, namely the definition of the search space, the neighborhood structure, and the search memory. Other sections cover other important concepts such as search intensification and diversification and provide references to significant work on TS. Recent advances in TS are also briefly discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

References

  1. Ahuja, R.K., Ergun, O., Orlin, J.B., Punnen A.P.: A survey of very large-scale neighborhood search techniques. Discrete Appl. Math. 123, 75–102 (2002)

    Article  Google Scholar 

  2. Aringhieri, R.: Solving chance-constrained programs combining tabu search and simulation. Lect. Notes Comput. Sci. 3059, 30–41 (2004)

    Article  Google Scholar 

  3. de Backer, B., Furnon, V., Shaw, P., Kilby P., Prosser P.: Solving vehicle routing problems using constraint programming and metaheuristics. J. Heuristics 6, 501–523 (2000)

    Article  Google Scholar 

  4. Battiti, R., Tecchiolli, G.: The reactive tabu search. ORSA J. Comput. 6, 126–140 (1994)

    Google Scholar 

  5. Battiti, R., Tecchiolli, G.: The continuous reactive tabu search: blending combinatorial optimization and stochastic search for global optimization. Ann. Oper. Res. 63, 151–188 (1996)

    Article  Google Scholar 

  6. Bräysy, O., Gendreau, M.: Tabu search heuristics for the vehicle routing problem with time windows. TOP 10, 211–237 (2002)

    Article  Google Scholar 

  7. Caseau Y., Laburthe, F., Le Pape, C., Rottembourg, B.: Combining local and global search in a constraint programming environment. Knowl. Eng. Rev. 16, 41–68 (2001)

    Article  Google Scholar 

  8. Chelouah, R., Siarry, P.: Tabu Search applied to global optimization. Eur. J. Oper. Res. 123, 256–270 (2000)

    Article  Google Scholar 

  9. Chelouah, R., Siarry, P.: A hybrid method combining continuous tabu search and Nelder-Mead simplex algorithms for the global optimization of multiminima functions. Eur. J. Oper. Res. 161, 636–654 (2005)

    Article  Google Scholar 

  10. Cordeau, J.-F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30, 105–119 (1997)

    Article  Google Scholar 

  11. Cordeau, J.-F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52, 928–936 (2001)

    Article  Google Scholar 

  12. Crainic, T.G., Gendreau, M.: Towards an evolutionary method–-Cooperative multi-thread parallel tabu search heuristic hybrid. In: Voss, S., Martello, S., Osman, H.I., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 331–344. Kluwer, Boston (1999)

    Chapter  Google Scholar 

  13. Crainic, T.G., Gendreau, M., Farvolden, J.M.: Simplex-based tabu search for the multicommodity capacitated fixed charge network design problem. INFORMS J. Comput. 12, 223–236 (2000)

    Article  Google Scholar 

  14. Crainic, T.G., Gendreau, M., Rousseau, L.-M. Special issuse on Recent advances in metaheuristics. J. Heuristics 16(3), 235–535 (2010)

    Article  Google Scholar 

  15. Crainic, T.G., Gendreau, M., Soriano, P., Toulouse, M.: A tabu search procedure for multicommodity location/allocation with balancing requirements. Ann. Oper. Res. 41, 359–383 (1993)

    Article  Google Scholar 

  16. Crainic, T.G., Toulouse, M., Gendreau, M.: Toward a taxonomy of parallel tabu search heuristics. INFORMS J. Comput. 9, 61–72 (1997)

    Article  Google Scholar 

  17. Cung, V.-D., Martins, S.L., Ribeiro, C.C., Roucairol, C.: Strategies for the parallel implementation of metaheuristics. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 263–308. Kluwer, Boston (2002)

    Google Scholar 

  18. Doerner, K.F., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R.F., Reimann, M.: Metaheuristics–-Progress in Complex Systems Optimization, Springer, New York, NY (2007)

    Google Scholar 

  19. Fleurent, C., Ferland, J.A.: Genetic and hybrid algorithms for graph colouring. Ann. Oper. Res. 63, 437–461 (1996)

    Article  Google Scholar 

  20. Fu, Z., Eglese, R., Li, L.Y.O.: A unified tabu search algorithm for vehicle routing problems with soft time windows. J. Oper. Res. Soc. 59, 663–673 (2008)

    Article  Google Scholar 

  21. Gendreau, M.: Recent advances in tabu search. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 369–377. Kluwer, Boston (2002)

    Google Scholar 

  22. Gendreau, M., Guertin, F., Potvin, J.-Y., Séguin, R.: Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transp. Res. Part C: Emerg. Technol. 14, 157–174 (2006)

    Article  Google Scholar 

  23. Gendreau, M., Guertin, F., Potvin, J.-Y., Taillard, é.D.: Parallel tabu search for real-time vehicle routing and dispatching. Transp. Sci. 33, 381–390 (1999)

    Article  Google Scholar 

  24. Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Manage. Sci. 40, 1276–1290 (1994)

    Article  Google Scholar 

  25. Gendreau, M., Laporte, G., Potvin, J.-Y.: Metaheuristics for the capacitated VRP. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, pp. 129–154. SIAM, Philadelphia (2002)

    Google Scholar 

  26. Gendreau, M., Potvin, J.-Y.: Tabu search. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies–-Introductory Tutorials in Optimization and Decision Support Techniques, pp. 165–186. Springer, New York, NY (2005)

    Google Scholar 

  27. Gendreau, M., Soriano, P., Salvail, L.: Solving the maximum clique problem using a tabu search approach. Ann. Oper. Res. 41, 385–403 (1993)

    Article  Google Scholar 

  28. Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8, 156–166 (1977)

    Article  Google Scholar 

  29. Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13, 533–549 (1986)

    Article  Google Scholar 

  30. Glover, F.: Tabu search–-Part I. ORSA J. Comput. 1, 190–206 (1989)

    Google Scholar 

  31. Glover, F.: Tabu search–-Part II. ORSA J. Comput. 2, 4–32 (1990)

    Google Scholar 

  32. Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Appl. Math. 65, 223–253 (1996)

    Article  Google Scholar 

  33. Glover, F., Laguna, M.: Tabu search. In: Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems, pp. 70–150. Blackwell Scientific Publications, Oxford (1993)

    Google Scholar 

  34. Glover, F., Laguna, M.: Tabu Search. Kluwer, Boston (1997)

    Book  Google Scholar 

  35. Glover, F., Laguna, M., Taillard, é.D., de Werra, D. Tabu search. Ann. Oper. Research 41, J.C. Baltzer AG Science Publishers, Basel (1993)

    Google Scholar 

  36. Glover, F., Taillard, é.D., de Werra, D.: A user’s guide to tabu search. Ann. Oper. Research 41, 3–28 (1993)

    Google Scholar 

  37. Grünert, T.: Lagrangean tabu search. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 379–397. Kluwer, Boston (2002)

    Google Scholar 

  38. Hansen, M.P.: Tabu search in multiobjective optimisation: MOTS. In: Proceedings of the 13th International Conference on Multiple Criteria Decision Making, pp. 574–586, Cape Town, South Africa (1997)

    Google Scholar 

  39. Hertz, A., de Werra, D.: The tabu search metaheuristic: how we used it. Ann. Math. Artif. Intell. 1, 111–121 (1991)

    Article  Google Scholar 

  40. Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  41. Ibaraki, T., Nonobe, K., Yagiura, M. Metaheuristics: Progress as Real Problem Solvers, Springer, New York, NY (2005)

    Google Scholar 

  42. Jaeggi, D.M., Parks, G.T., Kipouros, T., Clarkson, P.J.: The development of a multi-objective tabu search algorithm for continuous optimisation problems. Eur. J. Oper. Res. 185, 1192–1212 (2008)

    Article  Google Scholar 

  43. Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optim. Simulated Annealing. Science 220, 671–680 (1983)

    Google Scholar 

  44. Laporte, G., Osman, I.H. Metaheuristics in combinatorial optimization. Ann. Oper. Res. 63, J.C. Baltzer AG Science Publishers, Basel (1996)

    Google Scholar 

  45. Løkketangen, A., Glover, F.: Probabilistic move selection in tabu search for 0/1 mixed integer programming problems. In: Osman, I.H., Kelly, J.P. (eds.) Meta-Heuristics: Theory and Applications, pp. 467–488. Kluwer, Boston (1996)

    Google Scholar 

  46. Løkketangen, A., Woodruff, D.L.: Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming. J. Heuristics 2, 111–128 (1996)

    Article  Google Scholar 

  47. Osman, I.H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 41, 421–451 (1993)

    Article  Google Scholar 

  48. Osman, I.H., Kelly, J.P. Meta-heuristics: Theory and Applications. Kluwer, Boston (1996)

    Google Scholar 

  49. Pesant, G., Gendreau, M.: A constraint programming framework for local search methods. J. Heuristics 5, 255–280 (1999)

    Article  Google Scholar 

  50. Rego, C., Roucairol, C.: A parallel tabu search algorithm using ejection chains for the vehicle routing problem. In: Osman, I.H., Kelly, J.P. (eds.) Meta-heuristics: Theory and Applications, pp. 661–675. Kluwer, Boston (1996)

    Google Scholar 

  51. Resende, M.G.C., de Sousa, J.P. Metaheuristics–-Computer Decision Making. Kluwer, Boston (2004)

    Google Scholar 

  52. Ribeiro, C.C., Hansen, P. Essays and Surveys in Metaheuristics. Kluwer, Boston (2002)

    Google Scholar 

  53. Rochat, Y., Taillard, é.D.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147–167 (1995)

    Article  Google Scholar 

  54. Rolland, E.: A tabu search method for constrained real-number search: Applications to portfolio selection. Technical Report, Department of Accounting and Management Information Systems, Ohio State University, Columbus (1997)

    Google Scholar 

  55. Skorin-Kapov, J.: Tabu search applied to the quadratic assignment problem. ORSA J. Comput. 2, 33–45 (1990)

    Google Scholar 

  56. Soriano, P., Gendreau, M.: Diversification strategies in tabu search algorithms for the maximum clique problem. Ann. Oper. Res. 63, 189–207 (1996)

    Article  Google Scholar 

  57. Soriano, P., Gendreau, M.: Fondements et applications des méthodes de recherche avec tabous. RAIRO (Recherche opérationnelle) 31, 133–159 (1997) (in French)

    Google Scholar 

  58. Taillard, é.D.: Some efficient heuristic methods for the flow shop sequencing problem. Eur. J. Oper. Res. 47, 65–74 (1990)

    Article  Google Scholar 

  59. Taillard, é.D.: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17, 443–455 (1991)

    Article  Google Scholar 

  60. Taillard, é.D., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.-Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31, 170–186 (1997)

    Article  Google Scholar 

  61. Tarantilis, C.D., Kiranoudis, C.T.: BoneRoute–-An adaptive memory-based method for effective fleet management. Ann. Oper. Res. 115, 227–241 (2002)

    Article  Google Scholar 

  62. Toth, P., Vigo, D. The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2002)

    Google Scholar 

  63. Toth, P., Vigo, D.: The granular tabu search and its application to the vehicle routing problem. INFORMS J. Comput. 15, 333–346 (2003)

    Article  Google Scholar 

  64. Voss, S., Martello, S., Osman, I.H., Roucairol, C. Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer, Boston (1999)

    Google Scholar 

  65. de Werra, D., Hertz, A.: Tabu search techniques: a tutorial and an application to neural networks. OR Spektrum 11, 131–141 (1989)

    Article  Google Scholar 

Download references

Acknowledgements

The authors are grateful to the Canadian Natural Sciences and Engineering Research Council for their financial support. The authors also wish to thank Fred Glover for his insightful comments on an earlier version of this chapter.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michel Gendreau .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Gendreau, M., Potvin, JY. (2010). Tabu Search. In: Gendreau, M., Potvin, JY. (eds) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol 146. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-1665-5_2

Download citation

Publish with us

Policies and ethics