Optimal K-Route Searching Techniques Considering the Gate Tag Records at Transfer Stations in Urban Railway Network
Mee-Young Lee, Seongil Shin · 2015
The K route searching algorithms can be effectively applied for estimating passengers' trip behaviors in urban railway network. The optimality of old version of K searching methods is guaranteed based on a hypothesis that no passing tag record at transfer gates is existed. However real time tag records are being produced in the operational areas of three private organizations. Therefore the optimality of K route algorithm is required to be additionally verified. This study proposes a heuristic network transformation approach which guarantees the optimality of K route algorithm by differentiating both tag-in and tag-out type of records. The existing network transformation is applied in the link label based entire path deletion algorithm which is utilized for finding K number of minimum cost routes in sequence.