More effective crossover operators for the 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 184-193

  Doerr, Benjamin ^a   Johannsen, Daniel ^a   Kötzing, Timo ^a   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

ARTIFICIAL PROBLEMS; CROSSOVER OPERATOR; EXPECTED OPTIMIZATION TIME; PARENT SELECTION; REPAIR MECHANISM; SHORTEST PATH PROBLEM; SPEED-UPS;

ALGORITHMS; MATHEMATICAL OPERATORS; OPTIMIZATION; REPAIR;

PROBLEM SOLVING;

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

References (23)

1. Baswana, S., Biswas, S., Doerr, B., Friedrich, T., Kurur, P.P., Neumann, F.: Computing single source shortest paths using single-objective fitness functions. In: Proceedings of the 10th International Workshop on Foundations of Genetic Algorithms (FOGA 2009), Orlando, USA, pp. 59-66. ACM Press, New York (2009)
2. Cherba, D.M., Punch, W.F.: Crossover gene selection by spatial location. In: Cattolico, M. (ed.) GECCO, pp. 1111-1116. ACM, New York (2006)
3. Doerr, B., Happ, E., Klein, C.: A tight analysis of the (1 + 1)-EA for the single source shortest path problem. In: IEEE Congress on Evolutionary Computation, pp. 1890-1895. IEEE, Los Alamitos (2007)
4. 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)
5. Doerr, B., Theile, M.: Improved analysis methods for crossover-based algorithms. In: Rothlauf [20], pp. 247-254
6. Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276, 51-81 (2002)
7. Friedrich, T., Hebbinghaus, N., Neumann, F., He, J., Witt, C.: Approximating covering problems by randomized search heuristics using multi-objective models. In: Lipson, H. (ed.) GECCO 2007: Proceedings of the 9th annual conference on Genetic and evolutionary computation, pp. 797-804. ACM, New York (2007); Journal version appears in Evolutionary Computation
8. Giel, O., Wegener, I.: Evolutionary algorithms and the maximum matching problem. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 415-426. Springer, Heidelberg (2003) (Pubitemid 36309294)
9. Horoba, C., Sudholt, D.: Running time analysis of ACO systems for shortest path problems. In: Stützle, T., Birattari, M., Hoos, H.H. (eds.) SLS 2009. LNCS, vol. 5752, pp. 76-91. Springer, Heidelberg (2009)
10. 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)
11. Knowles, J.D., Corne, D.: A comparison of encodings and algorithms for multiobjective spanning tree problems. In: Proceedings of the Congress on Evolutionary Computation 2001, pp. 544-551. IEEE Press, Los Alamitos (2001)
12. Kratsch, S., Neumann, F.: Fixed-parameter evolutionary algorithms and the vertex cover problem. In: Rothlauf [20], pp. 293-300
13. Mehlhorn, K., Sanders, P.: Algorithms and Data Structures: The Basic Toolbox. Springer, Heidelberg (2008)
14. Michalewicz, Z., Fogel, D.B.: How to solve it: Modern heuristics. Springer, Berlin (2004)
15. Michalewicz, Z., Nazhiyath, G., Michalewicz, M.: A note on usefulness of geometrical crossover for numerical optimization problems. In: Evolutionary Programming, pp. 305-312 (1996)
16. Neumann, F., Reichel, J.: Approximating minimum multicuts by evolutionary multi-objective algorithms. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 72-81. Springer, Heidelberg (2008)
17. Neumann, F., Wegener, I.: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoretical Computer Science 378(1), 32-40 (2007)
18. Raidl, G.R., Julstrom, B.A.: Edge sets: an effective evolutionary coding of spanning trees. IEEE Trans. Evolutionary Computation 7(3), 225-239 (2003)
19. Rothlauf, F.: Representations for Genetic and Evolutionary Algorithms. Springer, Heidelberg (2003)
20. Rothlauf, F. (ed.): Genetic and Evolutionary Computation Conference, GECCO 2009, Proceedings, Montreal, Québec, Canada, July 8-12. ACM, New York (2009)
21. 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)
22. Walters, T.: Repair and brood selection in the traveling salesman problem. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 813-822. Springer, Heidelberg (1998)
23. Witt, C.: Worst-case and average-case approximations by simple randomized search heuristics. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 44-56. Springer, Heidelberg (2005)