Analysis of speedups in parallel evolutionary algorithms for combinatorial optimization (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7074 LNCS, Issue , 2011, Pages 405-414

  Lässig, Jörg ^a   Sudholt, Dirk ^b  

^a UNIVERSITY OF APPLIED SCIENCES ZITTAU GÖRLITZ   (Germany)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL PROBLEM; COMMUNICATION TOPOLOGIES; EULERIAN CYCLES; EXTENDED ABSTRACTS; GRAPH STRUCTURES; ISLAND MODEL; PARALLEL EVOLUTIONARY ALGORITHMS; RUNNING TIME; SEARCH OPERATORS; SHORTEST PATH;

COMBINATORIAL OPTIMIZATION; OPTIMIZATION; TOPOLOGY;

EVOLUTIONARY ALGORITHMS;

EID: 84055191087     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25591-5_42     Document Type: Conference Paper

References (18)

1. Alba, E.: Parallel Metaheuristics: A New Class of Algorithms. Wiley-Interscience (2005)
2. Doerr, B., Happ, E., Klein, C.: A tight analysis of the (1+1)-EA for the single source shortest path problem. In: Proc. of CEC 2007, pp. 1890-1895. IEEE (2007)
3. Doerr, B., Hebbinghaus, N., Neumann, F.: Speeding up evolutionary algorithms through asymmetric mutation operators. Evolutionary Computation 15, 401-410 (2007)
4. Doerr, B., Johannsen, D.: Adjacency list matchings - an ideal genotype for cycle covers. In: Proc. of GECCO 2007, pp. 1203-1210. ACM (2007)
5. Doerr, B., Johannsen, D.: Edge-based representation beats vertex-based representation in shortest path problems. In: Proc. of GECCO 2010, pp. 759-766. ACM(2010)
6. Doerr, B., Klein, C., Storch, T.: Faster evolutionary algorithms by superior graph representation. In: Proc. of FOCI 2007, pp. 245-250. IEEE (2007)
7. Lässig, J., Sudholt, D.: The benefit of migration in parallel evolutionary algorithms. In: Proc. of GECCO 2010, pp. 1105-1112 (2010)
8. Lässig, J., Sudholt, D.: Experimental Supplements to the Theoretical Analysis of Migration in the Island Model. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6238, pp. 224-233. Springer, Heidelberg (2010)
9. Lässig, J., Sudholt, D.: General Scheme for Analyzing Running Times of Parallel Evolutionary Algorithms. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6238, pp. 234-243. Springer, Heidelberg (2010)
10. Lässig, J., Sudholt, D.: Adaptive population models for offspring populations and parallel evolutionary algorithms. In: Proc. of FOGA 2011, pp. 181-192. ACM Press (2011)
11. Neumann, F.: Expected runtimes of evolutionary algorithms for the Eulerian cycle problem. Computers & Operations Research 35(9), 2750-2759 (2008)
12. Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer, Heidelberg (2010)
13. Rudolph, G.: Takeover time in parallel populations with migration. In: BIOMA 2006, pp. 63-72 (2006)
14. Scharnow, J., Tinnefeld, K., Wegener, I.: The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms 3, 349-366 (2004)
15. Skolicki, Z., De Jong, K.A.: The influence of migration sizes and intervals on island models. In: Proc. of GECCO 2005, pp. 1295-1302. ACM (2005)
16. Talbi, E.-G. (ed.): Parallel Combinatorial Optimization. Wiley (2006)
17. Tomassini, M.: Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time. Springer, Heidelberg (2005)
18. Wegener, I.: Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In: Sarker, R., Yao, X., Mohammadian, M. (eds.) Evolutionary Optimization, pp. 349-369. Kluwer (2002)