AD Teaching Wiki:

Results for Exercise Sheet 7 (Contraction Hierarchies, precomputation + query results)

Add your row to the table below, following the examples already there. In the second column put Saar or BaWü (put numbers for only one dataset, preferable BaWü). In the third column, put the update heuristic(s). In the fourth column, put the total precomputation time (in minutes ans seconds). In the fifth column, put the total number of shortcuts added in your precomputation. In the sixth column, put the average query time in milliseconds (precision: exactly one digit after the dot). In the seventh column, put the average shortest path cost (in minutes and seconds). Last two columns as usual, see the result tables for Exercise Sheet 1, Exercise Sheet 2, Exercise Sheet 3, Exercise Sheet 4, and Exercise Sheet 6.

Name

Dataset

ED update

precomp. time

#shortcuts

av. query time

av. SP cost

Processor / RAM

Language

Example

BaWü

lazy+spatial

11min1sec

111,111

1.1ms

111min11sec

Intel X5560 @ 2.8Ghz / 96 GB

C++

SE KF

BaWü

lazy+neighbour

1min56sec

2,352,648

1.80ms

92min31sec

Intel P8600 @ 2.4Ghz / 4 GB

C++

nils

BaWü

lazy

0min60sec

1,787,945

-

-

AMD X2 BE2350 @ 2.1GHz / 4 GB

C++

Ant-Cyn

Saarland

lazy

0min20sec

91,527

118ms

27min46sec

Intel i5-2410M @ 2.3Ghz / 4 GB

Java

Felix

Saarland

neighbour

0min16sec

62,315

33ms

--min--sec

Intel i5-2410M @ 2.3GHz / 4 GB

Java

AD Teaching Wiki: EfficientRoutePlanningSS2012/ContractionHierarchiesResults (last edited 2012-06-20 09:56:41 by frbg-5f7313ad)