Bus Trip Planning Service Based on Real Time Data

Public transportation is regarded as one of the most efficient means to confront the explosively growing city traffic problems such as congestion and pollution. However, a major obstacle for public transportation to be more adopted by citizens is its generally poor user experience. This paper proposes a system of bus trip planning service, which can help public transportation users choose the most appropriate bus lines and transfers based on real time and predicted traffic data. Because of the large scale of the data size, a two-step combination of K-Transfer and Multi-Objective algorithms is used to optimize the system response time. Experimental results on real transportation networks of large cities prove that the system is efficient and practical.

[1]  Qian Zhang,et al.  DNA algorithm on optimal path selection for bus travel network , 2009, 2009 Fourth International on Conference on Bio-Inspired Computing.

[2]  Zihui Zang,et al.  A dynamic shortest path algorithm based on real-time traffic information in the urban public transit network , 2008, 2008 IEEE International Conference on Service Operations and Logistics, and Informatics.

[3]  David Al-Dabass,et al.  Time-dependent stochastic shortest path(s) algorithms for a scheduled transportation network , 2005 .

[4]  L. H. Zhang,et al.  Dual-Network Model and Its Application in Algorithms for Solving the Designated Vertex Shortest Path Problem , 2009, 2009 International Conference on Management and Service Science.

[5]  B. John Oommen,et al.  Dynamic algorithms for the shortest path routing problem: learning automata-based solutions , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[6]  Hani S. Mahmassani,et al.  Time dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications , 1993 .

[7]  Shiliang Sun,et al.  A bayesian network approach to traffic flow forecasting , 2006, IEEE Transactions on Intelligent Transportation Systems.

[8]  Ismail Chabini,et al.  Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time , 1998 .

[9]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[10]  Lelitha Vanajakshi,et al.  Travel time prediction under heterogeneous traffic conditions using global positioning system data from buses , 2009 .

[11]  Eleni I. Vlahogianni,et al.  Optimized and meta-optimized neural networks for short-term traffic flow prediction: A genetic approach , 2005 .

[12]  B. John Oommen,et al.  An efficient dynamic algorithm for maintaining all-pairs shortest paths in stochastic networks , 2006, IEEE Transactions on Computers.

[13]  Amer Shalaby,et al.  PREDICTION MODEL OF BUS ARRIVAL AND DEPARTURE TIMES USING AVL AND APC DATA , 2004 .

[14]  Da Yuan,et al.  Solving a shortest path problem by ant algorithm , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).