Abstract
We review some of the main advances witnessed in the field of Tabu Search (TS) during the last four to five years. We focus on what we see as the most significant trends in the area, namely: techniques to make the search more effective, hybrid methods, and new applications of tabu search.
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.
Similar content being viewed by others
References
T.G. Crainic and M. Gendreau. Towards an Evolutionary Method — Cooperative Multi-Thread Parallel Tabu Search Heuristic Hybrid. In: Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, S. Voss, S. Martello, I.H. Osman, and C. Roucairol, editors, Kluwer, pages 331–344, 1999.
T.G. Crainic, M. Gendreau, and J.M. Farvolden. Simplex-Based Tabu Search for the Multicommodity Capacitated Fixed-Charge Problem. INFORMS Journal on Computing, 12:223–236, 2000.
T.G. Crainic, M. Toulouse, and M. Gendreau. Synchronous Tabu Search Parallelization Strategies for Multicommodity Location-Allocation with Balancing Requirements. OR Spektrum, 17:113–123, 1995.
T.G. Crainic, M. Toulouse, and M. Gendreau. Towards a Taxonomy of Parallel Tabu Search Heuristics. INFORMS Journal on Computing, 9:61–72, 1997.
M. Gendreau, F. Guertin, J.-Y. Potvin, and É. Taillard. Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching. Transportation Science, 33:381–390, 1999.
M. Gendreau, A. Hertz, and G. Laporte. A Tabu Search Heuristic for the Vehicle Routing Problem. Management Science, 40:1276–1290, 1994.
M. Gendreau, J.-F. Larochelle, and B. Sansò. A Tabu Search Heuristic for the Steiner Tree Problem. Networks, 34:163–172, 1999.
M. Gendreau and F.V. Louveaux. A Tabu Search Approach for Stochastic Integer Programming with Recourse. Extended Abstracts of the 2nd Meta-heuristics International Conference, page 287, Sophia-Antipolis, 1997.
F. Glover. Ejection Chains, Reference Structures and Alternating Path Methods for the Traveling Salesman Problem. University of Colorado. Shortened version published in: Discrete Applied Mathematics, 65:223–253, 1996.
F. Glover and M. Laguna. Tabu Search. In: Modern Heuristic Techniques for Combinatorial Problems, C. Reeves, editor, pages 70–141, Blackwell, 1993.
F. Glover and M. Laguna. Tabu Search. Kluwer, 1997.
T. Gruenert. Lagrangean Tabu Search. In: Essays and Surveys in Meta-heuristics, C.C. Ribeiro and P. Hansen, editors, Kluwer, 2001 (this volume).
A. LeBouthillier, T.G. Crainic, and R. Keller. Parallel Cooperative Evolutionary Algorithm for Vehicle Routing Problems with Time Windows. Paper presented at: Odysseus 2000, pages 78–81, Chania, 2000.
A. LeBouthillier. Modélisation UML pour une architecture coopérative appliquée au problème de tournées de véhicules avec fenêtres de temps. Publication CRT-2000–39, Centre de recherche sur les transports, Montréal, 2000.
L. Lopez, M.W. Carter, and M. Gendreau. The Hot Strip Mill Production Scheduling Problem: A Tabu Search Approach. European Journal of Operational Research, 106:317–335, 1998.
G. Pesant and M. Gendreau. A Constraint Programming Framework for Local Search Methods. Journal of Heuristics, 5:255–280, 1999.
Y. Rochat and É. Taillard. Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics, 1:147–167,1995.
T. Trafalis and I. Al-Harkan. A Continuous Scatter Search Approach for Global Optimization. Extended abstract in: Conference in Applied Mathematical Programming and Modeling (APMOD’95), London, 1995.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gendreau, M. (2002). Recent Advances in Tabu Search. In: Essays and Surveys in Metaheuristics. Operations Research/Computer Science Interfaces Series, vol 15. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1507-4_16
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1507-4_16
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5588-5
Online ISBN: 978-1-4615-1507-4
eBook Packages: Springer Book Archive