Edge-based representation beats vertex-based representation in shortest path problems

Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10

Volumn , Issue , 2010, Pages 759-766

  Doerr, Benjamin ^a   Johannsen, Daniel ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Evolutionary algorithm; Runtime analysis; Shortest path

Indexed keywords

EDGE-BASED; MULTI-CRITERIA; NATURAL PROPERTIES; RUN-TIME ANALYSIS; SHORTEST PATH; SHORTEST PATH PROBLEM; UNDERLYING GRAPHS; VERTEX DEGREE;

GRAPH THEORY;

EVOLUTIONARY ALGORITHMS;

EID: 77955906587     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1830483.1830618     Document Type: Conference Paper

References (16)

1. H. Bast, S. Funke, P. Sanders, andD. Schultes. Fast routing in road networks with transit nodes. Science, 316(5824):566, 2007.
2. S. Baswana, S. Biswas, B. Doerr, T. Friedrich, P. P. Kurur, andF. Neumann. Computing single-source shortest paths using single-objective fitness. In FOGA '09, pages 59-66. ACM, 2009.
3. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1(1):269-271, 1959.
4. B. Doerr andL. A. Goldberg. Private communication.
5. B. Doerr, E. Happ, andC. Klein. A tight bound for the (1+1)-EA on the single-source shortest path problem. In CEC '07, pages 1890-1895. IEEE, 2007.
6. B. Doerr, E. Happ, andC. Klein. Crossover can provably be useful in evolutionary computation. In GECCO '08, pages 539-546. ACM, 2008.
7. B. Doerr, D. Johannsen, andC. Winzen. Drift analysis and linear functions revisited. In CEC '10. IEEE, 2010. To appear.
8. B. Doerr andM. Theile. Improved analysis methods for crossover-based algorithms. In GECCO '09, pages 247-254. ACM, 2009.
9. M. Dorigo andT. Stützle. Ant Colony Optimization. MIT Press, 2004.
10. A. El-Fallahi, C. Prins, andR. W. Calvo. A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Computers & OR, 35(5):1725-1741, 2008.
11. S. J. Kim andM. K. Choi. Evolutionary algorithms for route selection and rate allocation in multirate multicast networks. Applied Intelligence, 26(3): 197-215, 2007.
12. S. Knopp, P. Sanders, D. Schultes, F. Schulz, andD. Wagner. Computing many-to-many shortest paths using highway hierarchies. In ALENEX '07, 2007.
13. F. Neumann andI. Wegener. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. In GECCO '04, pages 713-724, 2004.
14. P. Sanders andD. Schultes. Engineering highway hierarchies. In ESA '06, pages 804-816, 2006.
15. J. Scharnow, K. Tinnefeld, andI. Wegener. Fitness landscapes based on sorting and shortest paths problems. In PPSN '02, volume 2439 of LNCS, pages 54-63. Springer, 2002.
16. J. Scharnow, K. Tinnefeld, andI. Wegener. The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithm, 3(4):349-366, 2004.