Pijls, Wim; Post, Henk - In: European Journal of Operational Research 198 (2009) 2, pp. 363-369
For finding a shortest path in a network bidirectional A* is a widely known algorithm. This algorithm distinguishes between the main phase and the postprocessing phase. The version of bidirectional A* that is considered the most appropriate in literature hitherto, uses a so-called balanced...