A method for determining correction values (k) for a route calculation algorithm for use in a method according to claim 6 based on digital map data for a road network and/or a path network of a predetermined area, wherein the digital map data comprise: - respective nodes of the area and connections between the respective nodes of the area, and - respective edge costs (g) for the respective connections of the nodes, and wherein - the area is divided in a predetermined manner into a plurality of tiles for which the correction values (k) are determined, wherein - one of the tiles of the area is respectively determined as a starting tile and the respectively remaining tiles are determined as reference tiles, wherein special nodes are predetermined which are arranged in the starting tile and form a true or artificial subset of all nodes of the starting tile, and special nodes are predetermined which are arranged in the respective reference tile and form a true or artificial subset of all nodes of the respective reference tile, - the correction value (k) is respectively determined for the respective starting tile with respect to one of the reference tiles such that -- for each special node of the respective starting tile, a respective cost ratio (cost) is determined with respect to each special node of the respective reference tile, subject to the edge costs (g) of the connections which lie between the respective special node of the starting tile and the respective special node of the respective reference tile and which represent an optimum route between the respective special node of the starting tile and the respective special node of the respective reference tile, and a heuristic value of the respective special node of the starting tile with respect to the respective special node of the respective reference tile, -- an average is determined subject to the determined cost ratios (cost) and -- subject to the average, the correction value (k) of the starting tile with respect to the respective reference tile is determined. - respective nodes of the area and connections between the respective nodes of the area, and - respective edge costs (g) for the respective connections of the nodes, and wherein - the area is divided in a predetermined manner into a plurality of tiles for which the correction values (k) are determined, wherein - one of the tiles of the area is respectively determined as a starting tile and the respectively remaining tiles are determined as reference tiles, wherein special nodes are predetermined which are arranged in the starting tile and form a true or artificial subset of all nodes of the starting tile, and special nodes are predetermined which are arranged in the respective reference tile and form a true or artificial subset of all nodes of the respective reference tile, - the correction value (k) is respectively determined for the respective starting tile with respect to one of the reference tiles such that -- for each special node of the respective starting tile, a respective cost ratio (cost) is determined with respect to each special node of the respective reference tile, subject to the edge costs (g) of the connections which lie between the respective special node of the starting tile and the respective special node of the respective reference tile and which represent an optimum route between the respective special node of the starting tile and the respective special node of the respective reference tile, and a heuristic value of the respective special node of the starting tile with respect to the respective special node of the respective reference tile, -- an average is determined subject to the determined cost ratios (cost) and -- subject to the average, the correction value (k) of the starting tile with respect to the respective reference tile is determined. -- for each special node of the respective starting tile, a respective cost ratio (cost) is determined with respect to each special node of the respective reference tile, subject to the edge costs (g) of the connections which lie between the respective special node of the starting tile and the respective special node of the respective reference tile and which represent an optimum route between the respective special node of the starting tile and the respective special node of the respective reference tile, and a heuristic value of the respective special node of the starting tile with respect to the respective special node of the respective reference tile, -- an average is determined subject to the determined cost ratios (cost) and -- subject to the average, the correction value (k) of the starting tile with respect to the respective reference tile is determined.