How crossover speeds up evolutionary algorithms for the multi-criteria all-pairs-shortest-path problem

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

Volumn 6238 LNCS, Issue PART 1, 2010, Pages 667-676

  Neumann, Frank ^a   Theile, Madeleine ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MULTI-CRITERIA; MULTICRITERIA OPTIMIZATION; NP-HARD; RUN-TIME ANALYSIS; SHORTEST PATH; SHORTEST PATH PROBLEM; SPEED-UPS; STOCHASTIC SEARCH ALGORITHMS; WORST CASE;

COMPUTATIONAL COMPLEXITY; EVOLUTIONARY ALGORITHMS;

PROBLEM SOLVING;

EID: 78149260037     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15844-5_67     Document Type: Conference Paper

References (13)

1. Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley, Chichester (1992)
2. Doerr, B., Happ, E., Klein, C.: Crossover can provably be useful in evolutionary computation. In: Ryan, C., Keijzer, M. (eds.) GECCO, pp. 539-546. ACM, New York (2008)
3. Doerr, B., Theile, M.: Improved analysis methods for crossover-based algorithms. In: Rothlauf, F. (ed.) GECCO, pp. 247-254. ACM, New York (2009)
4. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
5. Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276, 51-81 (2002)
6. Ehrgott, M.: Multicriteria optimization, 2nd edn. Springer, Berlin (2005)
7. Eiben, A., Smith, J.: Introduction to Evolutionary Computing, 2nd edn. Springer, Heidelberg (2007)
8. Horoba, C.: Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem. In: 10th International Workshop on Foundations of Genetic Algorithms (FOGA 2009), pp. 113-120. ACM Press, New York (2009)
9. Jansen, T., Wegener, I.: Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Trans. Evolutionary Computation 5(6), 589-599 (2001) (Pubitemid 34091917)
10. Laumanns, M., Thiele, L., Deb, K., Zitzler, E.: Combining convergence and diversity in evolutionary multiobjective optimization. Evolutionary Computation 10(3), 263-282 (2003)
11. Oliveto, P.S., He, J., Yao, X.: Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results. International Journal of Automation and Computing 4(3), 281-293 (2007) (Pubitemid 47167355)
12. Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Kovač (1997)
13. Scharnow, J., Tinnefeld, K., Wegener, I.: The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms, 349-366 (2004) (Pubitemid 40317583)