Unscheduled Public Transport Intelligent Navigation System
暂无分享,去创建一个
[1] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[2] Ariel Orda,et al. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.
[3] Jerald Jariyasunant,et al. Algorithm for Finding Optimal Paths in a Public Transit Network with Real-Time Data , 2011 .
[4] K. Nachtigall. Time depending shortest-path problems with applications to railway networks , 1995 .
[5] Jung-Yuan Kung,et al. The fuzzy shortest path length and the corresponding shortest path in a network , 2005, Comput. Oper. Res..
[6] Ariel Orda,et al. Minimum weight paths in time-dependent networks , 1991, Networks.
[7] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[8] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .
[9] Richard P. Greene,et al. WHICH ARE THE LARGEST? WHY LISTS OF MAJOR URBAN AREAS VARY SO GREATLY , 2009 .
[10] Laurent Siklóssy,et al. Searching time-table networks , 1991, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.