Validation of a schedule‐based capacity restraint transit assignment model for a large‐scale network

Poon, MH; Tong, CO; Wong, S. C.

doi:10.1002/atr.5670380103

Cited by 15 publications

(9 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nguyen et al (1989) made an early attempt with an uncongested, frequencybased transit network. Recently, Tong (1998,2003) and Tong et al (2001) developed an entropy-based 0 -D estimation procedure for a schedule-based transit network (Tong and Wong, 1999;Poon et al, 2003Poon et al, , 2004. That method was applied to a case study of the MTR system in Hong Kong.…”

Section: Introductionmentioning

confidence: 99%

Estimation of origin-destination matrices for a multimodal public transit network

Wong

Tong

et al. 2010

J. Adv. Transp.

View full text Add to dashboard Cite

This paper presents a procedure for the estimation of origindestination (0-D) matrices for a multimodal public transit network. The system consists of a number of favored public transit modes that are obtained from a modal split process in a traditional four-step transportation model. The demand of each favored mode is assigned to the multimodal network, which is comprised of a set of connected links of different public transit modes. An entropy maximization procedure is proposed to simultaneously estimate the 0-D demand matrices of all favored modes, which are consistent with target data sets such as the boarding counts and line segment flows that are observed directly in the network. A case study of the Hong Kong multimodal transit network is used to demonstrate the effectiveness of the proposed methodology.

show abstract

Section: Introductionmentioning

confidence: 99%

Estimation of origin-destination matrices for a multimodal public transit network

Wong

Tong

et al. 2010

J. Adv. Transp.

View full text Add to dashboard Cite

show abstract

“…Optimum path algorithms are widely used in demand estimation, trip planning, and traffic assignment in transit networks (Poon et al, 2003 andTong and Wong, 1999a,b;Wong et al, 2005;Wong and Tong, 1998). However, users may not be fully satisfied with the information that is provided by such algorithms, as the optimal path minimizes the total travel cost that is the weighted sum of several time components or other costs.…”

Section: Introductionmentioning

confidence: 99%

“…The algorithm was applied to a prototype trip planning system that involves several realistic representations of transit networks. In the first phase of the development of the system, the Mass Transit Railway (MTR) and Kowloon Canton Railway (KCR) networks in Hong Kong were selected as case studies (Poon et al, 2003(Poon et al, , 2004. In the evaluation phase, a network that comprised subway and bus lines in Guangzhou was selected.…”

Section: Introductionmentioning

confidence: 99%

An algorithm for finding reasonable paths in transit networks

Tan

Tong²,

Wong³

et al. 2007

J of Advced Transportation

Self Cite

View full text Add to dashboard Cite

In this paper, reasonable paths in transit networks are defined as possible paths that satisfy the acceptable time criterion and transfer-walk criterion. A recursive algorithm for finding all of the reasonable paths in a transit network that does not involve a rapid increase in program run-time with network size is presented. Realistic transit networks in Hong Kong and Guangzhou were selected as case studies of the different phases of the development of a trip planning system. Transport planning practitioners and potential users were invited to test the system to evaluate its performance. The results of the prototype evaluation were satisfactory, and the viability of the system as a useful tool for supporting decisionmaking has been confirmed by the positive feedback that was obtained from survey questionnaires.

show abstract

“…Route searching in multimodal transit networks involves procedures more complicated than simply finding the shortest distance or time paths, which may involve the use of hyperpaths to handle the common line problem and waiting time of transit routes (Nguyen and Pallottino, 1988;Spiess and Florian, 1989;De Cea and Fernandez, 1993;Wu et al, 1994). In other situations, with known schedule information, the search procedure may involve schedulebased networks (Nguyen et al, 2001;Nuzzolo et al, 2001;Tong et al, 2001;Poon et al, 2004).…”

Section: Introductionmentioning

confidence: 99%

Passenger route guidance system for multi-modal transit networks

Lo¹,

Yip²,

Mak³

2005

ATR

View full text Add to dashboard Cite

In many public transport oriented cities in the world, especially Asian cities, the public transport system has been developed extensively, to the extent that it has become increasingly difficult to navigate. Although inter-modal transfers are common and often necessary, a complete set of the routes across transport modes is generally not presented in a form that is accessible to travelers, as each operator would only publish its own routes. Moreover, the common nonlinear fare tables together with inter-modal fare discounts pose challenges to travelers in deciding their best routes. This study develops a multi-modal passenger route guidance system, called eFinder, to aid travelers with their combined mode-route choices. We discuss the architecture and features of this system in this study. This system forms a platform for disseminating public transit information and should complement further development and use of the public transport network by enabling travelers to make informed choices.

show abstract

Validation of a schedule‐based capacity restraint transit assignment model for a large‐scale network

Cited by 15 publications

References 17 publications

Estimation of origin-destination matrices for a multimodal public transit network

Estimation of origin-destination matrices for a multimodal public transit network

An algorithm for finding reasonable paths in transit networks

Passenger route guidance system for multi-modal transit networks

Contact Info

Product

Resources

About