Fondements et applications des méthodes de recherche avec tabous

Free Access

Issue		RAIRO-Oper. Res. Volume 31, Number 2, 1997


Page(s)		133 - 159
DOI		https://doi.org/10.1051/ro/1997310201331
Published online		10 February 2017

1. C. A. ANDERSON, K. FRAUGNAUGH, M. PARKER et J. RYAN, Path Assignment for Call Routing: An Application of Tabu Search, Annals of Operations Research, 1993, 41, p. 301-312. [Zbl: 0775.90144] [Google Scholar]
2. J. W. BARNES et M. LAGUNA, Solving the Multiple-Machine Weighted Flow Time Problem Using Tabu Search, IIE Transactions, 1992 (à paraître). [Google Scholar]
3. S. BENATI et G. LAPORTE, Tabu Search Algorithms for the (r/:Tp)-Medianoid and the (r/p)-Centroid Problems, Location Science, 1994, 2, p. 193-204. [Zbl: 0917.90222] [Google Scholar]
4. D. BEYER et R. OGIER, Tabu Learning: A Neural Network Search Method for Solving Nonconvex Optimization Problems, Proceedings of the International Joint Conference on Neural/Network, IEEE and INNS, Singapour, 1991. [Google Scholar]
5. J. A. BLAND et G. P. DAWSON, Tabu Search and Design Optimization, Computer-Aided Design, 23, 1991, p. 195-202. [Zbl: 0735.65036] [Google Scholar]
6. J. BOVET, C. CONSTANTIN et D. DE WERRA, A Convoy Scheduling Problem, à paraître dans Discrete Applied Mathematics, 1991. [Zbl: 0734.90038] [Google Scholar]
7. P. BRANDIMARTE, Routing and Scheduling in a Flexible Job Shop by Tabu Search, Annals of Operations Research, 1993, 41, p. 157-184. [Zbl: 0775.90227] [Google Scholar]
8. J. CHAKRAPANI et J. SKORIN-KAPOV, Massively Parallel Tabu Search for the Quadratic Assignment Problem, Annals of Operations Research, 1993, 41, p. 327-342. [Zbl: 0775.90288] [Google Scholar]
9. M. CHAMS, A. HERTZ et D. DE WERRA, Some Experiments with Simulated Annealing for Coloring Graphs, European Journal of Operations Research, 1987, 32, p. 260-266. [MR: 911969] [Zbl: 0626.90067] [Google Scholar]
10. D. COSTA, A Tabu Search Algorithm for Computing an Operational Time Table, European Journal of Operations Research, 1994, 76, p. 98-110. [Zbl: 0809.90075] [Google Scholar]
11. D. COSTA, On the Use of Some Known Methods for T-Coloring of Graphs, Annals of Operations Research, 1993, 41, p. 343-358. [Zbl: 0771.68089] [Google Scholar]
12. T. G. CRAINIC, M. GENDREAU, P. SORIANO et M. TOULOUSE, A Tabu Search Procedure for Multicommodity Location/Allocation with Balancing Requirements, Annals of Operations Research, 1993, 41, p. 359-384. [Zbl: 0775.90289] [Google Scholar]
13. T. G. CRAINIC, M. TOULOUSE et M. GENDREAU, Towards a Taxonomy of Parallel Tabu Search Algorithms, INFORMS J. on Computing (à paraître). [Zbl: 0891.90094] [Google Scholar]
14. T. G. CRAINIC, M. TOULOUSE et M. GENDREAU, A Study of Synchronous Parallelization Strategies for Tabu Search, publication CRT-934, Centre de recherche sur les transports, Université de Montréal, 1993. [Google Scholar]
15. T. G. CRAINIC, M. TOULOUSE et M. GENDREAU, An Appraisal of Asynchronous Parallelization Approaches for Tabu Search Algorithms, Annals of Operations Research, 1996, 63, p. 277-299. [Zbl: 0851.90033] [Google Scholar]
16. F. DAMMEYER et S. VOß, Dynamic Tabu List Management Using the Reverse Elimination Method, Annals of Operations Research, 1993, 41, p. 31-46. [Zbl: 0775.90290] [Google Scholar]
17. R. L. DANIELS et J. B. MAZZOLA, Tabu Search Heuristic for the Flexible-Resource Flow Shop Scheduling Problem, Annals of Operations Research, 1993, 41, p. 207-230. [Zbl: 0771.90055] [Google Scholar]
18. M. DELL'AMICO et T. TRUBIAN, Applying Tabu Search to the Job-Shop Scheduling Problem, Annals of Operations Research, 1993, 41, p. 231-252. [Zbl: 0771.90056] [Google Scholar]
19. W. DOMSCHKE, P. FROST et S. VOß, Tabu Search Techniques for the Quadratic Semi-Assignment Problem, New Directions for Operations Research in Manufacturing, G. FANDEL, T. GULLEDGE et A. JONES (Eds.), Springer, 1991, p. 389-405. [Google Scholar]
20. N. DUBOIS et D. DE WERRA, EPCOT: An Efficient Procedure for Coloring Optimally with Tabu Search, Computers and Mathematics with Applications, 1993, 25, p. 35-45. [MR: 1213528] [Zbl: 0798.68128] [Google Scholar]
21. U. FAIGLE et W. KERN, Some Convergence Results for Probabilistic Tabu Search, ORSA Journal on Computing, 1992, 4, p. 32-37. [Zbl: 0767.90069] [Google Scholar]
22. C.N. FIECHTER, A Parallel Tabu Search Algorithm for Large Scale Traveling Salesman Problems, Discrete Applied Mathematics, 1994, 51, p. 243-267. [MR: 1283233] [Zbl: 0938.68942] [Google Scholar]
23. L. J. FOGEL, A. J. OWENS et M. J. WALSH, Artificial Intelligence through Simulated Evolution, Wiley, New York, 1966. [Zbl: 0148.40701] [Google Scholar]
24. P. M. FRANÇA, M. GENDREAU, G. LAPORTE et F. M. MULLER, The m-Traveling Salesman Problem with Minmax Objective, Transportation Science, 1995, 29, p. 267-275. [Zbl: 0858.90128] [Google Scholar]
25. C. FRIDEN, A. HERTZ et D. DE WERRA, STABULUS: A Technique for Finding Stable Sets in Large Graphs with Tabu Search, Computing, 1989, 42, p. 35-44. [Zbl: 0685.68056] [Google Scholar]
26. C. FRIDEN, A. HERTZ et D. DE WERRA, TABARIS: An Exact Algorithm Based on Tabu Search for Finding a Maximum Independent Set in a Graph, Computers and Operations Research, 1990, 17, p. 437-445. [MR: 1087823] [Zbl: 0713.90087] [Google Scholar]
27. B. L. GARCIA, Développement de techniques de recherche tabou pour le problème de tournées de véhicules avec fenêtres de temps, publication CRT-931, Centre de recherche sur les transports, Université de Montréal, 1993. [Google Scholar]
28. B. L. GARCIA, J.-Y. POTVIN et J.-M. ROUSSEAU, A Parallel Implementation of the Tabu Search for the Vehicle Routing Problem with Time Windows, Computers & Operations Research, 1994, 21, p. 1025-1033. [Zbl: 0815.90067] [Google Scholar]
29. M. GENDREAU, A. HERTZ et G. LAPORTE, A Tabu Search Algorithm for the Vehicle Routing Problem, Management Science, 1994, 40, p. 1276-1290. [Zbl: 0822.90053] [Google Scholar]
30. M. GENDREAU, P. SORIANO et L. SALVAIL, Solving the Maximum Clique Problem Using a Tabu Search Approach, Annals of Operations Research, 1993, 41, p. 385-404. [Zbl: 0775.90297] [Google Scholar]
31. F. GLOVER, Heuristics for Integer Programming Using Surrogate Constraints, Decision Science, 1977, 8, p. 156-166. [Google Scholar]
32. F. GLOVER, Future Paths for Integer Programming and Links to Artificial Intelligence, Computers and Operations Research, 1986, 5, p. 533-549. [MR: 868908] [Zbl: 0615.90083] [Google Scholar]
34. F. GLOVER, Tabu Search - Part I, ORSA Journal on Computing, 1989, 1, p. 190-206. [Zbl: 0753.90054] [Google Scholar]
34. F. GLOVER, Candidate List Strategies and Tabu Search, CAAI Research Report, University of Colorado, Boulder, 1989. [Google Scholar]
35. F. GLOVER, Tabu Search - Part II, ORSA Journal on Computing, 1990, 2, p. 4-32. [Zbl: 0771.90084] [Google Scholar]
36. F. GLOVER, Multilevel Tabu Search and Embedded Search Neighborhoods for the Traveling Salesman Problem, ORSA Journal on Computing, 1991 (à paraître). [Google Scholar]
37. F. GLOVER, Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms), Discrete Applied Mathematics, 1991 (à paraître). [Zbl: 0799.90109] [Google Scholar]
38. F. GLOVER et M. LAGUNA, Bandwidth Packing: A Tabu Search Approach, Management Science, 1993, 39, p. 17-29. [Zbl: 0774.90033] [Google Scholar]
39. F. GLOVER et M. LAGUNA, Tabu Search, dans Modem Heuristic Techniques for Combinatorial Problems, C. R. REEVES (Ed.), Blackwell, Oxford, 1993, p. 70-150. [Google Scholar]
40. F. GLOVER, E. TAILLARD et D. DE WERRA, A User's Guide to Tabu Search, Annals of Operations Research, 1992, 41, p. 3-28. [Zbl: 0772.90063] [Google Scholar]
41. P. HANSEN, The Steepest Ascent Mildest Descent Heuristic for Combinatorial Programming, présenté au Congress on Numerical Methods in Combinatorial Programming, Capri, Italie, 1986. [Google Scholar]
42. P. HANSEN et B. JAUMARD, Algorithms for the Maximum Satisflability Problem, Computing, 1990, 44, p. 279-303. [MR: 1063769] [Zbl: 0716.68077] [Google Scholar]
43. P. HANSEN, B. JAUMARD et E. DA SILVA, Average Linkage Divisive Hierarchical Clustering, Journal of Classification, 1992 (à paraître). [Google Scholar]
44. P. HANSEN, B. JAUMARD et M. POGGI DE ARAGAO, Mixed Integer Column Generation Algorithms and the Probabilistic Maximum Satisfiability Problem, Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Carnegie-Mellon, 1992. [Zbl: 0932.90027] [Google Scholar]
45. P. HANSEN, E. DE LUNA PEDROSA FILHO et C. CARNEIRO RIBEIRO, Location and Sizing of Offshore Platforms for Oil Exploration, European Journal of Operations Research, 1992, 58, p. 202-214. [Zbl: 0775.90273] [Google Scholar]
46. A. HERTZ, Tabu Search for Large Scale Timetabling Problems, European Journal of Operations Research, 1991, 54, p. 39-47. [Zbl: 0729.90660] [Google Scholar]
47. A. HERTZ, Finding a Feasible Course Schedule Using Tabu Search, Discrete Applied Mathematics, 1992, 55, p. 255-270. [Zbl: 0800.90562] [Google Scholar]
48. A. HERTZ, E. TAILLARD et D. DE WERRA, Tabu Search, dans Local Search in Combinatorial Optimization, J. K. LENSTRA (Ed.), à venir, aussi rapport ORWP 92/18, Département de mathématiques, École Polytechnique Fédérale de Lausanne, Suisse, 1992. [Zbl: 0932.90031] [Google Scholar]
49. A. HERTZ et D. DE WERRA, Using Tabu Search Techniques for Graph Coloring, Computing, 1987, 29, p. 345-351. [MR: 923459] [Zbl: 0626.68051] [Google Scholar]
50. A. HERTZ et D. DE WERRA, Informatique et horaires scolaires, Output, 1989, 12, p. 53-56. [Google Scholar]
51. A. HERTZ et D. DE WERRA, The Tabu Search Metaheuristic: How WeUsed It, Annals of Mathematics and Artificial Intelligence, 1990, 1, p. 111-121. [Zbl: 0878.68053] [Google Scholar]
52. J. H. HOLLAND, Adaptation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, MI, 1975. [MR: 441393] [Zbl: 0317.68006] [Google Scholar]
53. B. JAUMARD, P. HANSEN et M. POGGI DE ARAGAO, Column Generation Methods for Probabilistic Logic, ORSA Journal on Computing, 1991, 3, p. 135-148. [Zbl: 0800.68864] [Google Scholar]
54. B. JAUMARD, M. STAN et J. DESROSIERS, Tabu Search and a Quadratic Relaxation for the Satisfiability Problem, Cahiers du GERAD G-93-25, GERAD, École des Hautes Études Commerciales, Montréal, 1993. [Zbl: 0859.68039] [Google Scholar]
55. J. P. KELLY, B. L. GOLDEN et A. A. ASSAD, Large-Scale Controlled Rounding Using Tabu Search with Strategie Oscillation, Annals of Operations Research, 1992, 41, p. 69-84. [Zbl: 0775.90291] [Google Scholar]
56. S. KIRKPATRICK, C. D. Jr. GELATT et M. P. VECCHI, Optimization by Simulated Annealing, Science, 220 (4598), 1983, p. 671-680. [Zbl: 1225.90162] [MR: 702485] [Google Scholar]
57. M. LAGUNA, J. W. BARNES et F. GLOVER, Tabu Search Methods for a Single Machine Scheduling Problem, Journal of Intelligent Manufacturing, 1991, 2, p. 63-74. [Google Scholar]
58. M. LAGUNA et F. GLOVER, Integrating Target Analysis and Tabu Search for Improved Scheduling Systems, Expert Systems with Applications: An International Journal, 1992 (à paraître). [Google Scholar]
59. M. LAGUNA et J. L. GONZALEZ-VELARDE, A Search Heuristic for Just-in-Time Scheduling in Parallel Machines, Journal of Intelligent Manufacturing, 1991, 2, p. 253-260. [Google Scholar]
60. S. LIN, Computer Solutions of the Traveling Salesrnan Problem, Bell System Technical Journal, 1964, 44, p. 2245-2269. [MR: 189224] [Zbl: 0136.14705] [Google Scholar]
61. M. MALEK, M. GURUSWAMY, M. PANDYA et H. OWENS, Serial and Parallel Simulated Annealing and Tabu Search Algorithms for the Traveling Salesman Problem, Annals of Operations Research, 1989, 21, p. 59-84. [MR: 1043675] [Zbl: 0705.90069] [Google Scholar]
62. N. METROPOLIS, A. W. ROSENBLUTH, M. N. ROSENBLUTH, A. H. TELLER et E. TELLER, Equation of State Calculations by Fast Computing Machines, Journal of Chemical Physics, 1953, 21 (6), p. 1087-1091. [Google Scholar]
63. E. L. MOONEY et R. L. RARDIN, Tabu Search for a Class of Scheduling Problems, Annals of Operations Research, 1992, 41, p. 253-278. [Zbl: 0775.90237] [Google Scholar]
64. S. OLIVEIRA et G. STROUD, A Parallel Version of Tabu Search and the Path Assignment Problem, Heuristics for Combinatorial Optimization, 1989, 4, p. 1-24. [Google Scholar]
65. I. OR, Traveling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Regional Blood Banking, Ph.D. Dissertation, Northwestern University, Evanston, IL, 1976. [Google Scholar]
66. I. H. OSMAN, Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem, Annals of Operations Research, 1993, 41, p. 421-451. [Zbl: 0775.90153] [Google Scholar]
67. M. PIRLOT, General Local Search Heuristics in Combinatorial Optimization: A Tutorial, Belgian Journal of Operations Research, Statistics and Computer Science, 1992, 32, p. 8-67. [Zbl: 0768.90062] [Google Scholar]
68. J.-Y. POTVIN, T. KERVAHUT, B. L. GARCIA et J.-M. ROUSSEAU, A Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows, publication CRT-855, Centre de recherche sur les transports, Université de Montréal, 1993. [Google Scholar]
69. V. M. PUREZA et P. M. FRANÇA, Vehicle Routing Problems via Tabu Search Metaheuristic, publication CRT-747, Centre de recherche sur les transports, Université de Montréal, 1991. [Google Scholar]
70. Y. ROCHAT et F. SEMET, Tabu Search Approach for Delivering Pet Food and Flour in Switzerland, Journal of the Operational Research Society, 1994, 45, p. 1233-1246. [Zbl: 0812.90044] [Google Scholar]
71. F. SEMET et E. TAILLARD, Solving Real-Life Vehicle Routing Problems Efficiently Using Tabu Search, Annals of Operations Research, 1993, 41, p. 469-488. [Zbl: 0775.90156] [Google Scholar]
72. J. SKORIN-KAPOV, Tabu Search Applied to the Quadratic Assignment Problem, ORSA Journal on Computing, 1990, 2, p. 33-45. [Zbl: 0752.90054] [Google Scholar]
73. J. SKORIN-KAPOV, Extensions of a Tabu Search Adaptation to the Quadratic Assignment Problem, Computers and Operations Research, 1994, 21, p. 855-865. [MR: 1288637] [Zbl: 0812.90098] [Google Scholar]
74. P. SORIANO et M. GENDREAU, Diversification Strategies in Tabu Search Algorithms for the Maximum Clique Problem, Annals of Operations Research, 1996, 63, p. 189-207. [MR: 1423146] [Zbl: 0851.90099] [Google Scholar]
75. P. SORIANO et M. GENDREAU, Tabu Search Algorithms for the Maximum Clique Problem, dans Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, D. S. JOHNSON et M. A. TRICK (Ed.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26, American Mathematical Society, 1996. [MR: 1423146] [Zbl: 0864.90124] [Google Scholar]
76. B. SRIVASTAVA et W.-H. CHEN, Part Type Selection Problem in Flexible Manufacturing Systems: Tabu Search Algorithms, Annals of Operations Research, 1993, 41, p. 279-297. [Zbl: 0775.90224] [Google Scholar]
77. M. SUN et P. G. MCKEOWN, Tabu Search Applied to the General Fixed Charge Problem, Annals of Operations Research, 1993, 41, p. 405-420. [Zbl: 0775.90287] [Google Scholar]
78. E. TAILLARD, Parallel Tabu Search for the Jobshpp Scheduling Problem, rapport ORWP 89/11, Département de mathématiques, École Polytechnique Fédérale de Lausanne, Suisse, 1989. [Google Scholar]
79. E. TAILLARD, Some Efficient Heuristic Methods for the Flowshop Sequencing Problem, European Journal of Operations Research, 1990, 47, p. 65-74. [MR: 1067999] [Zbl: 0702.90043] [Google Scholar]
80. E. TAILLARD, Robust Taboo Search for the Quadratic Assignment Problem, Parallel Computing, 1991, 17, p. 443-455. [MR: 1123015] [Google Scholar]
81. E. TAILLARD, Parallel Iterative Search Methods for Vehicle Routing Problems, Networks, 1993, 23, p. 661-673. [Zbl: 0804.90045] [Google Scholar]
82. D. DE WERRA et A. HERTZ, Tabu Search Techniques: A Tutorial and an Application to Neural Networks, OR Spektrum, 1989, 11, p. 131-141. [MR: 1013767] [Zbl: 0672.90089] [Google Scholar]
83. M. WIDMER et A. HERTZ, A New Method for the Flow Sequencing Problem, European Journal of Operations Research, 1989, 41, pp. 186-193. [Zbl: 0671.90040] [Google Scholar]
84. M. WIDMER, Job Shop Scheduling with Tooling Constraints: A Tabu Search Approach, Journal of the Operational Research Society, 1991, 24 (1), p. 75-82. [Google Scholar]
85. J. A. G. WILLARD, Vehicle Routing Using r-Optimal Tabu Search, M. Sc. Dissertation, The Management School, Imperial College, Londres, 1989. [Google Scholar]
86. D. L. WOODRUFF et M. L. SPEARMAN, Sequencing and Batching for Two Classes of Jobs with Deadlines and Setup Times, Production and Operations Management, 1992, 1 (1), p. 87-102. [Google Scholar]
87. D. L. WOODRUFF et E. ZEMEL, Hashing Vectors for Tabu Search, Annals of Operations Research, 1992, 41, p. 123-137. [Zbl: 0775.90294] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.