The K shortest transit paths choosing algorithm in stochastic transit network

  • Authors:

  • Liyuan Zhao;Yiliang Xiong;Hong Sun

  • Affiliations:

  • College of Traffic and Transportation, Southwest Jiaotong University, Chengdu, P.R. China;College of Traffic and Transportation, Southwest Jiaotong University, Chengdu, P.R. China;School of Air Transportation Management, Civil Aviation Flight University of China, Guanghan, P.R. China

  • Venue:
  • RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The public transit route choosing problem is the key technology of public transit passenger information system. Considering travel time variety caused by uncertainty traffic congestion condition, firstly this paper designs the least transfer times algorithm and the K shortest transit paths algorithm in the stochastic transit network. On the basis of travel psychology analysis, transfer times, travel time and cost of each transit path plan are taken into account. By changing link travel time reliability, the algorithms generate different K shortest transit path plans under different traffic conditions. Computational experiments demonstrate the efficiency of the model and algorithm in stochastic transit network.