USING K-SHORTEST PATHS ALGORITHMS TO ACCOMMODATE USER PREFERENCES IN THE OPTIMIZATION OF PUBLIC TRANSPORT TRAVEL
作者： Qiujin Wu , Joanna Hartley
DOI: 10.1061/40730(144)34
关键词:
摘要: Traffic congestion is becoming a serious problem in more and modern cities. Encouraging private-vehicle drivers to use public transportation one of the most effective economical ways reduce ever increasing on streets (Hartley Bargiela, 2001). To make transport services attractive competitive, providing travellers with individual travel advice for journeys becomes crucial. However, massive complex network city, finding or several suitable route(s) according user preferences from place another not simple task. In this paper, author presents an approach that uses K-shortest paths algorithms compute reasonable number ranked shortest paths, ultimate 'most optimal' path being selected by consideration preferences. Some experiments have been done based Nottingham City
core.ac.uk
sci-hub.se 参考文章(9)
A Bargiela, J Hartley, DECISION SUPPORT FOR PLANNING MULTI-MODAL URBAN TRAVEL annual simulation symposium. ,(2001)
J Coggan, E Peytchev, SEE BEFORE YOU GO Traffic technology international. ,(1999)
A. W. Brander, M. C. Sinclair, A Comparative Study of k-Shortest Path Algorithms Performance Engineering of Computer and Telecommunications Systems. pp. 370- 379 ,(1996) , 10.1007/978-1-4471-1007-1_25
D. R. Shier, On algorithms for finding the k shortest paths in a network Networks. ,vol. 9, pp. 195- 214 ,(1979) , 10.1002/NET.3230090303
Jin Y. Yen, Finding the K Shortest Loopless Paths in a Network Management Science. ,vol. 17, pp. 712- 716 ,(1971) , 10.1287/MNSC.17.11.712
Douglas R. Shier, Computational experience with an algorithm for finding the k shortest paths in a network Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences. pp. 139- ,(1974) , 10.6028/JRES.078B.020
J. Hine, J. Scott, SEAMLESS, ACCESSIBLE TRAVEL: USERS' VIEWS OF THE PUBLIC TRANSPORT JOURNEY AND INTERCHANGE Transport Policy. ,vol. 7, pp. 217- 226 ,(2000) , 10.1016/S0967-070X(00)00022-6
Stuart E. Dreyfus, An Appraisal of Some Shortest-Path Algorithms Operations Research. ,vol. 17, pp. 395- 412 ,(1969) , 10.1287/OPRE.17.3.395
E. W. Dijkstra, A note on two problems in connexion with graphs Numerische Mathematik. ,vol. 1, pp. 269- 271 ,(1959) , 10.1007/BF01386390