typo ref #2

docs/web/docs/Simulation/Routing.md

@@ -196,12 +196,12 @@ search and is often faster than dijkstra. Here, the metric *euclidean distance /
 
 ## ALT
 
-By using *astar* together with the option **--astar.landmark-distance** {{DT_FILE}} the ALT-Algorithm is activated.
+By using *astar* together with the option **--astar.landmark-distances** {{DT_FILE}} the ALT-Algorithm is activated.
 The name ALT stands for: **A**\*, **L**andmarks, **t**riangle inequality.
 It uses a precomputed distance table to selected network edges (so-called landmarks) to speed up the search, often by a significant factor.
 
 - A lookup table can be generated by creating a file with one landmark edge id per line (e.g. landmarks.txt)
-and then setting the options **-astar.landmark-distances landmarks.txt --astar.save-landmark-distances lookuptable.txt**.
+and then setting the options **--astar.landmark-distances landmarks.txt --astar.save-landmark-distances lookuptable.txt**.
 - As a rule of thumb using 8-16 edges distributed around the main roads that border the network achieve good ALT-performance. Using more edges is not recommended because each landmark adds a fixed overhead).
 - by using *astar* together with the option **--astar.all-distances** {{DT_FILE}} the A\* algorithm is
   used together with a complete (and often huge) distance table to allow for blazing fast search. This is only recommended for medium sized networks with a high number of routing queries