A New Path Search Algorithm for Providing Paths among Multiple Origins and One Single Destination

Route planning services provide directional functionalities allowing people to make transport plan in which such services are now closely interrelated to people’s daily life. Existing route planners such as digital maps only offer the path search services originated from one place which cannot fulfil the increasing needs of people. In this paper, we first describe a new service for digital map that provides route plans for people from different origins towards the same destination for the purpose of group travelling. Since the performance of route planner highly depends on shortest path search algorithms, in this paper, we also introduce our newly proposed path search algorithm, namely, Multi-origins Common Destination algorithm. The initial evaluation results show it outperforms the counterparts.

[1]  Dennis de Champeaux,et al.  An Improved Bidirectional Heuristic Search Algorithm , 1975, JACM.

[2]  Heng Tao Shen,et al.  Multi-source Skyline Query Processing in Road Networks , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[3]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[4]  T. Lindvall ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[5]  Wim Pijls,et al.  A new bidirectional search algorithm with shortened postprocessing , 2009, Eur. J. Oper. Res..

[6]  Taeg Keun Whangbo Efficient Modified Bidirectional A* Algorithm for Optimal Route-Finding , 2007, IEA/AIE.

[7]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.