Metaheuristics for hard optimization: Simulated annealing, tabu search, evolutionary and genetic algorithms, ant colonies,... Methods and case studie

Metaheuristics for Hard Optimization: Simulated Annealing, Tabu Search, Evolutionary and Genetic Algorithms, Ant Colonies,... Methods and Case Studies

Volumn , Issue , 2006, Pages 1-369

  Dréo, Johann ^a   Siarry, Patrick ^a   Pétrowski, Alain ^b   Taillard, Eric ^c  

^a UNIVERSITÉ PARIS EST CRÉTEIL   (France)

^b ORANGE LABS   (France)

^c EIVD Ecole D'Ingénieurs du Canton de Vaud   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892258345     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/3-540-30966-7     Document Type: Book

References (294)

1. Aarts, E. H. L., De Bont, F. M. J., Habers J. H. A., and Van Laarhoven, P. J. M. (1986). A parallel statistical cooling algorithm. In Proc. of the 3rd Annual Symposium on Theoretical Aspects of Computer Science, volume 210 of Lecture Notes in Computer Science, pages 87-97.
2. Aarts, E. H. L. and Van Laarhoven, P. J. M. (1985). Statistical cooling : a general approach to combinatorial optimisation problems. Philips J. of Research, 40:193-226.
3. Ackley, D. H. (1987). A Connectionist Machine for Genetic Hillclimbing. Kluwer.
4. Ahuja, R., Magnanti, T., and Orlin, J. (1993). Network Flows, Theory, Algorithms and Applications. Prentice Hall.
5. Altman, Z., Picard, J., Ben Jamaa, S., Fouresté, B., Caminada, A., Dony, T., Morlier, J., and Mourniac, S. (2002). New challenges in automatic cell planning of UMTS networks. In IEEE International Symposium VTC, Vancouver.
6. Aluffi-Pentini, F., Parisi, V., and Zirilli, F. (1985). Global optimization and stochastic differential equations. J. of optimization theory and applications, 47(1):1-16.
7. Angeline, P. J. (1996). Genetic programming's continued evolution. In Angeline, P. and Kinnear, K., editors, Advances in Genetic Programming, vol 2, pages 89-110. MIT Press.
8. Azencott, R., editor (1992). Simulated Annealing : Parallelization Techniques. John Wiley and Sons.
9. Baeck, T., Fogel, D. B., and Michalewicz, Z. (2000a). Evolutionary Computation 1: Basic Algorithms and Operators. Institute of Physics Publishing.
10. Baeck, T., Fogel, D. B., and Michalewicz, Z. (2000b). Evolutionary Computation 2: Advanced Algorithms and Operators. Institute of Physics Publishing.
11. Baker, J. E. (1987). Reducing bias and inefficiency in the selection algorithm. In Grefenstette, J. J., editor, Proc. 2nd Int. Conf. on Genetic Algorithms, pages 14-21.
12. Barr, R. S., Golden, B. L., Kelly, J. P., Resende, M. G. C., and Stewart, W. R. (1995). Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics, 1(1):9-32.
13. Beasley, D., Bull, D. R., and Martin, R. R. (1993). A sequential niche technique for multimodal function optimization. Evolutionary Computation, 1(2):101-125.
14. Beckers, R., Deneubourg, J. L., and Goss, S. (1992). Trails an U-Turns in the Selection of a Path by the Ant Lasius Niger. J. Theor. Biol., 159:397-415.
15. Belideanu, N. and Contjean, E. (1994). Introducing global constraints in chip. Mathematical and computer Modelling, 12:97-123.
16. Ben Jamaa, S., Altman, Z., Picard, J., Fourestié, B., and Mourlon, J. (2003). Manual and automatic design for UMTS networks. In WiOpt'03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Sophia-Antipolis, France.
17. Berthiau, G., Durbin, F., Haussy, J., and Siarry, P. (1994). Learning of neural networks approximating continuous functions through circuit simulator SPICE-PAC driven by Simulated Annealing. International Journal of Electronics, 76:437-441.
18. Bertocchi, M. and Odoardo, C. D. (1991). A stochastic algorithm for global optimization based on threshold accepting technique. In 11th European Congress on Operational Research (EURO XI), Aachen, Germany.
19. Bessaou, M., Petrowski, A., and Siarry, P. (2000). Island model cooperating with speciation for multimodal optimization. In Schwefel, H.- P., Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., and Merelo, J. J., editors, Parallel Problem Solving from Nature - PPSN VI 6th International Conference, Paris, France. Springer Verlag.
20. Bessiere, C. and Regin, J.-C. (1997). Arc consistency for general constraint networks: preliminary results. In Proceedings of the 15th IJCAI, pages 398-404.
21. Beyer, H.-G. (2001). The Theory of Evolution Strategies, Natural Computing Series. Springer.
22. Bieszczad, A. and White, T. (1999). The Fundamentals of Network Management, chapter Mobile Agents for Network Management. Plenum books.
23. Bilchev, G. and Parmee, I. (1995). The Ant Colony Metaphor for Searching Continuous Design Spaces. Lecture Notes in Computer Science, 993:25-39.
24. Birattari, M., Di Caro, G., and Dorigo, M. (2002). Toward the Formal Foundation of Ant Programming. In Dorigo, M., Di Caro, G., and Sampels, M., editors, Proceedings of the Third International Workshop on Ant Algorithms (ANTS'2002), volume 2463 of Lecture Notes in Computer Science, pages 188-201, Brussels, Belgium. Springer Verlag.
25. Bonabeau, E., Dorigo, M., and Theraulaz, G. (1999). Swarm Intelligence, From Natural to Artificial Systems. Oxford University Press.
26. Bonabeau, E., Theraulaz, G., and Deneubourg, J.-L. (1996). Quantitative Study of the Fixed Threshold Model for the Regulation of Division of Labour in Insect Societies. In Proceedings Roy. Soc. London B, volume 263.
27. Bonabeau, E., Theraulaz, G., and Deneubourg, J.-L. (1998). Fixed Response Thresholds and the Regulation of Division of Labor in Insect Societies. Bulletin of Mathematical Biology, (60):753-807.
28. Bonomi, E. and Lutton, J. L. (1984). The N-city travelling salesman problem, Statistical Mechanics and the Metropolis Algorithm. SIAM Review, 26(4):551-568.
29. Brandimarte, P. (1992). Neighbourhood search-based optimization algorithms for production scheduling : a survey. Computer-Integrated Manufacturing Systems, 5(2):167-176.
30. Bullnheimer, B., Hartl, R., and Strauss, C. (1997). An improved ant system algorithm for the vehicle routing problem. Technical report, Institute of Management Science, Vienna, Austria.
31. Bullnheimer, B., Hartl, R., and Strauss, C. (1999). Applying the ant system to the vehicle routing problem. In Roucairol, S., Voss, S., Martello, I., and Osman, C., editors, Meta-heuristics : Advances and Trends in Local search Paradigms for Optimization. Kluwer Academic Publishers, pages 285-296, USA. Kluwer Academic.
32. Burkard, R. E. and Fincke, U. (1985). Probabilistic properties of some combinatorial optimization problems. Discrete Applied Mathematics, 12:21-29.
33. Camazine, S., Deneubourg, J., Franks, N., Sneyd, J., Theraulaz, G., and Bonabeau, E. (2000). Self-Organization in Biological Systems. Princeton University Press.
34. Campos, M., Bonabeau, E., Theraulaz, G., and Deneubourg, J.-L. (2000). Dynamic Scheduling and Division of Labor in Social Insects. In Adaptive Behavior 2000, pages 83-96.
35. Casotto, A., Romea, F., and Sangiovanni-Vincentelli, A. (1987). A parallel simulated annealing algorithm for the placement of macro-cells. IEEE Trans. on C.A.D., CAD-6(5):838-847.
36. Cerny, V. (1985). Thermodynamical approach to the traveling salesman problem : an efficient simulation algorithm. J. of Optimization Theory and Applications, 45(1):41-51.
37. Charon, I. and Hudry, O. (2002). The noising methods: a survey. In Hansen, P. and Ribeiro, C. C., editors, Essays and Surveys in Metaheuristics, pages 245-261. Kluwer Academic Publishers.
38. Chelouah, R. and Siarry, P. (2000a). A Continuous Genetic Algorithm Designed for the Global Optimization. Journal of Heuristics, 6:191-213.
39. Chelouah, R. and Siarry, P. (2000b). Tabu Search Applied to Global Optimization. European Journal of Operational Research, 123:256-270.
40. Chelouah, R. and Siarry, P. (2003). Genetic and Nelder-Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions. European Journal of Operational Research, 148:335-348.
41. Chelouah, R., Siarry, P., Berthiau, G., and De Barmon, B. (2000). An optimization method fitted for model inversion in non destructive control by eddy currents. The European Physical Journal, Applied Physics, 12:231-238.
42. Cherruault, Y. (1986a). Mathematical modelling in Biomedicine. D. Reidel Publishing Company.
43. Cherruault, Y. (1986b). Mathematical Modelling in Biomedicine. Optimal Control of Biomedical Systems. D. Reidel Publishing Company.
44. Cherruault, Y. (1989). A new method for global optimization (Alienor). Kybernetes, 19(3):19-32.
45. Choo, S.-Y. (2000). Genetic Algorithms and Genetic Programming at Stanford 2000, chapter Emergence of a Division of Labour in a Bee Colony, pages 98-107. Stanford Bookstore, Stanford, California.
46. Christofides, N., Mingozzi, A., and Toth, P. (1979). The vehicle routing problem. In Christofides, N., Mingozzi, A., Toth, P., and Sandi, C., editors, Combinatorial Optimization, pages 315-338. Wiley.
47. Cicirello, V. and Smith, S. (2001). Wasp-like Agents for distributed Factory Coordination. Technical Report CMU-RI-TR-01-39, Robotics Institute, Carnegie Mellon University, Pittsburgh.
48. Clarke, G. and Wright, G. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12:568-581.
49. Clerc, G., Bessaou, M., Siarry, P., and Bastiani, P. (2002). Identification des machines synchrones par algorithme génétique ; principe et application. Revue Internationale de Génie Electrique, 5:485-515.
50. Clerc, M. (2005). Particle Swarm Optimization. Hermes Science.
51. Clerc, M. and Kennedy, J. (2002). The particle swarm: explosion, stability and convergence in a multi-dimensional complex space. IEEE Transactions on Evolutionnary Computation, 6:58-73.
52. Coffin, M. and Saltzman, M. J. (2000). Statistical analysis of computational tests of algorithms and heuristics. INFORMS Journal on Computing, 12(1):24-44.
53. Cohoon, J., Hegde, S., Martin, W., and Richards, D. (1991). Distributed genetic algorithms for the floorplan design problem. IEEE Trans. on Computer-Aided Design, 10(4):483-492.
54. Cohoon, J. P., Hedge, S. U., Martin, W. N., and Richards, D. (1987). Punctuated equilibria: A parallel genetic algorithm. In Grefenstette, J. J., editor, Genetic algorithms and their applications : Proc. of the second Int. Conf. on Genetic Algorithms, pages 148-154, Hillsdale, NJ. Lawrence Erlbaum Assoc.
55. Collette, Y. (2002). Contribution à l'évaluation et au perfectionnement des méthodes d'optimisation multiobjectif. Application à l'optimisation des plans de rechargement de combustible nucléaire. PhD thesis, Université de Paris XII Val-de-Marne.
56. Collette, Y. and Siarry, P. (2003). Multiobjective Optimization. Springer.
57. Collins, N. E., Eglese, R. W., and Golden, B. (1988). Simulated annealing - An annotated bibliography. American Journal of Mathematical and Management Sciences, 8:209-307.
58. Colorni, A., Dorigo, M., and Maniezzo, V. (1992). Distributed Optimization by Ant Colonies. In Varela, F. and Bourgine, P., editors, Proceedings of ECAL'91 - First European Conference on Artificial Life, pages 134-142, Paris, France. Elsevier Publishing.
59. Conover, W. J. (1999). Practical Nonparametric Statistics. Wiley, Weinheim, 3rd edition.
60. Courat, J., Raynaud, G., Mrad, I., and Siarry, P. (1994). Electronic component model minimisation based on Log Simulated Annealing. IEEE Trans. on Circuits and Systems, 41(12):790-795. part I.
61. Courat, J., Raynaud, G., and Siarry, P. (1995). Extraction of the topology of equivalent circuits based on parameter statistical evolution driven by Simulated Annealing. International Journal of Electronics, 79:47-52.
62. Courrieu, P. (1991). A distributed search algorithm for hard optimization. Technical Report TA-9101, Univ. de Provence, CREPCO (URA CNRS 182).
63. Cramer, N. L. (1985). A representation for the adaptive generation of simple sequential programs. In Grefenstette, J., editor, Proc. 1st Int. Conf. on Genetic Algorithms and Their Applications, pages 183-187.
64. Creutz, M. (1983). Microcanonical Monte Carlo simulation. Physical Review Letters, 50(19):1411-1414.
65. Darwin, C. (1859). On The Origin of Species by Means of Natural Selection or the Preservation of Favored Races in the Struggle for Life. Murray, London.
66. Dasgupta, D. (1999). Artificial Immune Systems and their applications. Springer Verlag.
67. Dasgupta, D. and Attoh-Okine, N. (1997). Immune-based systems: A survey. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, volume 1, pages 369-374, Orlando. IEEE Press.
68. Davis, L. (1991). Handbook of Genetic Algorithms, p. 80. Van Nostrand Reinhold.
69. De Backer, B., Furnon, V., Kilby, P., Prosser, P., and Shaw, P. (2000). Solving vehicle routing problems with constraint programming et metaheuristics. Journal of Heuristics, 6(4).
70. De Backer, B., Shaw, P., and Furnon, V. (2002). A constraint programming toolkit for local search. In Voss, S. and Woodruff, D. L., editors, Optimization Software Class Libraries, pages 219-262. Kluwer Academic Publishers.
71. De Boer, P.-T. (2002). The Cross-Entropy Method. University of Twente. http://wwwhome.cs.utwente.nl/~ptdeboer/ce/.
72. De Castro, L. and Von Zuben, F. (1999). Artificial Immune Systems: Part I: Basic Theory and Applications. Technical Report TR-DCA 01/99, Department of Computer Engineering and Industrial Automation, School of Electrical and Computer Engineering, State University of Campinas, Brazil.
73. De Castro, L. and Von Zuben, F. (2000). Artificial Immune Systems: Part II - A Survey of Applications. Technical Report DCA-RT 02/00, Department of Computer Engineering and Industrial Automation, School of Electrical and Computer Engineering, State University of Campinas, Brazil.
74. De Jong, K. A. (1975). An Analysis of the Behavior of a Class of Genetic Adaptive Systems. Doctoral Dissertation, University of Michigan.
75. De Jong, K. A. and Sarma, J. (1993). Generation gaps revisited. In Whitley, L. D., editor, Foundations of Genetic Algorithms 2, pages 19-28. Morgan Kaufmann.
76. De La Maza, M. and Tidor, B. (1993). An analysis of selection procedures with particular attention paid to proportional and boltzmann selection. In Forrest, S., editor, Proc. 5th Int. Conf. on Genetic Algorithms, pages 124-131. Morgan Kaufmann.
77. de Werra, D. and Hertz, A. (1989). Tabu search techniques: A tutorial and applications to neural networks. OR Spectrum, 11:131-141.
78. De Wolf, T., Liesbeth, J., Holvoet, T., and Steegmans, E. (2002). A Nested Layered Threshold Model for Dynamic Task Allocation. In Dorigo, M., Di Caro, G., and Sampels, M., editors, Proceedings of the Third International Workshop on Ant Algorithms (ANTS'2002), volume 2463 of Lecture Notes in Computer Science, pages 290-291, Brussels, Belgium. Springer Verlag.
79. Deb, K. (2000). An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering, 186(2/4):311-338.
80. Deb, K. (2001). Multi-objective Optimization using Evolutionary Algorithms. John Wiley and sons.
81. Delamarre, D. and Virot, B. (1998). Simulated annealing algorithm : technical improvements. Operations Research, 32(1):43-73.
82. Di Caro, G. and Dorigo, M. (1997). AntNet: A mobile agents approach to adaptive routing. Technical Report IRIDIA/97-12, IRIDIA, Université Libre de Bruxelles, Belgium.
83. Di Caro, G. and Dorigo, M. (1998). AntNet: Distributed stigmergic control for communications networks. Journal of Artificial Intelligence Research, 9:317-365.
84. Dorigo, M., Di Caro, G., and Sampels, M., editors (2002). Proceedings of the Third International Workshop on Ant Algorithms (ANTS'2002), volume 2463 of Lecture Notes in Computer Science, Brussels, Belgium. Springer Verlag.
85. Dorigo, M. and Gambardella, L. M. (1997a). Ant Colonies for the Traveling Salesman Problem. BioSystems, 43:73-81.
86. Dorigo, M. and Gambardella, L. M. (1997b). Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Trans. Evol. Comp., 1:53-66.
87. Dorigo, M., Maniezzo, V., and Colorni, A. (1996). The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Trans. Syst. Man Cybern, B(26):29-41.
88. Dorigo, M. and Stützle, T. (2003). Handbook of Metaheuristics, volume 57 of International series in operations research and management science, chapter The Ant Colony Optimization Metaheuristics: Algorithms, Applications and Advances. Kluwer Academic Publishers, Boston Hardbound.
89. Dréo, J. and Siarry, P. (2002). A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions. In Dorigo, M., Di Caro, G., and Sampels, M., editors, Proceedings of the Third International Workshop on Ant Algorithms (ANTS'2002), volume 2463 of Lecture Notes in Computer Science, pages 216-221, Brussels, Belgium. Springer Verlag.
90. Dréo, J. and Siarry, P. (2003). Un algorithme de colonie de fourmis en variables continues hybridé avec un algorithme de recherche locale. In 5e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2003), Avignon, France.
91. Dueck, G. (1993). New optimization heuristics, the great deluge and the record to record travel. Journal of Computational physics, 104:86-92.
92. Dueck, G. and Scheuer, T. (1989). Threshold accepting. Technical report, IBM Zentrum, Heidelberg, Germany.
93. Duong, V. and Faure, P. (1998). On the applicability of the free-flight mode in european airspace. In Proceedings of the 2nd usa/europe seminar.
94. Durand, M. and White, S. (1991). Permissible error in parallel simulated annealing. Technical report, Institut de Recherche en Informatique et Systèmes aléatoires, Rennes.
95. Durand, N. (1996). Optimisation de trajectoires pour la résolution de conflits aériens en route. PhD thesis, Institut National Polytechnique de Toulouse.
96. Durand, N. and Alliot, J. (1998). Genetic crossover operator for partially separable functions. In Genetic Programming.
97. Durand, N., Alliot, J., and Noailles, J. (1996). Collision avoidance using neural networks learned by genetic algorithms. In Ninth International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, Fukuoka.
98. Durrenbach, A., Fourestié, B., Renou, S., and Raoult, M. (2003). Global shadowing margins for 3G networks. In IEEE VTC Conf., Korea.
99. Eberhart, R., Kennedy, J., and Shi, Y. (2001). Swarm Intelligence. Evolutionnary Computation. Morgan Kaufmann.
100. Eiben, A. E., van Kemenade, C. H. M., and Kok, J. N. (1995). Orgy in the computer: Multi-parent reproduction in genetic algorithms. In Moran, F., Moreno, A., Merelo, J., and Chacon, P., editors, Proceedings of the 3rd European Conference on Artificial Life, number 929 in LNAI, pages 934-945. Springer-Verlag.
101. Engrand, P. and Mouney, X. (1998). Une méthode originale d'optimisation multiobjectif. Technical Report HT-14/97/035/A, EDFDER.
102. Faigle, U. and Kern, W. (1992). Some convergence results for probabilistic tabu search. ORSA Journal on Computing, 4:32-37.
103. Feo, T. and Resende, M. (1995). Greedy randomized adaptive search procedure. Journal of Global Optimization, 42:860-878.
104. Fleury, G. (1995). Application de méthodes stochastiques inspirées du recuit simulé à des problèmes d'ordonnancement. RAIRO A.P.I.I. (Automatique - Productique - Informatique industrielle), 29(4-5):445-470.
105. Fogel, L. J., Owens, A. J., and Walsh, M. J. (1966). Artifical Intelligence through Simulated Evolution. Wiley.
106. Fonseca, C. M. and Fleming, P. J. (1993). Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization. In Proc. of the Fifth International Conference on Genetic Algorithms, pages 416-423. Morgan Kaufmann.
107. Fraser, A. S. (1957). Simulation of genetic systems by automatic digital computers. Australian Journal of Biological Sciences, 10:484-491
108. Frazzoli, E., Mao, Z., and Feron, E. (1999). Aircraft conflict resolution via semidefinite programming. AIAA Journal of Guidance, Control and Dynamics.
109. Fron, X., Maudry, B., and Tumelin, J. (1993). Arc 2000 : Automatic radar control. Technical report, Eurocontrol.
110. Gambardella, L. and Dorigo, M. (2000). Ant Colony System hybridized with a new local search for the sequential ordering problem. INFORMS Journal on Computing, 12(3):237-255.
111. Gambardella, L., Taillard, E., and Agazzi, G. (1999). New Ideas in Optimization, chapter MACS-VPTW: A multiple ant colony system for vehicle routing problems with time windows, pages 63-67. McGraw Hill, London, UK.
112. Gambardella, L. M. and Dorigo, M. (1995). Ant- Q: A Reinforcement Learning Approach to the Travelling Salesman Problem. In Proceedings Twelfth International Conference on Machine Learning, volume ML-95, pages 252-260, Palo Alto. Morgan Kaufmann.
113. Gämperle, R., Müller, S., and Koumoutsakos, P. (2002). Advances in Intelligent Systems, Fuzzy Systems, Evolutionnary Computation, chapter A Parameter Study for Differential Evolution, pages 293-298. WSEAS Press.
114. Garey, M. R. and Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W H Freeman.
115. Gaspar, A. and Collard, P. (1999). From GAs to artificial immune systems: improving adaptation in time dependent optimization. In Angeline, P., Michalewicz, Z., Schoenauer, M., Yao, X., and Zalzala, A., editors, Proceedings of the Congress on Evolutionnary Computation, volume 3, pages 1859-1866, Washington D.C.
116. Geman, S. and Geman, D. (1984). Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images. IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-6:721-741.
117. Geman, S. and Hwang, C. (1986). Diffusions for global optimization. SIAM J. on Control and Optimization, 24(5):1031-1043.
118. Gendreau, M., Hertz, A., and Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem. Management Science, 40:1276-1290.
119. Gidas, B. (1985). Nonstationary Markov chains and convergence of the Annealing Algorithm. J. Statis. Phys., 39.
120. Glover, F. (1977). Heuristics for integer programming using surrogate constraints. Decision Sciences, 8(1):156-166.
121. Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 13:533-549.
122. Glover, F. (1989). Tabu search - part I. ORSA Journal on Computing, 1:190-206.
123. Glover, F. (1990). Tabu search - part II. ORSA Journal on Computing, 2:4-32.
124. Glover, F. and Laguna, M. (1997). Tabu Search. Kluwer Academic Publishers.
125. Glover, F., Laguna, M., Taillard, E. D., and de Werra, D. (1993). Tabu Search. Number 41 in Annals of Operations Research. Baltzer Science Publisher, Basel.
126. Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization and Machine learning. Addison-Wesley.
127. Goldberg, D. E. (1994). Algorithmes génétiques. Exploration, optimisation et apprentissage automatique. Addison-Wesley France.
128. Goldberg, D. E. and Deb, K. (1991). A comparison of selection schemes used in genetic algorithms. In Rawlins, G., editor, Foundations of Genetic Algorithms, pages 69-93. Morgan Kaufmann.
129. Goldberg, D. E. and Richardson, J. (1987). Genetic algorithms with sharing for multimodal function optimization. In Grefenstette, J., editor, Proc. 2nd Int Conf. on genetic Algorithms, pages 41-49. Hillsdale, NJ: Erlbaum.
130. Gosh, R. and Tomlin, C. (2000). Maneuver design for multiple aircraft conflict resolution. In American Control Conference.
131. Goss, S., Aron, S., Deneubourg, J. L., and Pasteels J. M. (1989). Self-Organized Shortcuts in the Argentine Ant. Naturwissenchaften, 76:579-581.
132. Granger, G. (2002). Détection et résolution de conflits aériens : modélisations et analyse. PhD thesis, Ecole Polytechnique.
133. Gutjahr, W. J. (2000). A graph-based Ant System and its convergence. Future Generation Computer Systems, 16(8):873-888.
134. Gutjahr, W. J. (2002). ACO algorithms with guaranted convergence to the optimal solution. Information Processing Letters, 82(3):873-888.
135. Hadj-Alouane, A. B. and Bean, J. C. (1997). A genetic algorithm for the multiple-choice integer program. Operations Research, 45(1):92-101.
136. Hajek, B. (1988). Cooling schedules for optimal Annealing. Math. Oper. Res., 13:311-329.
137. Hajek, B. and Sasaki, G. (1989). Simulated annealing - to cool or not. Systems and Control Letters, 12:443-447.
138. Hanafi, S. (2001). On the convergence of tabu search. Journal of Heuristics, 7(1):47-58.
139. Hansen, P. and Mladenović, N. (1999). An introduction to variable neighborhood search. In Voß, S., Martello, S., Osman, I. H., and Roucairol, C., editors, Meta-heuristics : Advances and Trends in Local Search Paradigms for Optimization, pages 422-458. Kluwer, Dordrecht.
140. Hentenyrck, P. V. (1989). Constraint Satisfaction in Logic Programming. The MIT Press, Cambridge, MA.
141. Hérault, L. (1989). Réseaux de neurones récursifs pour l'optimisation combinatoire ; Application à la théorie des graphes et à la vision par ordinateur. PhD thesis, Institut National Polytechnique de Grenoble (I.N.P.G.), Grenoble.
142. Hertz, A. and de Werra, D. (1987). Using tabu search techniques for graph coloring. Computing, 39:345-351.
143. Hertz, A. and de Werra, D. (1991). The tabu search metaheuristic: How we used it. Annals of Mathematics and Artificial Intelligence, 1:111-121.
144. Hertz, A. and Kobler, D. (2000). A framework for the description of evolutionary algorithms. European Journal of Operational Research, 126(1):1-12.
145. Holland, J. H. (1962). Outline for logical theory of adaptive systems. J. Assoc. Comput. Mach., 3:297-314.
146. Holland, J. H. (1992). Adaptation in Natural and Artificial Systems, 2nd edition. MIT Press.
147. Hölldobler, B. and Wilson, E. (1990). The Ants. Springer Verlag.
148. Holma, H. and Toskala, A. (2000). WCDMA for UMTS, Radio Access for Third Generation Mobile Communications. John Wiley & Sons Ltd, England.
149. Homaifar, A., Lai, S. H.-Y., and Qi, X. (1994). Constrained optimization via genetic algorithms. Simulation, 62(4):242-254.
150. Hooker, J. (1995). Testing heuristics : We have it all wrong. Journal of Heuristics, 1(1):33-42.
151. Horn, J., Nafpliotis, N., and Goldberg, D. E. (1994). A niched pareto genetic algorithm for multiobjective optimization. In Proc. 1st IEEE Conf. on Evolutionary Computation, pages 82-87. IEEE Piscataway.
152. Horst, R. and Pardolos, P. M., editors (1995). Handbook of Global Optimization. Kluwer Academic Publishers.
153. Horst, R. and Tuy, H. (1995). Global Optimization, Deterministic Approaches. Springler.
154. Hutchinson, G. E. (1957). Concluding remarks, population studies: Animal ecology and demography. In Cold Spring Harbor Symposia on Quantitative Biology 22, pages 415-427.
155. ILOG (2002a). ILOG Dispatcher Reference Manual, Version 3.3. ILOG S.A.
156. ILOG (2002b). ILOG Solver Reference Manual, Version 5.3. ILOG S.A.
157. Jeffcoat, D. and Bulfin, R. (1993). Simulated annealing for resource-constrained scheduling. European Journal of Operational Research, 70(1):43-51.
158. Jennings, N. R. (1996). Coordination Techniques for Distributed Artificial Intelligence. In G. M. P. O'Hare and N. R. Jennings, editor, Foundations of Distributed Artificial Intelligence, pages 187-210. John Wiley & Sons.
159. Jimenez, V. M. and Marzal, A. (1999). Computing the k shortest paths: A new algorithm and an experimental comparison. In Vitter, J. S. and Zaroliagis, C. D., editors, Proc. 3rd Worksh. Algorithm Engineering, number 1668 in Lecture Notes in Computer Science, pages 15-29. Springer-Verlag.
160. Johnson, D., Aragon, C., McGeoch, L., and Schevon, C. (1989). Optimization by simulated annealing : an experimental evaluation - Part I (Graph partitioning). Opns. Res., 37(6):865-892.
161. Johnson, D., Aragon, C., McGeoch, L., and Schevon, C. (1991). Optimization by simulated annealing : an experimental evaluation - Part II (Graph coloring and number partitioning). Opns. Res., 39(3):378-406.
162. Johnson, D., Aragon, C., McGeoch, L., and Schevon, C. (1992). Optimization by simulated annealing : an experimental evaluation - Part III (The travelling salesman problem). Opns. Res.
163. Joines, J. and Houck, C. (1994). On the use of nonstationary penalty functions to solve nonlinear constrained optimization problems with gas. In Michalewicz, Z., Schaffer, J. D., Schwefel, H.-P., Fogel, D. B., and Kitano, H., editors, Proceedings of the First IEEE International Conference on Evolutionary Computation, pages 579-584. IEEE Press.
164. Kennedy, J. (2000). Stereotyping: Improving particle Swarm performances with cluster analysis. In Proceedings of the 2000 Congress on Evolutionnary Computation, pages 1507-1512, Piscataway. IEEE Service Center.
165. Kennedy, J. and Eberhart, R. C. (1995). Particle swarm optimization. In Proc. IEEE Int'l. Conf. on Neural Networks, volume IV, pages 1942-1948, Piscataway, NJ: IEEE Service Center.
166. Kilby, P., Shaw, P., and Prosser, P. (1997). Guided local search for the vehicle routing problem. In In Proceedings of the 2nd International Conference on Meta-heuristics.
167. Kirkpatrick, S., Gelatt, C., and Vecchi, M. (1983). Optimization by simulated annealing. Science, 220(4598):671-680.
168. Kirkpatrick, S. and Toulouse, G. (1985). Configuration space analysis of travelling salesman problems. J. Physique, 46:1277-1292.
169. Koza, J. R. (1992). Genetic Programming: on the Programming of Computers by Means of Natural Selection. MIT Press.
170. Koza, J. R. (1994). Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press.
171. Kravitz, S. and Rutenbar, R. (1987). Placement by simulated annealing on a multiprocessor. IEEE Trans. on Computer Aided Design, CAD-6:534-549.
172. Lampinen, J. (2001). A Bibliography of Differential Evolution Algorithm. Technical report, Lappeenranta University of Technology, Department of Information Technology, Laboratory of Information Processing.
173. Larranaga, P. and Lozano, J. (2002). Estimation of Distribution Algorithms, A New Tool for Evolutionnary Computation. Genetic Algorithms and Evolutionnary Computation. Kluwer Academic Publishers.
174. Leriche, R. G., Knopf-Lenoir, C., and Haftka, R. T. (1995). A segregated genetic algorithm for constrained structural optimization. In Eshelman, L. J., editor, Proc. of the Sixth Int. Conf. on Genetic Algorithms, pages 558-565, San Francisco, CA. Morgan Kaufmann.
175. Ling, C., Jie, S., Ling, Q., and Hongjian, C. (2002). A Method for Solving Optimization Problems in Continuous Space Using Ant Colony Algorithm. In Dorigo, M., Di Caro, G., and Sampels, M., editors, Proceedings of the Third International Workshop on Ant Algorithms (ANTS'2002), volume 2463 of Lecture Notes in Computer Science, pages 288-289, Brussels, Belgium. Springer Verlag.
176. Mackworth, A.-K. (1977). Consistency in networks of relations. Artificial Intelligence, 8:99-118.
177. Mahfoud, S. W. (1992). Crowding and preselection revisited. In Manner, R. and Manderick, B., editors, Proc. of Parallel Problem Solving from Nature, pages 27-36. Elsevier.
178. Mathias, K. and Whitley, D. (1992). Genetic operators, the fitness landscape and the traveling salesman problem. In Manner, R. and Manderick, B., editors, Parallel Problem Solving from nature, 2, pages 221-230. Elsevier Science Publishers.
179. Mathur, M., Karale, S. B., Priye, S., Jyaraman, V. K., and Kulkarni, B. D. (2000). Ant Colony Approach to Continuous Function Optimization. Ind. Eng. Chem. Res., 39:3814-3822.
180. Mautor, T. and Michelon, P. (1997). Mimausa : a new hybrid method combining exact solution and local search. In 2nd International Conference on Metaheuristics, page 15, Sophia-Antipolis, France.
181. Médioni, F. (1998). Méthodes d'optimisation pour l'évitement aérien : systèmes centralisés, systèmes embarqués. PhD thesis, Ecole Polytechnique.
182. Merkle, D., Middendorf, M., and Schmek, H. (2000). Ant Colony Optimization for resource-constrained project scheduling. In Proceedings of the Genetic and Evolutionnary Computation Conference (GECCO-2000), pages 839-900, San Francisco, CA. Morgan Kaufmann Publishers.
183. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., and Teller, E. (1953). Equation of state calculations by fast computing machines. J. Chem. Phys., 21:1087-1090.
184. Meunier, H., Bachelet, V., Talbi, E., and Caminada, A. (2001). A multi-objective genetic approach applied to cellular network design. In ALGOTEL' 2001, France.
185. Michalewicz, Z. (1996). Genetic Algorithms + Data Structures = Evolution Programs, 3rd rev. and extended ed. Springer Verlag.
186. Michalewicz, Z. and Janikow, C. Z. (1994). Genocop: A genetic algorithm for numerical optimization problems with linear constraints. Communications of the ACM.
187. Michalewicz, Z. and Nazhiyath, G. (1995). Genocop III : A co-evolutionary algorithm for numerical optimization problems with nonlinear constraints. In Proceedings of the Second IEEE Conference on Evolutionary Computation, pages 647-651.
188. Miclo, L. (1991). Evolution de l'énergie libre. Applications à l'étude de la convergence des algorithmes du recuit simulé. PhD thesis, Université de Paris 6.
189. Monmarché, N., Ramat, E., Dromel, G., Slimane, M., and Venturini, G. (1999). On the similarities between AS, BSC and PBIL: toward the birth of a newmeta-heuristics. E3i 215, Université de Tours.
190. Monmarché, N., Venturini, G., and Slimane, M. (2000). On how Pachycondyla apicalis ants suggest a new search algorithm. Future Generation Computer Systems, 16:937-946.
191. Montana, D. J. (1995). Strongly typed genetic programming. Evolutionary Computation, 3(2):199-230.
192. Montana, D. J. and Davis, L. (1989). Training feedforward neural networks using genetic algorithms. In Sridharan, N., editor, Proc. 11th. Int. Joint Conf. on Artificial Intelligence, pages 762-767.
193. Moscato, P. (1999). Memetic algorithms : A short introduction. In Corne, D., Glover, F., and Dorigo, M., editors, New Ideas in Optimisation, pages 219-235. McGraw-Hill, Londres.
194. Mühlenbein, H., Gorges-Schleuter, M., and Krämer, O. (1988). Evolution algorithms in combinatorial optimization. Parallel Computing, 7:65-88.
195. Mühlenbein, H. and Paaß, G. (1996). From recombination of genes to the estimation of distributions I. Binary parameters. Lecture Notes in Computer Science 1411: Parallel Problem Solving from Nature, PPSN IV:178-187.
196. Musser, K., Dhingra, J., and Blankenship, G. (1993). Optimization based job shop scheduling. IEEE Trans. on Automatic Control, 38(5):808-813.
197. Niedringhaus, W. (1989). A mathematical formulation for planning automated aircraft separation for AERA3. Technical report, FAA. DOT/FAA/DS-89/20.
198. Nomura, T. and Shimohara, K. (2001). An analysis of two-parent recombinations for real-valued chromosomes in an infinite population. Evolutionary Computation, 9(3):283-308.
199. Nouyan, S. (2002). Agent-Based Approach to Dynamic task Allocation. In Dorigo, M., Di Caro, G., and Sampels, M., editors, Proceedings of the Third International Workshop on Ant Algorithms (ANTS'2002), volume 2463 of Lecture Notes in Computer Science, pages 28-39, Brussels, Belgium. Springer Verlag.
200. Osman, I. H. and Laporte, G. (1995). Routing problems: A bibliography. Annals of Operations Research, 61:227-262.
201. Panta, L. (2002). Modeling Transportation Problems Using Concepts of Swarm Intelligence and Soft Computing. PhD thesis, Virginia Tech, Blacksburg, Virginia.
202. Petrowski, A. (1996). A clearing procedure as a niching method for genetic algorithms. In IEEE 3rd International Conference on Evolutionary Computation (ICEC'96), pages 798-803.
203. Petrowski, A. and Girod Genet, M. (1999). A classification tree for speciation. In Congress on Evolutionary Computation (CEC99), pages 204-211. IEEE Piscataway.
204. Pham, D. and Karaboga, D. (2000). Intelligent optimisation techniques. Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks. Springer.
205. Pirlot, M. (1992). General local search heuristics in Combinatorial Optimization : a tutorial. Belgian Journal of Operations Research and Computer Science, 32(1-2):7-67.
206. Rammal, R., Toulouse, G., and Virasoro, M. (1986). Ultrametricity for Physicists. Reviews of Modern Physics, 58(3):765-788.
207. Rechenberg, I. (1965). Cybernetic Solution Path of an Experimental Problem. Royal Aircraft Establishment Library Translation.
208. Rechenberg, I. (1973). Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzboog, Stuttgart.
209. Reeves, C., editor (1995). Modern Heuristic Techniques for Combinatorial Problems. Advances topics in computer science. Mc Graw-Hill.
210. Regin, J.-C. (1994). A filtering algorithm for constraints of difference in CSPs. In Proceedings of the 11th AAAI. The MIT Press.
211. Regin, J.-C. (1996). Generalized arc consistency for global cardinality constraint. In Proceedings of the 13th AAAI. The MIT Press.
212. Rego, C. and Roucairol, C. (1996). A parallel tabu search algorithm using ejection chains for the VRP. In Osman, I. and Kelly, J., editors, Meta-Heuristic : Theory & Applications, pages 253-295. Kluwer, Dordrecht.
213. Renders, J. and Flasse, S. (1996). Hybrid methods using genetic algorithms for global optimization. IEEE Trans. on Systems, Man, and Cybernetics - Part B: Cybernetics, 26(2).
214. Resende,M. (2000). Greedy randomized adaptive search procedures (GRASP). Technical Report TR 98.41.1, AT&T Labs-Research.
215. Rinnooy Kan, A. and Timmer, G. (1987a). Stochastic global optimization methods - Part I: Clustering methods. Mathematical Programming, 39:27-56.
216. Rinnooy Kan, A. and Timmer, G. (1987b). Stochastic global optimization methods-Part II : Multi level methods. Mathematical Programming, 39:57-78.
217. Rochat, Y. and Semet, F. (1994). A tabu search approach for delivering pet food and flour in Switzerland. Journal of the Operational Research Society, 45:1233-1246.
218. Rochat, Y. and Taillard, E. D. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1(1):147-167.
219. Rogalsky, T. and Derksen, R. (2000). Hybridization of Differential Evolution for Aerodynamic Design. In 8th Annual Conference of the Computational Fluid Dynamics Society of Canada, Montréal.
220. Rogers, A. and Prügel-Bennett, A. (1999). Genetic drift in genetic algorithm selection schemes. IEEE Transactions on Evolutionary Computation, 3(4):298-303.
221. Rossi, F. (2000). Constraint logic programming. In Proceedings of the ERCIM/Compulog Net workshop on constraints, LNAI 1865. Et.
222. Roussel-Ragot, P. (1990). La méthode du recuit simulé : accélération et parallélisation. PhD thesis, Université de Paris 6.
223. Roussel-Ragot, P., Siarry, P., and Dreyfus, G. (1990). A problem independent parallel implementation of simulated annealing: Models and experiments. In IEEE Trans. CADICS, volume 9, pages 827-835.
224. Rubinstein, R. (1997). Optimization of computer simulation models with rare events. European Journal of Operations Research, 99:89-112.
225. Rubinstein, R. (1999). The simulated entropy method for combinatorial and continuous optimization. Methodology and Computing in Applied Probability, 2:127-190.
226. Rubinstein, R. (2001). Stochastic Optimization: Algorithms and Applications, chapter Combinatorial optimization, cross-entropy, ants and rare events, pages 304-358. Kluwer Academic Publishing.
227. Rudolph, G. (1994). Convergence analysis of canonical genetic algorithms. IEEE Trans. on Neural Networks, 5(1):96-101.
228. Rudolph, G. (1996). Convergence of evolutionary algorithms in general search spaces. In Proc. IEEE Int. Conf. on Evolutionary Computation 96, pages 50-54. IEEE Press.
229. Runarsson, T. P. and Yao, X. (2000). Stochastic ranking for constrained evolutionary optimization. IEEE Transactions on Evolutionary Computation, 4(3):274-283.
230. Saït, S. and Youssef, H. (1999). Iterative computer algorithms with applications in engineering. IEEE Computer Society Press.
231. Sareni, B. and Krahenbuhl, L. (1998). Fitness sharing and niching methods revisited. IEEE Transactions on Evolutionary Computation, 2(3):97-106.
232. Schoenauer, M. and Michalewicz, Z. (1996). Evolutionary computation at the edge of feasibility. In Voigt, H.-M., Ebeling, W., Rechenberg, I., and Schwefel, H.-P., editors, Parallel Problem Solving from Nature - PPSN IV, pages 245-254, Berlin. Springer.
233. Schoenauer, M. and Xanthakis, S. (1993). Constrained GA optimization. In Forrest, S., editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 573-580, San Mateo, CA. Morgan Kaufmann.
234. Schoonderwoerd, R., Holland, O., Brutent, J., and Rothkrantz, L. (1996). Ant-based load balancing in telecommunication networks. Adaptive Behavior, 5(2):169-207.
235. Schwefel, H.-P. (1981). Numerical Optimization of Computer Models. Wiley.
236. Sechen, C. (1988). VLSI placement and global routing using simulated annealing. Kluwer Academic Publishers.
237. Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. Technical report, ILOG S.A., Gentilly, France.
238. Shi, Y. and Eberhart, R. (1998). A modified particle swarm optimizer. In Proceedings of the IEEE International Conference on Evolutionnary Computation, pages 69-73, Piscataway. IEEE Press.
239. Shi, Y. and Eberhart, R. (1999). Empirical study of particle swarm optimization. In Proceedings of the 1999 Congress on Evolutionnary Computation, pages 1945-1950, Piscataway. IEEE Service Center.
240. Siarry, P. (1986). La méthode du recuit simulé : application à la conception de circuits électroniques. PhD thesis, Université de Paris 6.
241. Siarry, P. (1994). La méthode du recuit simulé en électronique. Adaptation et accélération. Comparaison avec d'autres méthodes d'optimisation. Application dans d'autres domaines. Habilitation à diriger les recherches en sciences physiques, Université de Paris-Sud (Orsay).
242. Siarry, P. (1995). La méthode du recuit simulé : théorie et applications. RAIRO A.P.I.I. (Automatique - Productique - Informatique industrielle), 29(4-5):535-561.
243. Siarry, P., Bergonzi, L., and Dreyfus, G. (1987). Thermodynamic optimization of block placement. IEEE Trans. on Computer Aided Design, CAD-6(2):211-221.
244. Siarry, P. and Berthiau, G. (1997). Fitting of tabu search to optimize functions of continuous variables. International Journal for Numerical Methods in Engineering, 40:2449-2457.
245. Siarry, P. and Dreyfus, G. (1984). An application of physical methods to the computer aided design of electronic circuits. J. Physique Lettres, 45:L39-L48.
246. Siarry, P. and Dreyfus, G. (1989). La méthode du recuit simulé : théorie et applications. ESPCI - IDSET, 10 rue Vauquelin, 75005 Paris.
247. Sizun, H. (2003). La propagation des Ondes Radioélectriques. Springer-Verlag, Paris.
248. Solla, S., Sorkin, G., and White, S. (1986). Configuration space analysis for optimization problems. In Bienenstock, E., Fogelman Soulie, F., and Weisbuch, G., editors, Disordered Systems and Biological Organization, pages 283-292, New York. Springer-Verlag.
249. Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research, 35:254-265.
250. Sorkin, G. B. (1991). Efficient Simulated Annealing on Fractal Energy Landscapes. Algorithmica, 6:367-418.
251. Spears, W. M. (1994). Simple subpopulation schemes. In Proc. Conf. on evolutionary Programming, pages 296-307. World Scientific.
252. Srinivas, N. and Deb, K. (1994). Multiobjective function optimization using nondominated sorting genetic algorithms. Evolutionary Computation, 2(3):221-248.
253. Storn, R. (1997). Differential Evolution - A Simple and Efficient Heuristic Strategy for Global Optimization over Continuous Spaces. Journal of Global Optimization, 11:341-359.
254. Storn, R. and Price, K. (1995). Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces. Technical Report TR95 -012, International Computer Science Institute, Berkeley, California.
255. Stützle, T. and Hoos, H. (1997). Improvements on the Ant System: Introducing MAX-MIN Ant System. In Proceedings International Conference on Artificial Neural Networks and Genetic Algorithms, Vienna. Springer-Verlag.
256. Stützle, T. and Hoos, H. (2000). MAX-MIN Ant System. Future Generation Computer System, 16:889-914.
257. Surry, P. D., Radcliffe, N. J., and Boyd, I. D. (1995). A Multi- Objective Approach to Constrained Optimisation of Gas Supply Networks : The COMOGA Method. In Fogarty, T. C., editor, Evolutionary Computing. AISB Workshop. Selected Papers, Lecture Notes in Computer Science, pages 166-180, Sheffield, U.K. Springer-Verlag.
258. Taillard, E. D. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, 47(1):65-74.
259. Taillard, E. D. (1991). Robust taboo search for the quadratic assignment problem. Parallel Computing, 17:443-455.
260. Taillard, E. D. (1993). Parallel iterative search methods for vehicle routing problems. Networks, 23:661-673.
261. Taillard, E. D. (1994). Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing, 6(2):108-117.
262. Taillard, E. D. (1995). Comparison of iterative searches for the quadratic assignment problem. Location science, 3(2):87-105.
263. Taillard, E. D. (1998). Programmation à mémoire adaptative et al.gorithmes pseudo-gloutons : nouvelles perspectives pour les méta-heuristiques. Thèse d'habilitation à diriger des recherches, Université de Versailles, France.
264. Taillard, E. D. (2002). Principes d'implémentation des métaheuristiques. In Teghem, J. and Pirlot, M., editors, Optimisation approchée en recherche opérationnelle, pages 57-79. Lavoisier, Paris. Note : STAMP software is available at http://ina.eivd.ch/taillard.
265. Taillard, E. D. (2003a). Heuristic methods for large centroid clustering problems. Journal of Heuristics, 9(1):51-73.
266. Taillard, E. D. (2003b). A statistical test for comparing success rates. In Metaheuristic international conference MIC'03, Kyoto, Japan.
267. Taillard, E. D., Badeau, P., Guertin, F., Gendreau, M., and Potvin, J. (1997). A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation science, 31(2):170-186.
268. Taillard, E. D., Gambardella, L. M., Gendreau, M., and Potvin, J.-Y. (1998). Adaptive Memory Programming: A Unified View of Meta- Heuristics. European Journal of Operational Research, 135(1):1-16.
269. Taillard, E. D. and Voß, S. (2002). POPMUSIC - partial optimization meta-heuristic under special intensification conditions. In Ribeiro, C. and Hansen, P., editors, Essays and surveys in metaheuristics, pages 613-629. Kluwer, Dordrecht.
270. Talbi, E. (2002). A taxonomy of hybrid metaheuristics. Journal of Heuristics, 8:541-564.
271. Teghem, J. and Pirlot, M. (2002). Optimisation approch ée en recherche opérationnelle. Recherches locales, réseaux neuronaux et satisfaction de contraintes. Hermès.
272. Theraulaz, G., Bonabeau, E., and Deneubourg, J.-L. (1998). Response Threshold Reinforcement and Division of Labour in Insect Societies. In Proceedings of the Royal Society of London B, volume 265, pages 327-335.
273. Tsang, E. (1993). Foundations of Constraint Satisfaction. Academic Press.
274. Tsui, K. and Liu, J. (2003). Multiagent Diffusion and Distributed Optimization. In Proceedings of the Second International Joint Conference on Autonomous Agents & Multiagent Systems.
275. Ulungu, E., Teghem, J., Fortemps, P., and Tuyttens, D. (1999). MOSA method : a tool for solving multiobjective combinatorial optimization problems. Journal of Multicriteria Decision Analysis, 8:221-236.
276. Van Laarhoven, P. and Aarts, E. (1987). Simulated annealing : theory and applications. D. Reidel Publishing Company, Dordrecht (The Netherlands).
277. Van Laarhoven, P., Aarts, E., and Lenstra, J. (1992). Job-shop scheduling by simulated annealing. Op. Res., 40:113-125.
278. Vecchi, M. and Kirkpatrick, S. (1983). Global wiring by simulated annealing. IEEE Trans. on C.A.D., CAD-2(4):215-222.
279. Voß, S. and Woodruff, D. L. (2002). Optimization Software Class Libraries. OR/CS Interfaces Series. Kluwer, Dordrecht.
280. Weiss, G. (1999). Multiagent Systems. MIT Press.
281. White, T., Pagurek, B., and Oppacher, F. (1998). Connection Management using Adaptive Agents. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'98), pages 802-809.
282. Wilson, E. (1984). The relation between Caste Ratios and Division of Labour in the Ant Genus Pheidole (Hymenoptera: Formicidae). Behav. Ecol. Sociobiol., 16:89-98.
283. Wilson, E. and Hölldobler, B. (1988). Dense Heterarchy and mass communication as the basis of organization in ant colonies. Trend in Ecology and Evolution, 3:65-68.
284. Wittner, O. and Helvik, B. (2002). Cross-Entropy Guided Ant-Like Agents Finding Cyclic Paths in Scarely Meshed Networks. In Dorigo, M., Di Caro, G., and Sampels, M., editors, Proceedings of the Third International Workshop on Ant Algorithms (ANTS'2002), volume 2463 of Lecture Notes in Computer Science, pages 121-134, Brussels, Belgium. Springer Verlag.
285. Wodrich, M. and Bilchev, G. (1997). Cooperative distributed search: the ant's way. Control and Cybernetics, 26(3).
286. Wong, D., Leong, H., and Liu, C. (1988). Simulated annealing for VLSI design. Kluwer Academic Publishers.
287. Woodruff, D. L. and Zemel, E. (1993). Hashing vectors for tabu search. In Glover, G., Laguna, M., Taillard, E. D., and de Werra, D., editors, Tabu Search, number 41 in Annals of Operations Research, pages 123-137, Basel, Switzerland. Baltzer.
288. Wright, S. (1932). The roles of mutation, inbreeding, crossbreeeding and selection in evolution. In Jones, D. F., editor, Proc. of the Sixth International Congress on Genetics, pages 356-366.
289. Xu, J. and Kelly, J. P. (1996). A network flow-based tabu search heuristic for the vehicle routing problem. Transportation Science, 30(4):379-393.
290. Yao, X. and Liu, Y. (1996). Fast evolutionary programming. In Fogel, L. J., Angeline, P. J., and Bäck, T., editors, Proc. 5th Ann. Conf. on Evolutionary Programming, pages 451-460. MIT Press.
291. Yin, X. and Germay, N. (1993a). A fast genetic algorithm with sharing scheme using cluster analysis methods in multimodal function optimization. In R.F.Albrecht, C. R. and Steele, N., editors, In proceedings of the Artificial Neural Nets and Genetic Algorithm International Conference, Insbruck Austria. Springer-Verlag.
292. Yin, X. and Germay, N. (1993b). A fast genetic algorithm with sharing scheme using cluster methods in multimodal function optimization. In Albrecht, R. F., Reeves, C. R., and Steele, N. C., editors, Proc. of the International Conference on Artificial Neural Nets and Genetic Algorithms, pages 450-457. Springer-Verlag.
293. Zeghal, K. (1994). Vers une théorie de la coordination d'actions, application à la navigation aérienne. PhD thesis, Universite Paris VI.
294. Zitzler, E. and Thiele, L. (1999). Multiobjective evolutionary algorithms : A comparative case study and the strength pareto approach. IEEE Trans. on Evolutionary Computation, 3(4):257-271.