Passengers on a transit network with common lines are often faced with the problem of choosing between either to board the arriving bus or to wait for a faster one. Many existing assignment models are based on the classical assumption that at a given stop passengers board the first arriving carrier of a certain subset of available lines. It has been shown that, in this case, an {\it optimal subset} of lines that minimizes the passenger travel times exists and is easily determined if the headway distributions are exponential. However, when on-line information on future arrivals of buses are posted at various stops, it is unlikely that the above classical assumption holds. Passengers may choose in this case to board a line that offers the...
This paper proposes a frequency-based assignment model that considers travellers probability of find...
This paper proposes a frequency-based assignment model that considers travellers probability of find...
This paper proposes a frequency-based assignment model that considers travellers probability of find...
Passengers on a transit network with common lines are often faced with the problem of choosing betwe...
Passengers on a transit network with common lines are often faced with the problem of choosing betwe...
This paper studies the routing strategy in a transit network with partial online information at stop...
The paper presents a route choice model and algorithm for dynamic assignment in congested, i.e. over...
A transit passenger does not always use the same bus line between an O-D pair because several routes...
The concepts of optimal strategy and hyperpath were born within the framework of static frequency-ba...
The concepts of optimal strategy and hyperpath were born within the framework of static frequency-ba...
The concepts of optimal strategy and hyperpath were born within the framework of static frequency-ba...
The paper presents a route choice model for dynamic assignment in congested, i.e. overcrowded, trans...
In many cities, bus routes sometimes share common sections. When several bus routes share a common s...
This article considers the stochastic on-time arrival problem in transit networks where both the tra...
This paper proposes a frequency-based assignment model that considers travellers probability of find...
This paper proposes a frequency-based assignment model that considers travellers probability of find...
This paper proposes a frequency-based assignment model that considers travellers probability of find...
This paper proposes a frequency-based assignment model that considers travellers probability of find...
Passengers on a transit network with common lines are often faced with the problem of choosing betwe...
Passengers on a transit network with common lines are often faced with the problem of choosing betwe...
This paper studies the routing strategy in a transit network with partial online information at stop...
The paper presents a route choice model and algorithm for dynamic assignment in congested, i.e. over...
A transit passenger does not always use the same bus line between an O-D pair because several routes...
The concepts of optimal strategy and hyperpath were born within the framework of static frequency-ba...
The concepts of optimal strategy and hyperpath were born within the framework of static frequency-ba...
The concepts of optimal strategy and hyperpath were born within the framework of static frequency-ba...
The paper presents a route choice model for dynamic assignment in congested, i.e. overcrowded, trans...
In many cities, bus routes sometimes share common sections. When several bus routes share a common s...
This article considers the stochastic on-time arrival problem in transit networks where both the tra...
This paper proposes a frequency-based assignment model that considers travellers probability of find...
This paper proposes a frequency-based assignment model that considers travellers probability of find...
This paper proposes a frequency-based assignment model that considers travellers probability of find...
This paper proposes a frequency-based assignment model that considers travellers probability of find...