Reliable a Priori Shortest Path Problem with Limited Spatial and Temporal Dependencies

Nie, Yu; Wu, Xing

doi:10.1007/978-1-4419-0820-9_9

Cited by 52 publications

(34 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the segment travel time is assumed to be only spatially correlated with its adjacent sections within a local 'impact area', in which the topological distance (measured by number of sections) between any two sections is less than or equal to k, namely k-limited spatial dependence. As was done in the work of Nie andWu (2009) andNikolova (2009), only travel time correlations between the neighboring sections (k = 1) are considered in this paper for illustration purpose, then Eq. (6) can be expressed as…”

Section: Travel Time Reliabilitymentioning

confidence: 98%

Continuum modeling of park-and-ride services considering travel time reliability and heterogeneous commuters – A linear complementarity system approach

Wang

2014

Transportation Research Part E: Logistics and Transportation Re

View full text Add to dashboard Cite

Section: Travel Time Reliabilitymentioning

confidence: 98%

Continuum modeling of park-and-ride services considering travel time reliability and heterogeneous commuters – A linear complementarity system approach

Wang

2014

Transportation Research Part E: Logistics and Transportation Re

View full text Add to dashboard Cite

“…[11]). In particular, a reliability formulation of a priori shortest path problem was proposed in [11] by incorporating limited spatial dependence between adjacent links.…”

Section: Introductionmentioning

confidence: 93%

“…[11]). In particular, a reliability formulation of a priori shortest path problem was proposed in [11] by incorporating limited spatial dependence between adjacent links. It assumed that link state followed a Markov property representing the spatial correlation by transition probabilities between link states.…”

Section: Introductionmentioning

confidence: 93%

“…It assumed that link state followed a Markov property representing the spatial correlation by transition probabilities between link states. The work in [11] was an extension of an earlier paper [12], which did not consider the spatial and temporal correlations. In another recent work, a multi-objective reliable path finding method in stochastic networks with correlated link costs were proposed in [13].…”

Section: Introductionmentioning

confidence: 97%

See 1 more Smart Citation

Real time route guidance with correlated link cost

Dong

2011

2011 14th International IEEE Conference on Intelligent Transportation Systems (ITSC)

View full text Add to dashboard Cite

Route finding issues have always been a significant research focus in intelligence transportation system. Many solution models have been proposed in the previous work and analyzed in detail. Successive link travel time correlation has been identified to play an important role in these models to realistically reflect the property of traffic flows. In this paper, we establish a framework to find the best route in a stochastic time-dependent network by considering link travel time indeterminacy and correlation between adjacent links with real time information. We provide explicit mathematical formulations to update the outing link travel time distributions according to the real time information and help the travelers to find the best route to their destination. A simple illustrative example is shown to demonstrate the effectiveness and advantages of the proposed method.

show abstract

“…Nie & Wu (2009b) studied a continuous formulation of a similar problem and proposed pseudo-polynomial approximation schemes. Recently, Nie & Wu (2009a) studied the FSD admissible path problem in a probabilistic network with limited temporal and spatial dependency. Additional objectives can be incorporated to define the "best" in a set of admissible paths, thereby providing flexibility to integrate risk preferences with other desirable routing criteria.…”

Section: Optimization Problem With Stochastic Dominance Constraintsmentioning

confidence: 99%

Optimal Path Problems with Second-Order Stochastic Dominance Constraints

Nie¹,

Wu²,

Homem-de-Mello

2011

Netw Spat Econ

Self Cite

View full text Add to dashboard Cite

This paper studies optimal path problems integrated with the concept of stochastic dominance. These problems arise from applications where travelers need trade off the risk associated with travel time against other costs when making routing decisions. Risk-averse behavior is embedded by constraining optimal paths with second-order stochastic dominance (SSD). A general linear operating cost is introduced to combine link-and path-based costs. The latter is employed to address schedule costs pertinent to late or early arrival. An equivalent linear program of the problem is constructed by transforming the SSD constraint into a finite number of linear constraints. Various solution techniques are discussed, including those based on linear programming and dynamic programming. Numerical results are provided using small-and medium-size examples.

show abstract

Reliable a Priori Shortest Path Problem with Limited Spatial and Temporal Dependencies

Cited by 52 publications

References 23 publications

Continuum modeling of park-and-ride services considering travel time reliability and heterogeneous commuters – A linear complementarity system approach

Continuum modeling of park-and-ride services considering travel time reliability and heterogeneous commuters – A linear complementarity system approach

Real time route guidance with correlated link cost

Optimal Path Problems with Second-Order Stochastic Dominance Constraints

Contact Info

Product

Resources

About