Tabu search

Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques

Volumn , Issue , 2005, Pages 165-186

  Gendreau, Michel ^a   Potvin, Jean Yves ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 67650216888     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/0-387-28356-0_6     Document Type: Chapter

References (51)

1. Anderson, E. J., Glass, C. A. and Potts, C. N., 1997, Machine scheduling, in: Local Search in Combinatorial Optimization, E. H. L. Aarts and J. K. Lenstra, eds, Wiley, New York, pp. 361-414.
2. Battiti, R. and Tecchiolli, G., 1994, The reactive tabu search, ORSA J. Comput. 6:126-140.
3. Burke, E., De Causmaecker, P. and Vanden Berghe, G., 1999, A hybrid tabu search algorithm for the nurse rostering problem, in: Simulated Evolution and Learning, Selected papers from the 2nd Asia-Pacific Conf. on Simulated Evolution and Learning, SEAL '98, B. McKay, X. Yao, C. S. Newton, J.-H. Kim and T. Furuhashi, eds, Lecture Notes in Artificial Intelligence, Vol. 1585, Springer, Berlin, pp. 187-194.
4. Crainic, T. G. and Gendreau, M., 1999, 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, eds, Kluwer, Dordrecht, pp. 331-344.
5. Crainic, T. G., Gendreau, M. and Farvolden, J. M., 2000, Simplex-based tabu search for the multicommodity capacitated fixed charge network design problem, INFORMS J. Comput. 12:223-236.
6. Crainic, T. G., Gendreau, M., Soriano, P. and Toulouse, M., 1993, A tabu search procedure for multicommodity location/allocation with balancing requirements, Ann. Oper. Res. 41:359-383.
7. Crainic, T. G., Toulouse, M. and Gendreau, M., 1997, Toward a taxonomy of parallel tabu search heuristics, INFORMS J. Comput. 9:61-72.
8. Cung, V.-D., Martins, S. L., Ribeiro, C. C. and Roucairol, C, 2002, Strategies for the parallel implementation of metaheuristics, in: Essays and Surveys in Metaheuristics, C. C. Ribeiro and P. Hansen, eds, Kluwer, Dordrecht, pp. 263-308.
9. Dorigo, M., 1992, Optimization, learning and natural algorithms, Ph. D. Dissertation, Departimento di Elettronica, Politecnico di Milano, Italy.
10. Dueck, G. and Scheuer, T., 1990, Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing, J. Comput. Phys. 90:161-175.
11. Fleurent, C. and Ferland, J. A., 1996, Genetic and hybrid algorithms for graph colouring, Ann. Oper. Res. 63:437-461.
12. Friden, C, Hertz, A. and De Werra, D., 1989, STABULUS: A technique for finding stable sets in large graphs with tabu search, Computing 42:35-414.
13. Gandibleux, X., Jaszkiewicz, A., Freville, A. and Slowinski, R., eds, 2000, J. Heuristics 6:291-4431, Special issue: Multiple Objective Metaheuristics.
14. Gendreau, ML, 2002, Recent advances in tabu search, in: Essays and Surveys in Metaheuristics, C. C. Ribeiro and P. Hansen, eds, Kluwer, Dordrecht, pp. 369-377.
15. Gendreau, M., Guertin, F, Potvin, J.-Y. and Taillard, E. D., 1999, Parallel tabu search for real-time vehicle routing and dispatching, Transport. Sci. 33:381-390.
16. Gendreau, M., Hertz, A. and Laporte, G., 1994, A tabu search heuristic for the vehicle routing problem, Manage. Sci. 40:1276-1290.
17. Gendreau, M., Soriano, P. and Salvail, L., 1993, Solving the maximum clique problem using a tabu search approach, Ann. Oper. Res. 41:385-403.
18. Glover, F., 1977, Heuristics for integer programming using surrogate constraints, Decision Sci. 8:156-166.
19. Glover, E, 1986, Future paths for integer programming and links to artificial intelligence, Comput. Oper. Res. 13:533-549.
20. Glover, E, 1989, Tabu search-Part I, ORSA J. Comput. 1:190-206.
21. Glover, E, 1990, Tabu search-Part II, ORSA J. Comput. 2:4-32.
22. Glover, E, 1992, Ejection chains, reference structures and alternating path methods for traveling salesman problems, University of Colorado paper, shortened version published in Discr. Appl. Math. 65:223-253, 1996.
23. Glover, F. and Kochenberger, G. A., eds, 2003, Handbook of Metaheuristics, Kluwer, Boston.
24. Glover, E and Laguna, M., 1993, Tabu search, in: Modern Heuristic Techniques for Combinatorial Problems, C. R. Reeves, ed., Blackwell, Oxford, pp. 70-150.
25. Glover, E and Laguna, M., 1997, Tabu Search, Kluwer, Boston, MA.
26. Glover, E, Laguna, M., Taillard, E. D. and De Werra, D., eds, 1993a, Tabu Search, Annals of Operations Research, Vol. 41, Baltzer, Basel.
27. Glover, E, Taillard, E. D. and De Werra, D., 1993b, A user's guide to tabu search, Ann. Oper. Res. 41:3-28.
28. Griinert, T., 2002, Lagrangean tabu search, in: Essays and Surveys in Metaheuristics, C. C. Ribeiro and P. Hansen, eds, Kluwer, Dordrecht, pp. 379-397.
29. Hansen, P., 1986, The steepest ascent mildest descent heuristic for combinatorial programming, in: Proceedings of the Congress on Numerical Methods in Combinatorial Optimization, Capri, Italy.
30. Hertz, A. and De Werra, D, 1987, Using tabu search for graph coloring, Computing 39:345-351.
31. Hertz, A. and De Werra, D., 1991, The tabu search metaheuristic: how we used it, Ann. Math. Artif. Intell. 1:111-121.
32. Holland, J. H., 1975, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI.
33. Kirkpatrick, S., Gelatt Jr., C. D. and Vecchi, M. P., 1983, Optimization by simulated annealing, Science 220:671-680.
34. Laporte, G. and Osman, I. H., eds, 1996, Metaheuristics in Combinatorial Optimization, Annals of Operations Research, Vol. 63, Baltzer, Basel.
35. Lokketangen, A. and Glover, F., 1996, Probabilistic move selection in tabu search for 0/1 mixed integer programming problems, in: Meta-Heuristics: Theory and Applications, I. H. Osman and J. P. Kelly, eds, Kluwer, Dordrecht, pp. 467-488.
36. Lokketangen, A. and Woodruff, D. L., 1996, Progressive hedging and tabu search applied to mixed integer (0, 1) multistage stochastic programming, J. Heuristics 2:111-128.
37. Nilsson, N. J., 1980, Principles of Artificial Intelligence, Morgan Kaufmann, Los Altos, CA.
38. Osman, I. H. and Kelly, J. P., eds, 1996, Meta-Heuristics: Theory and Applications, Kluwer, Boston, MA.
39. Pardalos, P. M. and Resende, M. G. C, eds, 2002, Handbook of Applied Optimization, Oxford University Press, New York.
40. Pesant, G. and Gendreau, M., 1999, A constraint programming framework for local search methods, J. Heuristics 5:255-280.
41. Ribeiro, C. C. and Hansen, P., eds, 2002, Essays and Surveys in Metaheuristics, Kluwer, Norwell, MA.
42. Rochat, Y. and Taillard, E. D., 1995, Probabilistic diversification and intensification in local search for vehicle routing, J. Heuristics 1:147-167.
43. Rolland, E., 1996, A tabu search method for constrained real-number search: applications to portfolio selection, Working Paper, The Gary Anderson Graduate School of Management, University of California, Riverside.
44. Skorin-Kapov, J., 1990, Tabu search applied to the quadratic assignment problem, ORSA J. Comput. 2:33-45.
45. Soriano, P. and Gendreau, M., 1996, Diversification strategies in tabu search algorithms for the maximum clique problems, Ann. Oper. Res. 63:189-207.
46. Soriano, P. and Gendreau, M., 1997, Fondements et applications des methodes de recherche avec tabous, RAIRO (Recherche operationnelle) 31:133-159.
47. Taillard, E. D., 1990, Some efficient heuristic methods for the flow shop sequencing problem, Eur. J. Oper. Res. 47:65-74.
48. Taillard, E. D., 1991, Robust taboo search for the quadratic assignment problem, Parallel Comput. 17:443-455.
49. Vaessens, R. J. M., Aarts E. H. L. and Lenstra, J. K., 1996, Job shop scheduling by local search, INFORMS J. Comput. 8:302-317.
50. Voss, S., Martello, S., Osman, I. H. and Roucairol, C, eds, 1999, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer, Boston, MA.
51. De Werra, D. and Hertz, A., 1989, Tabu search techniques: a tutorial and an application to neural networks, OR Spektrum 11:131-141.