Cellular genetic algorithms

Operations Research/ Computer Science Interfaces Series

Volumn 42, Issue , 2008, Pages 1-242

  Alba, Enrique ^a   Dorronsoro, Bernabé ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84888634780     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-77610-1     Document Type: Article

References (272)

1. Java language specification. http://java. sun. com.
2. ProActive official web site. http://www-sop. inria. fr/oasis/proactive/.
3. D. H. Ackley. A Connectionist Machine for Genetic Hillclimbing. Kluwer Academic Publishers, Boston, MA, 1987.
4. P. Adamidis and V. Petridis. Co-operating populations with different evolution behaviours. In Proc. IEEE International Conference on Evolutionary Computation (CEC), pages 188-191. IEEE Press, 1996.
5. E. Alba. Análisis y Diseño de Algoritmos Genéticos Paralelos Distribuidos. PhD thesis, Universidad de Málaga, Málaga, Febrero 1999.
6. E. Alba. Parallel Metaheuristics: A New Class of Algorithms. Wiley, October 2005.
7. E. Alba, H. Alfonso, and B. Dorronsoro. Advanced models of cellular genetic algorithms evaluated on SAT. In Proc. of the Genetic and Evolutionary Computation COnference (GECCO), pages 1123-1130, Washington D. C., USA, June 25-29 2005. ACM Press.
8. E. Alba, P. Bouvry, B. Dorronsoro, F. Luna, and A. J. Nebro. A cellular multiobjective genetic algorithm for optimal broadcasting strategy in metropolitan MANETs. In Nature Inspired Distributed Computing (NIDISC) sessions of the International Parallel and Distributed Processing Simposium (IPDPS) Workshop, page 192b, Denver, Colorado, USA, 2005.
9. E. Alba, J. F. Chicano, B. Dorronsoro, and G. Luque. Diseño de códigos correctores de errores con algoritmos genéticos. In Actas del Tercer Congreso Español sobre Metaheurísticas, Algoritmos Evolutivos y Bioinspirados (MAEB), pages 51-58, Córdoba, Spain, 2004.
10. E. Alba and B. Dorronsoro. Auto-adaptación en algoritmos evolutivos celulares. Un nuevo enfoque algorítimico. In Actas del Segundo Congreso Español sobre Metahurísticas, Algoritmos Evolutivos y Bioinspirados (MAEB), pages 176-185, Gijón, Spain, 2003.
11. E. Alba and B. Dorronsoro. Solving the vehicle routing problem by using cellular genetic algorithms. In J. Gottlieb and G. R. Raidl, editors, Evolutionary Computation in Combinatorial Optimization (EvoCOP), volume 3004 of Lecture Notes in Computer Science (LNCS), pages 11-20, Coimbra, Portugal, 5-7 April 2004. Springer-Verlag, Heidelberg.
12. E. Alba and B. Dorronsoro. The exploration/exploitation tradeoff in dynamic cellular evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 9(2): 126-142, April 2005.
13. E. Alba and B. Dorronsoro. Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm. Information Processing Letters, 98(6): 225-230, June 2006.
14. E. Alba and B. Dorronsoro. Engineering Evolutionary Intelligent Systems, chapter 13, A Hybrid Cellular Genetic Algorithm for the Capacitated Vehicle Routing Problem. Studies in Computational Intelligence. Springer-Verlag, Heidelberg, 2007. To appear.
15. E. Alba, B. Dorronsoro, and H. Alfonso. Cellular memetic algorithms. Journal of Computer Science and Technology, 5(4): 257-263, December 2005.
16. E. Alba, B. Dorronsoro, and H. Alfonso. Cellular memetic algorithms evaluated on SAT. In XI Congreso Argentino de Ciencias de la Computación (CACIC), 2005. CD Edition.
17. E. Alba, B. Dorronsoro, M. Giacobini, and M. Tomassini. Handbook of Bioinspired Algorithms and Applications, chapter 7, Decentralized Cellular Evolutionary Algorithms, pages 103-120. CRC Press, 2006.
18. E. Alba, B. Dorronsoro, F. Luna, A. J. Nebro, P. Bouvry, and L. Hogie. A cellular multi-objective genetic algorithm for optimal broadcasting strategy in metropolitan MANETs. Computer Communications, 30(4): 685-697, 2007.
19. E. Alba, M. Giacobini, M. Tomassini, and S. Romero. Comparing synchronous and asynchronous cellular genetic algorithms. In J. J. Merelo et al., editor, Proc. of the International Conference on Parallel Problem Solving from Nature VII (PPSN-VII), volume 2439 of Lecture Notes in Computer Science (LNCS), pages 601-610, Granada, Spain, 2002. Springer-Verlag, Heidelberg.
20. E. Alba, F. Luna, and A. J. Nebro. Advances in parallel heterogeneous genetic algorithms for continuous optimization. International Journal of Applied Mathematics and Computer Science, 14(3): 101-117, 2004.
21. E. Alba and G. Luque. Growth curves and takeover time in distributed evolutionary algorithms. In K. Deb et al., editor, Proc. of the Genetic and Evolutionary Computation COnference (GECCO), volume 3102 of Lecture Notes in Computer Science (LNCS), pages 864-876. Springer-Verlag, Heidelberg, 2004.
22. E. Alba and G. Luque. A new local search algorithm for the DNA fragment assembly problem. In C. Cotta and J. van Hemert, editors, Evolutionary Computation in Combinatorial Optimization (Evo), volume 4446 of Lecture Notes in Computer Science (LNCS), pages 1-12, Valencia, Spain, April 2007. Springer-Verlag, Heidelberg.
23. E. Alba, J. Madera, B. Dorronsoro, A. Ochoa, and M. Soto. Theory and practice of cellular UMDA for discrete optimization. In T. P. Runarsson et al., editor, Proc. of the International Conference on Parallel Problem Solving from Nature IX (PPSN-IX), volume 4193 of Lecture Notes in Computer Science (LNCS), pages 242-251, Reykjavik, Iceland, September 2006. Springer-Verlag, Heidelberg.
24. E. Alba and J. F. Saucedo. Panmictic versus decentralized genetic algorithms for non-stationary problems. In Sixth Metaheuristics International Conference (MIC), pages 7-12, Austria, 2005.
25. E. Alba and M. Tomassini. Parallelism and evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 6(5): 443-462, October 2002.
26. E. Alba and J. M. Troya. Cellular evolutionary algorithms: Evaluating the influence of ratio. In M. Schoenauer, editor, Proc. of the International Conference on Parallel Problem Solving from Nature VI (PPSN-VI), volume 1917 of Lecture Notes in Computer Science (LNCS), pages 29-38. Springer-Verlag, Heidelberg, 2000.
27. E. Alba and J. M. Troya. Improving flexibility and efficiency by adding parallelism to genetic algorithms. Statistics and Computing, 12(2): 91-114, 2002.
28. J. Arabas, Z. Michalewicz, and J. Mulawka. GAVaPS-a genetic algorithm with varying population size. In Proc. IEEE International Conference on Evolutionary Computation (CEC), volume 1, pages 73-78, 1994.
29. P. Augerat, J. M. Belenguer, E. Benavent, A. Corberán, D. Naddef, and G. Rinaldi. Computational results with a branch and cut code for the capacitated vehicle routing problem. Research Report 949-M, Universite Joseph Fourier, Grenoble, France, 1995.
30. T. Bäck. Self-adaptation in genetic algorithms. In F. J. Varela and P. Bourgine, editors, Proc. of the 1st European Conference on Artificial Life, pages 263-271, Cambridge, MA, 1992. The MIT Press.
31. T. Bäck. Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press, New York, 1996.
32. T. Bäck, A. E. Eiben, and M. E. Vink. A superior evolutionary algorithm for 3-SAT. In V. W. Porto, N. Saravanan, D. Waagen, and A. E. Eiben, editors, International Conference on Evolutionary Programming VII, volume 1477 of Lecture Notes in Computer Science (LNCS). Springer-Verlag, Heidelberg, 1998.
33. T. Bäck, D. B. Fogel, and Z. Michalewicz, editors. Handbook of Evolutionary Computation. Oxford University Press, 1997.
34. T. Bäck, G. Rudolf, and H.-P. Schwefel. Evolutionary programming and evolution strategies: similarities and differences. In D. B. Fogel and W. Atmar, editors, Proc. of the Second Conference on Evolutionary Programming, pages 11-22, La Jolla, California, 1993. Evolutionary Programming Society.
35. S. Baluja. Structure and performance of fine-grain parallelism in genetic search. In S. Forrest, editor, Proc. of the Fifth International Conference on Genetic Algorithms (ICGA), pages 155-162. Morgan Kaufmann, 1993.
36. W. Banzhaf. The "molecular" traveling salesman. Biological Cybernetics, 64: 7-14, 1990.
37. J. Berger and M. Barkaoui. A hybrid genetic algorithm for the capacitated vehicle routing problem. In E. Cantú-Paz, editor, Proc. of the Genetic and Evolutionary Computation COnference (GECCO), volume 2723 of Lecture Notes in Computer Science (LNCS), pages 646-656, Illinois, Chicago, USA, 2003. Springer-Verlag, Heidelberg.
38. A. Bethke. Comparison of genetic algorithms and gradient based optimizers on parallel processors: Efficiency of use of precessing capacity. Technical Report 197, Ann Arbor, University of Michigan, 1976.
39. C. Blum and A. Roli. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys, 35(3): 268-308, 2003.
40. E. Bonabeau, M. Dorigo, and G. Theraulaz. Swarm Intelligence. From Natural to Artificial Systems. Oxford University Press, 1999.
41. H. J. Bremermann. Self-Organizing Systems, chapter Optimization Trough Evolution and Resombination, pages 93-106. Spartan Books, Washington DC, 1962.
42. S. Cahon, N. Melab, and E-G. Talbi. ParadisEO: A framework for the reusable design of parallel and distributed metaheuristics. Journal of Heuristics, 10(3): 357-380, May 2004.
43. E. Cantú-Paz. Efficient and Accurate Parallel Genetic Algorithms, volume 1 of Book Series on Genetic Algorithms and Evolutionary Computation. Kluwer Academic Publishers, 2nd edition, 2000.
44. M. Capcarrère, M. Tomassini, A. Tettamanzi, and M. Sipper. A statistical study of a class of cellular evolutionary algorithms. Evolutionary Computation, 7(3): 255-274, 1999.
45. H. Chen, N. S. Flann, and D. W. Watson. Parallel genetic simulated annealing: A massively parallel SIMD algorithm. IEEE Transactions on Parallel and Distributed Systems, 9(2): 126-136, 1998.
46. N. Christofides and S. Eilon. An algorithm for the vehicle dispatching problem. Operations Research Quartely, 20: 309-318, 1969.
47. N. Christofides, A. Mingozzi, and P. Toth. Combinatorial Optimization, chapter The Vehicle Routing Problem, pages 315-338. John Wiley & Sons, 1979.
48. C. A. Coello and G. Toscano. Multiobjective optimization using a micro-genetic algorithm. In Proc. of the Genetic and Evolutionary Computation COnference (GECCO), pages 274-282, 2001.
49. C. A. Coello, D. A. Van Veldhuizen, and G. B. Lamont. Evolutionary Algorithms for Solving Multi-Objective Problems. Genetic Algorithms and Evolutionary Computation. Kluwer Academic Publishers, 2002.
50. R. J. Collins and D. R. Jefferson. Selection in massively parallel genetic algorithms. In R. K. Belew and L. B. Booker, editors, Proc. of the Fourth International Conference on Genetic Algorithms (ICGA), pages 249-256, San Diego, CA, USA, 1991. Morgan Kaufmann.
51. S. A. Cook. The complexity of theorem-proving procedures. Proc. of the Third Anual ACM Symp. on the Theory of Computing, pages 151-158, 1971.
52. J.-F. Cordeau, M. Gendreau, A. Hertz, G. Laporte, and J.-S. Sormany. Logistics Systems: Design and Optimization, chapter 9. New Heuristics for the Vehicle Routing Problem, pages 279-298. Springer-Verlag, Heidelberg, 2004.
53. C. Cotta, E. Alba, and J. M. Troya. Un estudio de la robustez de los algoritmos genéticos paralelos. Revista Iberoamericana de Inteligencia Artificial, 98(5): 6-13, 1998.
54. N. L. Cramer. A representation for the adaptive generation of simple sequential programs. In J. J. Grefenstette, editor, Proc. of the First International Conference on Genetic Algorithms and their Applications, pages 183-187, Carnegie-Mellon University, Pittsburgh, PA, USA, July 24-26 1985.
55. G. A. Croes. A method for solving traveling salesman problems. Operations Research, 6: 791-812, 1958.
56. G. B. Dantzing and R. H. Ramster. The truck dispatching problem. Management Science, 6: 80-91, 1959.
57. C. Darwin. On the Origin of Species by Means of Natural Selection. John Murray, Londres, 1859.
58. Y. Davidor. A naturally occurring niche and species phenomenon: The model and first results. In R. K. Belew and L. B. Booker, editors, Proc. of the Fourth International Conference on Genetic Algorithms (ICGA), pages 257-263, San Diego, CA, July 1991. Morgan Kaufmann.
59. Y. Davidor, T. Yamada, and R. Nakano. The ECOlogical framework II: Improving GA performance at virtually zero cost. In S. Forrest, editor, Proc. of the Fifth International Conference on Genetic Algorithms (ICGA), pages 171-176. Morgan Kaufmann, 1993.
60. L. Davis. Adapting operator probabilities in genetic algorithms. In J. D. Schaffer, editor, Proc. of the Third International Conference on Genetic Algorithms (ICGA), pages 61-69. Morgan Kaufmann, 1989.
61. L. Davis. Handbook of genetic algorithms, volume 1991. Van Nostrand Reinhold, New York.
62. K. De Jong and J. Sarma. On decentralizing selection algorithms. In L. Eshelman, editor, Proc. of the Sixth International Conference on Genetic Algorithms (ICGA), pages 17-23, San Francisco, CA, 1995. Morgan Kaufmann.
63. K. A. De Jong. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, 1975. Ann Arbor.
64. K. A. De Jong and W. M. Spears. Using genetic algorithm to solve NP-complete problems. In J. D. Schaffer, editor, Proc. of the Third International Conference on Genetic Algorithms (ICGA), pages 124-132. Morgan Kaufmann, 1989.
65. K. Deb. Multi-Objective Optimization using Evolutionary Algorithms. Wiley, 2001.
66. K. Deb and R. B. Agrawal. Simulated binary crossover for continuous search space. Complex Systems, 9: 115-148, 1995.
67. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan. A fast and elist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2): 182-197, 2002.
68. G. Dick. A comparison of localised and global niching methods. In Annual Colloquium of the Spatial Information Research Centre (SIRC), pages 91-101, Dunedin, New Zealand, Novenber 2005.
69. G. Dick and P. Whigham. The behaviour of genetic drift in a spatiallystructured evolutionary algorithm. In Proc. IEEE International Conference on Evolutionary Computation (CEC), volume 2, pages 1855-1860. IEEE Press, 2005.
70. M. Dorigo and T. Stützle. Ant Colony Optimization. The MIT Press, 2004.
71. B. Dorronsoro. The VRP web, http://neo. lcc. uma. es/radi-aeb/WebVRP.
72. B. Dorronsoro. Diseño e Implementación de Algoritmos Genéticos Celulares para Problemas Complejos. PhD thesis, University of Málaga, February 2007.
73. B. Dorronsoro and E. Alba. A simple cellular genetic algorithm for continuous optimization. In G. Yen, editor, Proc. of the IEEE Conference on Evolutionary Computation (CEC), IEEE World Congress on Computational Intelligence (WCCI), pages 2838-2844, Vancouver, Canada, July 2006. IEEE Press.
74. B. Dorronsoro, E. Alba, M. Giacobini, and M. Tomassini. The influence of grid shape and asynchronicity on cellular evolutionary algorithms. In Y. Shi, editor, Proc. IEEE International Conference on Evolutionary Computation (CEC), pages 2152-2158, Portland, Oregon, June 20-23 2004. IEEE Press.
75. B. Dorronsoro, D. Arias, F. Luna, A. J. Nebro, and E. Alba. A grid-based hybrid cellular genetic algorithm for very large scale instances of the CVRP. In Waleed W. Smari, editor, High Performance Computing & Simulation Conference (HPCS), pages 759-765, 2007.
76. B. Dorronsoro, A. J. Nebro, D. Arias, and E. Alba. Un algoritmo genético híbrido paralelo para instancias complejas del problema VRP. In Actas del Quinto Congreso Español sobre Metaheurísticas, Algoritmos Evolutivos y Bioinspirados (MAEB), pages 135-141, Puerto de la Cruz, Tenerife, Spain, 2007.
77. S. Droste, T. Jansen, and I. Wegener. A natural and simple function which is hard for all evolutionary algorithms. In Proc. of the Asia-Pacific Conference on Simulated Evolution and Learning (SEAL), pages 2704-2709, Nagoya, Japan, 2000.
78. T. Duncan. Experiments in the use of neighbourhood search techniques for vehicle routing. Technical Report AIAI-TR-176, Artificial Intelligence Applications Institute, University of Edinburgh, Edinburgh, 1995.
79. J. J. Durillo. jMetal framework, http://neo. lcc. uma. es/software/metal/.
80. J. J. Durillo, A. J. Nebro, F. Luna, B. Dorronsoro, and E. Alba. jMetal: A java framework for developing multiobjective optimization metaheuristics. Technical Report ITI-2006-10, Dpto. de Lenguajes y CC. CC., Universidad de Málaga, 2006.
81. E. Alba and the MALLBA Group. MALLBA: A library of skeletons for combinatorial optimization. In R. F. B. Monien, editor, Proc. of the Euro-Par, volume 2400 of Lecture Notes in Computer Science (LNCS), pages 927-932, Paderborn, Germany, 2002. Springer-Verlag, Heidelberg.
82. B. Eckel. Thinking in Java. MindView, 2002.
83. A. E. Eiben and J. K. Van der Hauw. Solving 3-SAT with adaptive genetic algorithms. In Proc. of the IEEE Conference on Evolutionary Computation (CEC), IEEE World Congress on Computational Intelligence (WCCI), pages 81-86. IEEE Press, 1997.
84. S. E. Eklund. Empirical studies of neighborhood shapes in the massively parallel diffusion model. In G. Bittencourt and G. Ramalho, editors, Brazilian Symposium on Artificial Intelligence (SBIA), volume 2507 of Lecture Notes in Artificial Intelligence (LNAI), pages 185-194. Springer-Verlag, Heidelberg, 2002.
85. L. J. Eshelman, K. E. Mathias, and J. D. Schaffer. Convergence controlled variation. In R. Belew and M. Vose, editors, Foundations of Genetic Algorithms IV (FOGA), pages 203-224, San Mateo, CA, 1989. Morgan Kaufmann.
86. L. J. Eshelman and J. D. Schaffer. Real coded genetic algorithms and interval schemata. In L. D. Whitley, editor, Foundations of Genetic Algorithms II (FOGA), pages 187-202, San Mateo, 1993. Morgan Kaufmann.
87. M. L. Fisher. Optimal solution of vehicle routing problems using minimum k-trees. Operations Research, 42-44: 626-642, 1994.
88. M. J. Flynn. Very high speed computing systems. Proc. IEEE, 54: 1901-1909, 1966.
89. D. B. Fogel. An evolutionary approach to the traveling salesman problem. Biological Cybernetics, 60: 139-144, 1988.
90. L. J. Fogel. Autonomous automata. Industrial Research, 4: 14-19, 1962.
91. G. Folino, C. Pizzuti, and G. Spezzano. Combining cellular genetic algorithms and local search for solving satisfiability problems. In Proc. of the IEEE International Conference on Tools with Artificial Intelligence, pages 192-198, Taipei, Taiwan, 1998. IEEE Press.
92. G. Folino, C. Pizzuti, and G. Spezzano. Parallel hybrid method for SAT that couples genetic algorithms and local search. IEEE Transactions on Evolutionary Computation, 5(4): 323-334, August 2001.
93. G. Folino, C. Pizzuti, and G. Spezzano. A scalable cellular implementation of parallel genetic programming. IEEE Transactions on Evolutionary Computation, 7(1): 37-53, February 2003.
94. I. Foster and C. Kesselman. The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Fransisco, 1999.
95. A. S. Fraser. Simulation of genetic systems by automatic digital computers II: Effects of linkage on rates under selection. Australian Journal of Biological Sciences, 10: 492-499, 1957.
96. M. Garey and D. Johnson. Computers and Intractability: a Guide to the Theory of NP-completeness. Freeman, San Francisco, CA, 1979.
97. M. Gendreau, A. Hertz, and G. Laporte. A tabu search heuristic for the vehicle routing problem. Management Science, 40: 1276-1290, 1994.
98. M. Giacobini, E. Alba, A. Tettamanzi, and M. Tomassini. Modelling selection intensity for toroidal cellular evolutionary algorithms. In Proc. of the Genetic and Evolutionary Computation COnference (GECCO), volume 3102 of Lecture Notes in Computer Science (LNCS), pages 1138-1149. Springer-Verlag, Heidelberg, 2004.
99. M. Giacobini, E. Alba, and M. Tomassini. Selection intensity in asynchronous cellular evolutionary algorithms. In Proc. of the Genetic and Evolutionary Computation COnference (GECCO), pages 955-966. Springer-Verlag, Heidelberg, 2003.
100. M. Giacobini, M. Tomassini, and A. Tettamanzi. Modelling selection intensity for linear cellular evolutionary algorithms. In P. Liardet et al., editor, Proc. of the International Conference on Artificial Evolution, volume 2936 of Lecture Notes in Computer Science (LNCS), pages 345-356. Springer-Verlag, Heidelberg, 2003.
101. M. Giacobini, M. Tomassini, and A. Tettamanzi. Takeover time curves in random and small-world structured populations. In Proc. of the Genetic and Evolutionary Computation COnference (GECCO), pages 1333-1340, Washington D. C. USA, June 25-29 2005. ACM Press.
102. M. Giacobini, M. Tomassini, A. G. B. Tettamanzi, and E. Alba. Selection intensity in cellular evolutionary algorithms for regular lattices. IEEE Transactions on Evolutionary Computation, 9(5): 489-505, October 2005.
103. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, Boston, 1997.
104. F. W. Glover and G. A. Kochenberger. Handbook of Metaheuristics. International Series in Operations Research Management Science. Kluwer Academic Publishers, 2003.
105. D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publishing Company, 1989.
106. D. E. Goldberg and K. Deb. A comparative analysis of selection schemes used in genetic algorithms. In G. J. E. Rawlins, editor, Foundations of Genetic Algorithms I (FOGA), pages 69-93, San Mateo, CA, USA, 1991. Morgan Kaufmann.
107. D. E. Goldberg, K. Deb, and J. Horn. Massively multimodality, deception and genetic algorithms. In R. Männer and B. Manderick, editors, Proc. of the International Conference on Parallel Problem Solving from Nature II (PPSNII), pages 37-46. North-Holland, 1992.
108. D. E. Goldberg, K. Deb, H. Kargupta, and G. Harik. Rapid, accurate optimization of difficult problems using fast messy genetic algorithms. In S. Forrest, editor, Proc. of the Fifth International Conference on Genetic Algorithms (ICGA), pages 56-64. Morgan Kaufmann, 1993. San Mateo.
109. B. L. Golden, E. A. Wasil, J. P. Kelly, and I-M. Chao. Fleet Management and Logistics, chapter The Impact of Metaheuristics on Solving the Vehicle Routing Problem: algorithms, problem sets, and computational results, pages 33-56. Kluwer Academic Publishers, Boston, 1998.
110. V. Gordon, K. Mathias, and D. Whitley. Cellular genetic algorithms as function optimizers: Locality effects. In ACM Symposium on Applied Computing (SAC), pages 237-241. ACM Press, 1994.
111. V. Gordon, R. Pirie, A. Wachter, and S. Sharp. Terrain-based genetic algorithm (TBGA): Modeling parameter space as terrain. In Proc. of the Genetic and Evolutionary Computation COnference (GECCO), pages 229-235, 1999.
112. V. Gordon, D. Whitley, and A. Böhm. Dataflow parallelism in genetic algorithms. In R. Männer and B. Manderick, editors, Proc. of the International Conference on Parallel Problem Solving from Nature II (PPSN-II), pages 533-542. North-Holland, 1992.
113. V. S. Gordon and J. Thein. Visualization tool for a terrain-based genetic algorithm. In IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pages 401-406. IEEE Press, 2004.
114. V. S. Gordon and D. Whitley. Serial and parallel genetic algorithms as function optimizers. In S. Forrest, editor, Proc. of the Fifth International Conference on Genetic Algorithms (ICGA), pages 177-183. Morgan Kaufmann, 1993.
115. M. Gorges-Schleuter. ASPARAGOS-an asynchronous parallel genetic optimization strategy. In J. D. Schaffer, editor, Proc. of the Third International Conference on Genetic Algorithms (ICGA), pages 422-428. Morgan Kaufmann, 1989.
116. M. Gorges-Schleuter. Comparison of local mating strategies in massively parallel genetic algorithms. In R. Männer and B. Manderick, editors, Proc. of the International Conference on Parallel Problem Solving from Nature II (PPSNII), pages 553-562. North-Holland, 1992.
117. M. Gorges-Schleuter. Asparagos96 and the traveling salesman problem. In Proc. IEEE International Conference on Evolutionary Computation (CEC), pages 171-174. IEEE Press, 1997.
118. M. Gorges-Schleuter. A comparative study of global and local selection in evolution strategies. In Proc. of the International Conference on Parallel Problem Solving from Nature V (PPSN-V), volume 1498 of Lecture Notes in Computer Science (LNCS), pages 367-377. Springer-Verlag, Heidelberg, 1998.
119. M. Gorges-Schleuter. An analysis of local selection in evolution strategies. In Proc. of the Genetic and Evolutionary Computation COnference (GECCO), volume 1, pages 847-854, San Francisco, CA, USA, 1999. Morgan Kaufmann.
120. J. Gottlieb, E. Marchiori, and C. Rossi. Evolutionary algorithms for the satisfiability problem. Evolutionary Computation, 10(2): 35-52, 2002.
121. J. Gottlieb and N. Voss. Representations, fitness functions and genetic operators for the satisfiability problem. In Artificial Evolution, Lecture Notes in Computer Science (LNCS), pages 55-68. Springer-Verlag, Heidelberg, 1998.
122. R. L. Graham. Bounds on multiprocessor timing anomalies. SIAM Journal of Applied Mathematics, 17: 416-429, 1969.
123. P. Green. Phrap. http://www. phrap. org/phredphrapconsed. html.
124. A. O. Griewangk. Generalized descent of global optimization. Journal of Optimization, Theory, and Applications, 34: 11-39, 1981.
125. C. Grimme and K. Schmitt. Inside a predator-prey model for multi-objective optimization: A second study. In M. Cattolico, editor, Proc. of the Genetic and Evolutionary Computation COnference (GECCO), pages 707-714, Seattle, Washington, USA, July 8-12 2006. ACM Press.
126. F. Herrera, E. Herrera-Viedma, M. Lozano, and J. L. Verdegay. Fuzzy tools to improve genetic algorithms. In Proc. Second European Congress on Intelligent Techniques and Soft Computing, pages 1532-1539, 1994.
127. F. Herrera and M. Lozano. Gradual distributed real-coded genetic algorithms. IEEE Transactions on Evolutionary Computation, 4(1): 43-62, April 2000.
128. F. Herrera, M. Lozano, and J. L. Verdegay. Tackling real-coded genetic algorithms: Operators and tools for the behavioral analysis. Artificial Intelligence Reviews, 12(4): 265-319, 1998.
129. D. Hillis. Co-evolving parasites improve simulated evolution as an optimizing procedure. Physica D, 42: 228-234, 1990.
130. F. Hoffmeister. Applied Parallel and Distributed Optimization, chapter Scalable Parallelism by Evolutionary Algorithms, pages 175-198. Springer-Verlag, Heidelberg, 1991.
131. L. Hogie, F. Guinand, and P. Bouvry. The Madhoc Metropolitan Adhoc Network Simulator. Université du Luxembourg and Université du Havre, France. Available at http://www-lih. univ-lehavre. fr/-hogie/madhoc/.
132. L. Hogie, M. Seredynski, F. Guinand, and P. Bouvry. A bandwidth-efficient broadcasting protocol for mobile multi-hop ad hoc networks. In International Conference on Networking (ICN), page 71. IEEE Press, 2006.
133. J. H. Holland. Outline for a logical theory of adaptive systems. Journal of the ACM, 9(3): 297-314, 1962.
134. J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI, 1975.
135. X. Huang and A. Madan. CAP3: A DNA sequence assembly program. Genome Research, 9(9): 868-877, 1999.
136. S. Huband, L. Barone, R. L. While, and P. Hingston. A scalable multi-objective test problem toolkit. In C. A. Coello, A. Hernández, and E. Zitler, editors, Proc. of the International Conference on Evolutionary Multi-criterion Optimization (EMO), volume 3410 of Lecture Notes in Computer Science (LNCS), pages 280-295, 2005.
137. T. S. Hussain. An introduction to evolutionary computation. Tutorial presentation. CITO Researcher Retreat, May 12-14, Hamilton, Ontario 1998.
138. H. Ishibuchi, T. Doi, and Y. Nojima. Effects of using two neighborhood structures in cellular genetic algorithms for function optimization. In T. P. Runarsson et al., editor, Proc. of the International Conference on Parallel Problem Solving from Nature IX (PPSN-IX), volume 4193 of Lecture Notes in Computer Science (LNCS), pages 949-958, Reykjavik, Iceland, September 2006. Springer-Verlag, Heidelberg.
139. S. Janson, E. Alba, B. Dorronsoro, and M. Middendorf. Hierarchical cellular genetic algorithm. In J. Gottlieb and G. R. Raidl, editors, Evolutionary Computation in Combinatorial Optimization (EvoCOP), volume 3906 of Lecture Notes in Computer Science (LNCS), pages 111-122, Budapest, Hungary, April 2006. Springer-Verlag, Heidelberg.
140. K. A. De Jong, M. A. Potter, and W. M. Spears. Using problem generators to explore the effects of epistasis. In T. Bäck, editor, Proc. of the Seventh International Conference on Genetic Algorithms (ICGA), pages 338-345. Morgan Kaufmann, 1997.
141. H. Juille and J. B. Pollack. Advances in Genetic Programming 2, chapter Massively parallel genetic programming, pages 339-358. The MIT Press, MA, USA, 1996.
142. R. M. Karp. Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane. Mathematics of Operations Research, 2: 209-224, 1977.
143. H. A. Kautz and B. Selman. Planning as satisfiability. In European Conference on Artificial Intelligence, pages 359-363, 1992.
144. S. Khuri, T. Bäck, and J. Heitkötter. An evolutionary approach to combinatorial optimization problems. In Proc. of the ACM Computer Science Conference, pages 66-73, Phoenix, Arizona, 1994. ACM Press.
145. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 4598: 671-680, 1983.
146. M. Kirley. MEA: A metapopulation evolutionary algorithm for multi-objective optimisation problems. In Proc. IEEE International Conference on Evolutionary Computation (CEC), pages 949-956. IEEE Press, 2001.
147. M. Kirley. A cellular genetic algorithm with disturbances: Optimisation using dynamic spatial interactions. Journal of Heuristics, 8: 321-342, 2002.
148. M. Kirley and D. G. Green. An empirical investigation of optimization in dynamic environments using the cellular genetic algorithm. In D. Whitley et al., editor, Proc. of the Genetic and Evolutionary Computation COnference (GECCO), pages 11-18, San Mateo, CA, 2000. Morgan Kaufmann.
149. M. Kirley, X. Li, and D. G. Green. Investigation of a cellular genetic algorithm that mimics landscape ecology. In X. Yao, editor, Proc. of the Asia-Pacific Conference on Simulated Evolution and Learning (SEAL), volume 1585 of Lecture Notes in Computer Science (LNCS), pages 90-97. Springer-Verlag, Heidelberg, 1999.
150. J. Knowles and D. Corne. The pareto archived evolution strategy: A new baseline algorithm for multiobjective optimization. In Proc. IEEE International Conference on Evolutionary Computation (CEC), pages 98-105, Piscataway, NJ, 1999. IEEE Press.
151. J. Knowles and D. Corne. Approximating the nondominated front using the Pareto archived evolution strategy. Evolutionary Computation, 8(2): 149-172, 2001.
152. U. Kohlmorgen, H. Schmeck, and K. Haase. Experiences with fine-grained parallel genetic algorithms. Annals of Operations Research, 90: 302-219, 1999.
153. J. R. Koza. Genetic programming. In J. G. Williams and A. Kent, editors, Encyclopedia of Computer Science and Technology, volume 39, pages 29-43. Marcel-Dekker, 1998.
154. N. Krasnogor and J. Smith. A tutorial for competent memetic algorithms: Model, taxonomy, and design issues. IEEE Transactions on Evolutionary Computation, 9(5): 474-488, 2005.
155. T. Krink and R. Thomsen. Self-organized criticality and mass extinction in evolutionary algorithms. In Proc. IEEE International Conference on Evolutionary Computation (CEC), pages 1155-1161, Seoul, Korea, 2001. IEEE Press.
156. K. W. C. Ku. Enhance the baldwin effect by strengthening the correlation between genetic operators and learning methods. In G. Yen, editor, Proc. of the IEEE Conference on Evolutionary Computation (CEC), IEEE World Congress on Computational Intelligence (WCCI), pages 11071-11077, Vancouver, BC, Canada, July 16-21 2006. IEEE Press.
157. K. W. C. Ku, M. W. Mak, and W. C. Siu. Adding learning to cellular genetic algorithms for training recurrent neural networks. IEEE Transactions on Neural Networks, 10(2): 239-252, March 1999.
158. P. Larrañaga and J. A. Lozano, editors. Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers, 2002.
159. M. Laumanns, G. Rudolph, and H. P. Schwefel. A spatial predator-prey approach to multiobjective optimization: A preliminary study. In A. E. Eiben, T. Bäck, M. Schoenauer, and H.-P. Schwefel, editors, Proc. of the International Conference on Parallel Problem Solving from Nature V (PPSN-V), volume 1498 of Lecture Notes in Computer Science (LNCS), pages 241-249, 1998.
160. C.-H. Lee, S.-H. Park, and J.-H. Kim. Topology and migration policy of fine-grained parallel evolutionary algorithms for numerical optimization. In Proc. IEEE International Conference on Evolutionary Computation (CEC), volume 1, pages 70-76. IEEE Press, 2000.
161. J. K. Lenstra and A. H. G. Rinnooy Kan. Complexity of vehicle routing and scheduling problems. Networks, 11: 221-227, 1981.
162. F. Li, B. Golden, and E. Wasil. Very large-scale vehicle routing: new test problems, algorithms, and results. Computers & Operations Research, 32: 1165-1179, 2005.
163. L. Li and S. Khuri. A comparison of DNA fragment assembly algorithms. In International Conference on Mathematics and Engineering Techniques in Medicine and Biological Sciences, pages 329-335, 2004.
164. X. Li. A real-coded predator-prey genetic algorithm for multiobjective optimization. In C. M. Fonseca et al., editor, Proc. of the International Conference on Evolutionary Multi-criterion Optimization (EMO), volume 2632 of Lecture Notes in Computer Science (LNCS), pages 207-221. Springer-Verlag, Heidelberg, 2003.
165. X. Li and S. Sutherland. A cellular genetic algorithm simulating predatorprey interactions. In Proc. of the Third International Conference on Genetic Algorithms (ICGA), pages 416-421. Morgan Kaufmann, 2002.
166. H. Lim and C. Kim. Multicast tree construction and flooding in wireless ad hoc networks. In ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM), pages 61-68. ACM Press, 2000.
167. X. Llor and J. M. Garrell. Knowledge-independent data mining with finegrained parallel evolutionary algorithms. In L. Spector et al., editor, Proc. of the Genetic and Evolutionary Computation COnference (GECCO), pages 461-468. Morgan Kaufmann, 2001.
168. H. R. Lourenco, O. Martin, and T. Stützle. Handbook of Metaheuristics, chapter Iterated Local Search, pages 321-353. Kluwer Academic Publishers, Norwell, MA, 2002.
169. F. Luna, B. Dorronsoro, A. J. Nebro, E. Alba, and P. Bouvry. Handbook on Mobile Ad Hoc and Pervasive Communications, chapter Multiobjective Metaheuristics to Optimize the Broadcasting in MANETs. American Scientific Publishers, USA, 2007. To appear.
170. F. Luna, A. J. Nebro, B. Dorronsoro, E. Alba, P. Bouvry, and L. Hogie. Optimal broadcasting in metropolitan MANETs using multiobjective scatter search. In European Workshop on Evolutionary Computation in Communication, Networks and Connected System (EvoCOMNET), en EvoWorkshops, volume 3907 of Lecture Notes in Computer Science (LNCS), pages 255-266, Budapest, Hungary, April 2006. Springer-Verlag, Heidelberg.
171. Z. Luo and H. Liu. Cellular genetic algorithms and local search for 3-SAT problem on graphic hardware. In G. Yen, editor, Proc. of the IEEE Conference on Evolutionary Computation (CEC), IEEE World Congress on Computational Intelligence (WCCI), pages 10345-10349, Vancouver, BC, Canada, July 16-21 2006. IEEE Press.
172. G. Luque, E. Alba, and B. Dorronsoro. Parallel Genetic Algorithms, chapter 5, Parallel Metaheuristics: A New Class of Algorithms, pages 107-125. John Wiley & Sons, 2005.
173. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North-Holland, Amsterdam, 1977.
174. J. Madera, E. Alba, and A. Ochoa. Parallel Metaheuristics: A New Class of Algorithms, chapter Parallel Estimation of Distribution Algorithms, pages 203-222. John Wiley & Sons, 2005.
175. T. Mahnig and H. Mühlenbein. Comparing the adaptive Boltzmann selection schedule SDS to truncation selection. In II Symposium on Artificial Intelligence. CIMAF99. Special Session on Distributions and Evolutionary Optimization, pages 121-128, La Habana, 1999.
176. B. Manderick and P. Spiessens. Fine-grained parallel genetic algorithm. In J. D. Schaffer, editor, Proc. of the Third International Conference on Genetic Algorithms (ICGA), pages 428-433. Morgan Kaufmann, 1989.
177. T. Maruyama, T. Hirose, and A. Konagaya. A fine-grained parallel genetic algorithm for distributed parallel systems. In Proc. of the Fifth International Conference on Genetic Algorithms (ICGA), pages 184-190, San Francisco, CA, USA, 1993. Morgan Kaufmann.
178. T. Maruyama, A. Konagaya, and K. Konishi. An asynchronous fine-grained parallel genetic algorithm. In Proc. of the International Conference on Parallel Problem Solving from Nature II (PPSN-II), Lecture Notes in Computer Science (LNCS), pages 563-572. North-Holland, 1992.
179. D. McAllester, B. Selman, and H. Kautz. Evidence for invariants in local search. In National Conference on Artificial Intelligence, pages 321-326, Providence, RI, 1997.
180. G. Mendel. Versuche über Pflanzen-Hybriden. Verhandlungen des Naturforschedes Vereines in Brünn 4, 1865.
181. Z. Michalewicz. Genetic Algorithms + Data Structure = Evolution Programs. Springer-Verlag, Heidelberg, third edition, 1996.
182. D. G. Mitchell, B. Selman, and H. J. Levesque. Hard and easy distributions for SAT problems. In P. Rosenbloom and P. Szolovits, editors, Proc. of the Tenth National Conference on Artificial Intelligence, pages 459-465, California, 1992. AAAI Press.
183. N. Mladenović and P. Hansen. Variable neighborhood search. Computers & Operations Research, 24(11): 1097-1100, 1997.
184. P. Moscato. Handbook of Applied Optimization, chapter Memetic Algorithms. Oxford University Press, 2000.
185. H. Mühlenbein. Parallel genetic algorithms, population genetic and combinatorial optimization. In Proc. of the Third International Conference on Genetic Algorithms (ICGA), pages 416-421. Arlington, 1989.
186. H. Mühlenbein, M. Gorges-Schleuter, and O. Krämer. Evolution algorithms in combinatorial optimization. Parallel Computing, 7: 65-88, 1988.
187. H. Mühlenbein and G. Paab. From recombination of genes to the estimation of distributions I. Binary parameters. In H. M. Voigt, W. Ebeling, I. Rechenberg, and H. P. Schwefel, editors, Proc. of the International Conference on Parallel Problem Solving from Nature IV (PPSN-IV), volume 1411 of Lecture Notes in Computer Science (LNCS), pages 178-187. Springer-Verlag, Heidelberg, 1996.
188. H. Mühlenbein and D. Schlierkamp-Voosen. The science of breeding and its application to the breeder genetic algorithm (BGA). Evolutionary Computation, 1(4): 335-360, 1993.
189. H. Mühlenbein, M. Schomish, and J. Born. The parallel genetic algorithm as a function optimizer. Parallel Computing, 17: 619-632, 1991.
190. T. Murata andM. Gen. Cellular genetic algorithm for multi-objective optimization. In Proc. of the Fourth Asian Fuzzy System Symposium, pages 538-542, 2002.
191. T. Nakashima, T. Ariyama, and H. Ishibuchi. Combining multiple cellular genetic algorithms for efficient search. In Proc. of the Asia-Pacific Conference on Simulated Evolution and Learning (SEAL), pages 712-716, 2002.
192. T. Nakashima, T. Ariyama, T. Yoshida, and H. Ishibuchi. Performance evaluation of combined cellular genetic algorithms for function optimization problems. In Proc. of the IEEE International Symposium on Computational Intelligence in Robotics and Automation, pages 295-299, Kobe, Japan, July 16-20 2003. IEEE Press.
193. A. J. Nebro, J. J. Durillo, F. Luna, B. Dorronsoro, and E. Alba. A cellular genetic algorithm for multiobjective optimization. In D. A. Pelta and N. Krasnogor, editors, Proceedings of the NICSO, pages 25-36, Granada, Spain, 2006.
194. A. J. Nebro, J. J. Durillo, F. Luna, B. Dorronsoro, and E. Alba. MOCell: A cellular genetic algorithm for multiobjective optimization. International Journal of Intelligent Systems, 2007. To appear.
195. A. J. Nebro, J. J. Durillo, F. Luna, B. Dorronsoro, and E. Alba. A study of strategies for neigborhood replacement and archive feedback in a multiobjective cellular genetic algorithm. In S. Obayashi, K. Deb, C. Poloni, T. Hiroyasu, and T. Murata, editors, Proc. of the International Conference on Evolutionary Multi-criterion Optimization (EMO), volume 4403 of Lecture Notes in Computer Science (LNCS), pages 126-140. Springer-Verlag, Heidelberg, 2007.
196. N. Nedjah, E. Alba, and L. de Macedo Mourelle. Parallel Evolutionary Computations. Studies in Computational Intelligence. Springer-Verlag, Heidelberg, 2006.
197. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45: 167-256, 2003.
198. S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu. The broadcast storm problem in a mobile ad hoc network. In Proc. of the Annual ACM/IEEE International Conference on Mobile Computing and Networking, pages 151-162, 1999.
199. Y. S. Ong and A. J. Keane. Meta-lamarckian learning in memetic algorithms. IEEE Transactions on Evolutionary Computation, 8(2): 99-110, April 2004.
200. I. H. Osman. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems. Annals of Operations Research, 41: 421-451, 1993.
201. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Dover Publications, 1998.
202. P. M. Pardalos and H. E. Romeijn. Handbook of global optimization. Volume 2. Kluwer Academic Publishers, 2002.
203. J. L. Payne and M. J. Eppstein. Emergent mating topologies in spatially structured genetic algorithms. In Proc. of the Genetic and Evolutionary Computation COnference (GECCO), pages 207-214, Seattle, Washington, USA, 2006. ACM Press.
204. A. Pelc. Handbook of Wireless Networks and Mobile Computing, chapter Broadcasting In Wireless Networks, pages 509-528. John Wiley & Sons, 2002.
205. W. Peng and X.-C. Lu. On the reduction of broadcast redundancy in mobile ad hoc networks. In Proc. of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), pages 129-130. IEEE Press, 2000.
206. F. B. Pereira, J. Tavares, P. Machado, and E. Costa. GVR: a new representation for the vehicle routing problem. In Irish Conference Proceedings on Artificial Intelligence and Cognitive Science (AICS), pages 95-102, Ireland, 2002. Springer-Verlag, Heidelberg.
207. C. Prins. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research, 31(12): 1985-2002, May 2004.
208. T. K. Ralphs, L. Kopman, W. R. Pulleyblank, and L. E. Trotter Jr. On the capacitated vehicle routing problem. Mathematical Programming Series B, 94: 343-359, 2003.
209. I. Rechenberg. Cybernetic solution path of an experimental problem. Technical report, Royal Aircraft Establishment, Library translation No. 1122, Farnborough, Hants., UK, 1965.
210. I. Rechenberg. Evolutionsstrategie: Optimierung technischer Systeme und Prinzipien der biologischen Evolution. Frommann-Holzboog, Stuttgart, 1973.
211. C. R. Reeves and J. E. Rowe. Genetic Algorithms: Principles and Perspectives. A Guide to GA Theory. Operations Research/Computer Science Series. Springer-Verlag, Heidelberg, 2003.
212. G. Reinelt. TSPLIB: A travelling salesman problem library. ORSA Journal on Computing, 3: 376-384 URL: http://www. iwr. uni-heidelberg. de/groups/comopt/software/TSPLIB95/, 1991.
213. R. Reiter and A. Mackworth. A logical framework for depiction and image interpretation. Applied Intelligence, 41(3): 123-155, 1989.
214. J. L. Ribeiro-Filho, C. Alippi, and P. Treleaven. Parallel Genetic Algorithms: Theory and Applications, chapter Genetic algorithm programming environments, pages 65-83. IOS Press, 1993.
215. P. Rickers, R. Thomsen, and T. Krink. Applying self-organized criticality to the diffusion model. In D. Whitley, editor, Proc. of the Genetic and Evolutionary Computation COnference (GECCO), pages 325-330, Las Vegas, Nevada, USA, 2000.
216. G. Robertson. Parallel implementation of genetic algorithms in a classifier system. In Proc. of the Second International Conference on Genetic Algorithms (ICGA), pages 140-147, 1987.
217. Y. Rochat and E. Taillard. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1: 147-167, 1995.
218. G. Rudolph. On takeover times in spatially structured populations: Array and ring. In K. K. Lai, O. Katai, M. Gen, and B. Lin, editors, Proc. of the Second Asia-Pacific Conference on Genetic Algorithms and Applications (APGA), pages 144-151. Global-Link Publishing Company, 2000.
219. G. Rudolph and J. Sprave. A cellular genetic algorithm with self adjusting acceptance threshold. In International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications (GALESIA), pages 365-372, 1995.
220. J. Sarma and K. A. De Jong. An analysis of the effect of the neighborhood size and shape on local selection algorithms. In H. M. Voigt, W. Ebeling, I. Rechenberg, and H. P. Schwefel, editors, Proc. of the International Conference on Parallel Problem Solving from Nature IV (PPSN-IV), volume 1141 of Lecture Notes in Computer Science (LNCS), pages 236-244. Springer-Verlag, Heidelberg, 1996.
221. J. Sarma and K. A. De Jong. An analysis of local selection algorithms in a spatially structured evolutionary algorithm. In T. Bäck, editor, Proc. of the Seventh International Conference on Genetic Algorithms (ICGA), pages 181-186. Morgan Kaufmann, 1997.
222. J. D. Schaffer and L. J. Eshelman. On crossover as an evolutionary viable strategy. In R. K. Belew and L. B. Booker, editors, Proc. of the Fourth International Conference on Genetic Algorithms (ICGA), pages 61-68. Morgan Kaufmann, 1991.
223. D. Schlierkamp-Voosen and H. Mühlenbein. Adaption of population sizes by competing subpopulations. In Proc. IEEE International Conference on Evolutionary Computation (CEC), pages 330-335, Piscataway, NY, 1996. IEEE Press.
224. B. Schönfisch and A. de Roos. Synchronous and asynchronous updating in cellular automata. BioSystems, 51: 123-143, 1999.
225. H.-P. Schwefel. Kybernetische Evolution als Strategie der Experimentellen Forschung in der Strömungstechnik. PhD thesis, Technical University of Berlin, 1965.
226. H.-P. Schwefel. Numerical Optimization of Computer Models. John Wiley & Sons, Chichester, England, 1981.
227. B. Selman, H. Kautz, and B. Cohen. Noise strategies for improving local search. In National Conference on Artificial Intelligence, pages 337-343, California, 1994. AAAI Press.
228. J. Setubal and J. Medianis. Introduction to Computational Molecular Biology, chapter 4-Fragment Assembly of DNA, pages 105-139. University of Campinas, Brazil, 1997.
229. D. Simoncini, S. Verel, P. Collard, and M. Clergue. Anisotropic selection in cellular genetic algorithms. In Proc. of the Genetic and Evolutionary Computation COnference (GECCO), pages 559-566, Seattle, Washington, USA, 2006. ACM Press.
230. M. Sipper. Evolution of Parallel Cellular Machines: The Cellular Programming Approach. Lecture Notes in Computer Science (LNCS). Springer-Verlag, Heidelberg, 1997.
231. J. E. Smith and F. Vavak. Replacement strategies in steady state genetic algorithms: static environments. In Banzhaf and Reeves, editors, Foundations of Genetic Algorithms V (FOGA), pages 219-234. Morgan Kaufmann, 1998.
232. P. Spiessens and B. Manderick. A massively parallel genetic algorithm: Implementation and first analysis. In R. K. Belew and L. B. Booker, editors, Proc. of the Fourth International Conference on Genetic Algorithms (ICGA), pages 279-286. Morgan Kaufmann, 1991.
233. J. Sprave. Linear neighborhood evolution strategies. In A. V. Sebald and L. J. Fogel, editors, Proc. of the Annual Conference on Evolutionary Programming, pages 42-51, River Edge, NJ, USA, 1994. World Scientific.
234. J. Sprave. A unified model of non-panmictic population structures in evolutionary algorithms. In P. J Angeline, Z. Michalewicz, M. Schoenauer, X. Yao, and A. Zalzala, editors, Proc. IEEE International Conference on Evolutionary Computation (CEC), volume 2. IEEE Press, 1999.
235. J. Stender. Parallel Genetic Algorithms: Theory and Applications. IOS Press, Amsterdam, The Netherlands, 1993.
236. D. R. Stinson. An Introduction to the Design and Analysis of Algorithms. The Charles Babbage Research Center, Winnipeg, Manitoba, Canada, 1985 (second edition, 1987).
237. I. Stojmenovic and J. Wu. Mobile Ad Hoc Networking, chapter Broadcasting and activity scheduling in ad hoc networks, pages 205-229. Wiley-IEEE Press, 2004.
238. R. Storn and K. Price. Differential evolution-a simple and efficient adaptive scheme for global optimization over continuous spaces. Technical Report TR-95-012, International Computer Science Institute, Berkeley, CA, 1995.
239. P. D. Surry and N. J. Radcliffe. RPL2: A language and parallel framework for evolutionary computing. In Y. Davidor, H.-P. Schwefel, and R. Männer, editors, Proc. of the International Conference on Parallel Problem Solving from Nature III (PPSN-III), pages 628-637, Berlin, 1994. Springer-Verlag, Heidelberg.
240. E. Taillard. Parallel iterative search methods for vehicle-routing problems. Networks, 23(8): 661-673, 1993.
241. E.-G. Talbi. Parallel Combinatorial Optimization. John Wiley & Sons, 2006.
242. E.-G. Talbi and P. Bessire. A parallel genetic algorithm for the graph partitioning problem. In Proc. of the International Conference on Supercomputing, pages 312-320. ACM Press, 1991.
243. R. Tanese. Distributed genetic algorithms. In J. D. Schaffer, editor, Proc. of the Third International Conference on Genetic Algorithms (ICGA), pages 434-439. Morgan Kaufmann, 1989.
244. R. Thomsen, P. Rickers, and T. Krink. A religion-based spatial model for evolutionary algorithms. In H.-P. Schwefel, M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, and J. J. Merelo, editors, Proc. of the International Conference on Parallel Problem Solving from Nature VI (PPSN-VI), Paris, France, 2000. Springer-Verlag, Heidelberg.
245. M. Tomassini. The parallel genetic cellular automata: Application to global function optimization. In R. F. Albrecht, C. R. Reeves, and N. C. Steele, editors, Proc. of the International Conference on Artificial Neural Networks and Genetic Algorithms, pages 385-391. Springer-Verlag, Heidelberg, 1993.
246. M. Tomassini. Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time. Natural Computing Series. Springer-Verlag, Heidelberg, 2005.
247. A. Töorn and Ž. Antanas. Global Optimization, volume 350 of Lecture Notes in Computer Science (LNCS). Springer-Verlag, Heidelberg, Berlin, Germany, 1989.
248. P. Toth and D. Vigo. The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, 2001.
249. P. Toth and D. Vigo. The granular tabu search and its application to the vehicle routing problem. INFORMS Journal on Computing, 15(4): 333-346, 2003.
250. S. Tsutsui and Y. Fujimoto. Forking genetic algorithm with blocking and shrinking modes. In S. Forrest, editor, Proc. of the Fifth International Conference on Genetic Algorithms (ICGA), pages 206-213, San Mateo, CA, 1993. Morgan Kaufmann.
251. S. Tsutsui, A. Ghosh, D. Corne, and Y. Fujimoto. A real coded genetic algorithm with an explorer and exploiter populations. In T. Bäck, editor, Proc. of the Seventh International Conference on Genetic Algorithms (ICGA), pages 238-245. Morgan Kaufmann, 1997.
252. A. Van Breedam. An Analysis of the Behavior of Heuristics for the Vehicle Routing Problem for a Selection of Problems with Vehicle Related, Customerrelated, and Time-related Constraints. PhD thesis, University of Antwerp-RUCA, Belgium, 1994.
253. A. Van Breedam. A parametric analysis of heuristics for the vehicle routing problem with side-constraints. European Journal of Operations Research, 137: 348-370, 2002.
254. D. A. Van Veldhuizen and G. B. Lamont. Multiobjective evolutionary algorithm research: A history and analysis. Technical Report TR-98-03, Dept. Elec. Comput. Eng., Air Force Inst. Technol., Wright-Patterson, AFB, OH, 1998.
255. H.-M. Voigt, H. Mühlenbein, and D. Cetković. Fuzzy recombination for the breeder genetic algorithm. In L. Eshelman, editor, Proc. of the Sixth International Conference on Genetic Algorithms (ICGA), pages 104-111, 1995.
256. H. M. Voigt, I. Santibáñez-Koref, and J. Born. Hierarchically structured distributed genetic algorithms. In R. Männer and B. Manderick, editors, Proc. of the International Conference on Parallel Problem Solving from Nature II (PPSN-II), pages 155-164, Amsterdan, 1992. North-Holland.
257. K. Weinert, J. Mehnen, and G. Rudolph. Dynamic neighborhood structures in parallel evolution strategies. Complex Systems, 13(3): 227-243, 2001.
258. P. M. White and C. C. Pettey. Double selection vs. single selection in diffusion model GAs. In S. Forrest, editor, Proc. of the Fifth International Conference on Genetic Algorithms (ICGA), pages 174-180. Morgan Kaufmann, 1993.
259. D. Whitley. Cellular genetic algorithms. In S. Forrest, editor, Proc. of the Fifth International Conference on Genetic Algorithms (ICGA), page 658, California, CA, USA, 1993. Morgan Kaufmann.
260. D. Whitley, R. Beveridge, C. Graves, and K. Mathias. Test driving three 1995 genetic algorithms: New test functions and geometric matching. Journal of Heuristics, 1: 77-104, 1995.
261. D. Whitley, S. Rana, J. Dzubera, and K. E. Mathias. Evaluating evolutionary algorithms. Applied Intelligence, 85: 245-276, 1997.
262. D. Whitley, T. Starkweather, and D. Fuquay. Scheduling problems and traveling salesman: The genetic edge recombination operator. In J. D. Schaffer, editor, Proc. of the Third International Conference on Genetic Algorithms (ICGA), pages 133-140. Morgan Kaufmann, 1989.
263. B. Williams and T. Camp. Comparison of broadcasting techniques for mobile ad hoc networks. In Proc. of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), pages 194-205. ACM Press, 2002.
264. S. Wolfram. Theory and Applications of Cellular Automata. World Scientific, Singapore, 1986.
265. D. H. Wolpert and W. G. Macready. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1): 67-82, April 1997.
266. S. Wright. Isolation by distance. Genetics, 28: 114-138, 1943.
267. J. Wu and W. Lou. Forward-node-set-based broadcast in clustered mobile ad hoc networks. Wireless Communications and Mobile Computing, 3(2): 155-173, 2003.
268. F. Xhafa. A cellular memetic algorithm for resource allocation in grid systems. In E.-G. Talbi and L. Jourdan, editors, Proceedings of the META 2006, 2006. CD edition.
269. F. Xhafa, E. Alba, and B. Dorronsoro. Efficient batch job scheduling in grids using cellular memetic algorithms. In Nature Inspired Distributed Computing (NIDISC) sessions of the International Parallel and Distributed Processing Simposium (IPDPS) Workshop, pages 1-8. IEEE Press, 2007.
270. E. Zitzler, K. Deb, and L. Thiele. Comparison of multiobjective evolutionary algorithms: Empirical results. IEEE Transactions on Evolutionary Computation, 8(2): 173-195, 2000.
271. E. Zitzler, M. Laumanns, and L. Thiele. SPEA2: Improving the strength pareto evolutionary algorithm. Technical Report 103, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH), 2001.
272. E. Zitzler and L. Thiele. Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach. IEEE Transactions on Evolutionary Computation, 23(4): 257-271, 1999.