Algorithmes génétiques hybrides pour l'optimisation combinatoire
RAIRO - Operations Research - Recherche Opérationnelle, Tome 30 (1996) no. 4, pp. 373-398. 
@article{RO_1996__30_4_373_0,
     author = {Fleurent, Charles and Ferland, Jacques A.},
     title = {Algorithmes g\'en\'etiques hybrides pour l'optimisation combinatoire},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {373--398},
     publisher = {EDP-Sciences},
     volume = {30},
     number = {4},
     year = {1996},
     mrnumber = {1427448},
     zbl = {0864.90104},
     language = {fr},
     url = {http://archive.numdam.org/item/RO_1996__30_4_373_0/}
}
TY  - JOUR
AU  - Fleurent, Charles
AU  - Ferland, Jacques A.
TI  - Algorithmes génétiques hybrides pour l'optimisation combinatoire
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1996
SP  - 373
EP  - 398
VL  - 30
IS  - 4
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_1996__30_4_373_0/
LA  - fr
ID  - RO_1996__30_4_373_0
ER  - 
%0 Journal Article
%A Fleurent, Charles
%A Ferland, Jacques A.
%T Algorithmes génétiques hybrides pour l'optimisation combinatoire
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1996
%P 373-398
%V 30
%N 4
%I EDP-Sciences
%U http://archive.numdam.org/item/RO_1996__30_4_373_0/
%G fr
%F RO_1996__30_4_373_0
Fleurent, Charles; Ferland, Jacques A. Algorithmes génétiques hybrides pour l'optimisation combinatoire. RAIRO - Operations Research - Recherche Opérationnelle, Tome 30 (1996) no. 4, pp. 373-398. http://archive.numdam.org/item/RO_1996__30_4_373_0/

1. E. Aarts et J. Korst, Simulated Annealing and Boltzmann Machines, Wiley, 1989. | MR | Zbl

2. S. Bagchi, S. Uckun, Y. Miyabe et K. Kawamura, Exploring Problem-Specific Recombination Operators for Job Shop Scheduling, Proceedings of the Fourth International Conference on Genetic Algorithms, San Mateo, Calif., Morgan Kaufmann Publishers, 1991, p. 10-17.

3. J. Blazewicz, W. Cellary, R. Slowinski et J. Weglarz, Scheduling Under Resource Constraints: Deterministic Models, Annals of Operations Research, 7, 1986. | Zbl

4. L. Booker, Improving Search in Genetic Algorithms, dans [14], 1987, p. 61-73.

5. T. N. Bui et B. R. Moon, A Genetic Algorithm for a Special Class of the Quadratic Assignment Problem, Special Issue on Quadratic Assignment and Related Problems, DIMACS Series, 1993 (à paraître). | MR | Zbl

6. B. Carter et K. Park, How good are genetic algorithms at finding large cliques: an experimental study, Technical Report BU-CS-93-015, Boston University, 1994.

7. C. Caux, H. Pierreval et M. C. Portmann, Les algorithmes génétiques et leur application aux problèmes d'ordonnancement, Actes des Journées d'Étude Ordonnancement et entreprise : applications concrètes et outils pour le futur, CNRS, Toulouse, 1994, p. 5-45.

8. V. Cerny, A Thermodynamical Approach to the Travelling Salesman Problem: An Efficient Simulation Algorithm, Journal of Optimization Theory and Applications, 1985, 15, p. 41-51. | MR | Zbl

9. J. Chakrapani et J. Skorin-Kapov, Massively parallel tabu search for the quadratic assignment problem, Annals of Operations Reseach, 1993, 41, p. 327-341. | Zbl

10. G. A. Cleveland et S. F. Smith, Using Genetic Algorithms to Schedule Flow-Shop Releases, Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann Editors, Los Altos, CA, 1989, p. 160-169.

11. D. Costa, An Evolutionary Tabu Search Algorithm and the NHL Scheduling Problem, INFOR, 1995, 33, p. 161-178. | Zbl

12. L. Davis, Applying Adaptive Algorithms to Epistatic Domains, Proceedings of the International Joint Conference on Artificial Intelligence, 1985, p. 162-164.

13. L. Davis, Job-Shop Scheduling With Genetic Algorithms, Proceedings of the First International Conference on Genetic Algorithms, J. J. GREFENSTETTE, éditeur, Lawrence Erlbaum Associates, Hillsdale, NJ, 1985, p. 136-140. | Zbl

14. L. Davis, Genetic Algorithms and Simulated Annealing, Morgan Kaufmann Publishers, 1987. | Zbl

15. L. Davis, Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.

16. K. A. Dejong et W. M. Spears, Using Genetic Algorithms to Solve NP-Complete Problems, Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann Editors, Los Altos, CA, 1989, p. 124-132.

17. C. Fleurent et J. A. Ferland, Genetic Hybrids for the Quadratic Assignment Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, (P.M. PARDALOS et H. WOLKOWICZ eds.), 1994, 16, p. 173-188. | MR | Zbl

18. C. Fleurent et J. A. Ferland, Object-Oriented Implementation of Heuristic Search Methods for Graph Coloring, Maximum Clique, and Satisfiability, DIMACS series in Discrete Mathematics and Theoretical Computer Science, (M. TRICK et D. JOHNSON eds.), 1996 (à paraître). | Zbl

19. C. Fleurent et J. A. Ferland, Genetic Algorithms and Hybrids for Graph Coloring, Annals of Operations Research, 1995, 60. | Zbl

20. 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

21. M. R. Garey et D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. FREEMAN and Co., San Francisco, 1979. | MR | Zbl

22. 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-403. | Zbl

23. F. Glover, Heuristics for Integer Programming Using Surrogate Constraints, Decision Sciences, 1977, 8, p. 156-166.

24. F. Glover, Future Paths for Integer Programming and Links to Artificial Intelligence, Computer and Operations Research, 1986, 13, p. 533-549. | MR | Zbl

25. F. Glover, Tabu Search-Part I, ORSA Journal on Computing, 1989, 1, p. 190-206. | Zbl

26. F. Glover, Tabu Search-Part II, ORSA Journal on Computing, 1990, 2, p. 4-32. | Zbl

27. F. Glover et M. Laguna, Tabu search, dans Modern Heuristic Techniques for Combinatorial Problems, C. R. Reeves éditeur, Blackwell Scientific Publications, Oxford, 1993, p. 70-141. | MR

28. F. Glover, Genetic Algorithms and Scatter Search: Unsuspected Potentials, Rapport technique, University of Colorado at Boulder, 1993.

29. D. E. Goldberg et R. Lingle, Alleles, Loci, and the TSP, Proceedings of the First International Conference on Genetic Algorithms, J. J. GREFENSTETTE éditeur, Lawrence Erlbaum Associates, Hillsdale, NJ, 1985, p. 154-159. | Zbl

30. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, 1989. | Zbl

31. J. J. Grefenstette, Incorporating Problem Specific Knowledge into Genetic Algorithms, dans [14], 1987, p. 42-60.

32. A. Hertz et D. De Werra, Using Tabu Search Techniques for Graph Coloring, Computing, 1987, 39, p. 345-351. | MR | Zbl

33. J. H. Holland, Adaptation in Natural and Artificial Systems, Ann Arbor, University of Michigan Press, 1975. | MR | Zbl

34. C. L. Huntley et D. E. Brown, A Parallel Heuristic for Quadratic Assignment Problems, Computers and Operations Research, 1991, 18, p. 275-289. | Zbl

35. T. Ibaraki, Enumerative Approaches to Combinatorial Optimization, Part I, Annals of Operations Research, 1987, 10. | Zbl

36. T. Ibaraki, Enumerative Approaches to Combinatorial Optimization, Part II, Annals of Operations Research, 1987, 11. | Zbl

37. D. S. Johnson, C. R. Aragon, L. A. Mcgeoch et C. Schevon, Optimization by Simulated Annealing: An Experimental Evaluation, Part I, Graph Partioning, Operations Research, 1989, 37, p. 865-892. | Zbl

38. S. Kirkpatrick, C. D. Gelatt et M. P. Vecchi, Optimization by Simulated Annealing, Science, 1983, 220, p. 671-680. | MR

39. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan et D. B. Shmoys, The Traveling Salesman Problem: A guided Tour of Combinatorial Optimization, John Wiley and Sons, New York, 1985. | MR | Zbl

40. S. Lash, Genetic Algorithms for Weighted Tardiness Scheduling on Parallel Machines, Technical Report 93-01, Department of Industrial Engineering and Management Sciences, North Western University, 1993.

41. F. Leighton, A graph coloring algorithm for large scheduling problems, Journal of Research of the National Bureau of Standards, 1979, 84, p. 489-505. | MR | Zbl

42. G. E. Liepins et M. D. Vose, Representational Issues in Genetic Optimization, Journal of Experimental and Theoretical Artificial Intelligence, 1990, 2, p. 101-105.

43. S. Lin, Computer Solutions of the Traveling Salesman Problem, Bell System Technical Journal, 1965, 44, p. 2245-2269. | MR | Zbl

44. S. Lin et B. W. Kernighan, An Effective Heuristic for the Traveling Salesman Problem, Operations Research, 1973, 21, p. 498-516. | MR | Zbl

45. 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 | Zbl

46. Z. Michalewicz, Genetic Algorithms+Data Structures=Evolution Programs, Springer-Verlag, Berlin, 1992. | MR | Zbl

47. P. Moscato, An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search, Annals of Operations Research, 1993, 41, p. 85-121. | Zbl

48. H. Muhlenbein, M. Gorges-Schleuter et O. Kramer, Evolution Algorithms in Combinatorial Optimization, Parallel Computing, 1988, 7, p. 65-88. | Zbl

49. R. Nakano et T. Yamada, Conventional Genetic Algorithm for Job Shop Problems, Proceedings of the Fourth International Conference on Genetic Algorithms, San Mateo, Calif., Morgan Kaufmann Publishers, 1991, p. 474-479.

50. R. Nelson et R. J. Wilson, Graph Colourings, Pitman Research Notes in Mathematics Series, 218, Longman Scientific and Technical, Harlow, Essex, UK, 1990. | MR | Zbl

51. I. M. Oliver, D. J. Smith et J. R. C. Holland, A Study of Permutation Crossover Operators on the Traveling Salesman Problem, Proceedings of the Second International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, 1987, p. 224-230.

52. P. M. Pardalos et H. Wolkowicz, Quadratic Assignment and Related Problems, DIMACS Series in Mathematics and Theoretical Computer Science, 16, édité par l'American Mathematical Society, 1994. | MR | Zbl

53. G. Syswerda, Uniform Crossover in Genetic Algorithms, Proceedings of the Third International Conference on Genetic Algorithms, San Mateo, Calif., Morgan Kaufmann Publishers, 1989, p. 2-9.

54. G. Syswerda, Schedule Optimization Using Genetic Algorithms, dans [15], 1991, p. 332-349.

55. G. Syswerda et J. Palmucci, The Application of Genetic Algorithms to Resource Scheduling, Proceedings of the Fourth International Conference on Genetic Algorithms, San Mateo, Calif., Morgan Kaufmann Publishers, 1991, p. 502-507.

56. E. Taillard, Robust Taboo Search for the Quadratic Assignment problem, Parallel Computing, 1991, 17, p. 443-455. | MR

57. E. Taillard, Recherches itératives dirigées parallèles, thèse de doctorat, École Polytechnique Fédérale de Lausanne, 1993.

58. E. Taillard, Comparison of iteratives searches for the quadratic assignment problem, Rapport technique ORWP94/04, DMA, École Polytechnique Fédérale de Lausanne, 1994. | Zbl

59. D. E. Tate et A. E. Smith, A genetic approach to the quadratic assignment problem, Computers and Operations research (à paraître). | Zbl

60. S. Uckun, S. Bagchi et K. Kawamura, Managing Genetic Search in Job Shop Scheduling, IEEE Expert, 1993, 8, p. 15-24.

61. D. Welsh, Codes and Cryptography, Oxford University Press, New York, 1988. | MR | Zbl

62. D. Whitley, T. Starkweather et D. Fuquay, Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operator, Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann Editors, Los Altos, CA, 1989, p. 133-140.

63. D. Whitley, T. Starkweather et D. Shaner, The Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination, dans [15], 1991, p. 350-372.

64. T. Yamada et R. Nakano, A Genetic Algorithm Applicable to Large Scale Job Shop Problems, dans Parallel Problem Solving from Nature, 2, R. MANNER et B. MANDERICK éds., North-Holland, Amsterdam, 1992, p. 281-290.