Three Extensions of Tong and Richardson’s Algorithm for Finding the Optimal Path in Schedule-Based Railway Networks

High-speed railways have been developing quickly in recent years and have become a main travel mode between cities in many countries, especially China. Studying passengers’ travel choices on high-speed railway networks can aid the design of efficient operations and schedule plans. The Tong and Richa...

Full description

Saved in:
Bibliographic Details
Main Authors: J. Xie, S. C. Wong, S. M. Lo
Format: Article
Language:English
Published: Wiley 2017-01-01
Series:Journal of Advanced Transportation
Online Access:http://dx.doi.org/10.1155/2017/9216864
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832556460105531392
author J. Xie
S. C. Wong
S. M. Lo
author_facet J. Xie
S. C. Wong
S. M. Lo
author_sort J. Xie
collection DOAJ
description High-speed railways have been developing quickly in recent years and have become a main travel mode between cities in many countries, especially China. Studying passengers’ travel choices on high-speed railway networks can aid the design of efficient operations and schedule plans. The Tong and Richardson algorithm that is used in this model offers a promising method for finding the optimal path in a schedule-based transit network. However, three aspects of this algorithm limit its application to high-speed railway networks. First, these networks have more complicated common line problems than other transit networks. Without a proper treatment, the optimal paths cannot be found. Second, nonadditive fares are important factors in considering travel choices. Incorporating these factors increases the searching time; improvement in this area is desirable. Third, as high-speed railways have low-frequency running patterns, their passengers may prefer to wait at home or at the office instead of at the station. Thus, consideration of a waiting penalty is needed. This paper suggests three extensions to improve the treatments of these three aspects, and three examples are presented to illustrate the applications of these extensions. The improved algorithm can also be used for other transit systems.
format Article
id doaj-art-3cb7dc651bbb493fbf8e616bf49f66b9
institution Kabale University
issn 0197-6729
2042-3195
language English
publishDate 2017-01-01
publisher Wiley
record_format Article
series Journal of Advanced Transportation
spelling doaj-art-3cb7dc651bbb493fbf8e616bf49f66b92025-02-03T05:45:24ZengWileyJournal of Advanced Transportation0197-67292042-31952017-01-01201710.1155/2017/92168649216864Three Extensions of Tong and Richardson’s Algorithm for Finding the Optimal Path in Schedule-Based Railway NetworksJ. Xie0S. C. Wong1S. M. Lo2Department of Civil Engineering, The University of Hong Kong, Pokfulam, Hong KongDepartment of Civil Engineering, The University of Hong Kong, Pokfulam, Hong KongDepartment of Architecture and Civil Engineering, City University of Hong Kong, Kowloon, Hong KongHigh-speed railways have been developing quickly in recent years and have become a main travel mode between cities in many countries, especially China. Studying passengers’ travel choices on high-speed railway networks can aid the design of efficient operations and schedule plans. The Tong and Richardson algorithm that is used in this model offers a promising method for finding the optimal path in a schedule-based transit network. However, three aspects of this algorithm limit its application to high-speed railway networks. First, these networks have more complicated common line problems than other transit networks. Without a proper treatment, the optimal paths cannot be found. Second, nonadditive fares are important factors in considering travel choices. Incorporating these factors increases the searching time; improvement in this area is desirable. Third, as high-speed railways have low-frequency running patterns, their passengers may prefer to wait at home or at the office instead of at the station. Thus, consideration of a waiting penalty is needed. This paper suggests three extensions to improve the treatments of these three aspects, and three examples are presented to illustrate the applications of these extensions. The improved algorithm can also be used for other transit systems.http://dx.doi.org/10.1155/2017/9216864
spellingShingle J. Xie
S. C. Wong
S. M. Lo
Three Extensions of Tong and Richardson’s Algorithm for Finding the Optimal Path in Schedule-Based Railway Networks
Journal of Advanced Transportation
title Three Extensions of Tong and Richardson’s Algorithm for Finding the Optimal Path in Schedule-Based Railway Networks
title_full Three Extensions of Tong and Richardson’s Algorithm for Finding the Optimal Path in Schedule-Based Railway Networks
title_fullStr Three Extensions of Tong and Richardson’s Algorithm for Finding the Optimal Path in Schedule-Based Railway Networks
title_full_unstemmed Three Extensions of Tong and Richardson’s Algorithm for Finding the Optimal Path in Schedule-Based Railway Networks
title_short Three Extensions of Tong and Richardson’s Algorithm for Finding the Optimal Path in Schedule-Based Railway Networks
title_sort three extensions of tong and richardson s algorithm for finding the optimal path in schedule based railway networks
url http://dx.doi.org/10.1155/2017/9216864
work_keys_str_mv AT jxie threeextensionsoftongandrichardsonsalgorithmforfindingtheoptimalpathinschedulebasedrailwaynetworks
AT scwong threeextensionsoftongandrichardsonsalgorithmforfindingtheoptimalpathinschedulebasedrailwaynetworks
AT smlo threeextensionsoftongandrichardsonsalgorithmforfindingtheoptimalpathinschedulebasedrailwaynetworks