Chris Pendleton announced on the Bing Maps blog that they have pushed out a major update to their driving directions “routing engine.” The new routing engine is twice as fast as the old one and adds more features like adding up to 3 routes in one request.
Previously, Bing Maps used a routing algorithm named Dijkstra’s algorithm. They replaced it with a new one named “Customizable Route Planning” or “CRP” for short. The new Customizable Route Planning algorithm is “twice as fast” as the Dijkstra’s algorithm, according to Chris Pendleton.
Chris also posted an excerpt of how this new routing calculation algorithm works:
Basic Algorithm. Our metric-independent preprocessing stage partitions the graph into connected cells with at most U (an input parameter) vertices each, with as few boundary arcs (arcs with endpoints in di erent cells) as possible. The metric customization stage builds a graph H containing all boundary vertices (those with at least one neighbor in another cell) and boundary arcs of G. It also contains a clique for each cell C: for every pair (v;w) of boundary vertices in C, we create an arc (v;w) whose cost is the same as the shortest path (restricted to C) between v and w (or in nite if w is not reachable from v). We do so by running Dijkstra from each boundary vertex. Note that H is an overlay : the distance between any two vertices in H is the same as in G. Finally, to perform a query between s and t, we run a bidirectional version of Dijkstra’s algorithm on the graph consisting of the union of H, Cs, and Ct. (Here Cv denotes the subgraph of G induced by the vertices in the cell containing v.) As already mentioned, this is the basic strategy of separator-based methods. In particular, HiTi  uses edge-based separators and cliques to represent each cell. Unfortunately, HiTi has not been tested on large road networks; experiments were limited to small grids, and the original proof of concept does not appear to have been optimized using modern algorithm engineering techniques. Our rst improvement over HiTi and similar algorithms is to use PUNCH  to partition the graph. Recently developed to deal with road networks, it routinely nds solutions with half as many boundary edges (or fewer), compared to the general-purpose partitioners (such as METIS ) commonly used by previous algorithms. Better partitions reduce customization time and space, leading to faster queries. For our experiments, we used relatively long runs of PUNCH, taking about an hour. Our results would not change much if we used the basic version of PUNCH, which is only about 5% worse but runs in mere minutes. We use parallelism: queries run forward and reverse searches on two CPU cores, and customization uses all four (each cell is processed independently).
- Bing Maps Tweaks Its Navigation
- Bing Maps The Mall
- Bing Maps Expands Sharing, Editing Options
- Bing’s New Airport Maps Aim To Make Air Travel Easier
- Google Maps Vs. Bing Maps: Summer Vacation Planning Showdown
- Bing Maps’ “Game Changer”: Hi-Res Aerial Imagery Coming To Entire US and Western Europe