+ Site Statistics
References:
54,258,434
Abstracts:
29,560,870
PMIDs:
28,072,757
+ Search Articles
+ Subscribe to Site Feeds
Most Shared
PDF Full Text
+ PDF Full Text
Request PDF Full Text
+ Follow Us
Follow on Facebook
Follow on Twitter
Follow on LinkedIn
+ Translate
+ Recently Requested

Pruning algorithm for the least expected travel time path on stochastic and time-dependent networks



Pruning algorithm for the least expected travel time path on stochastic and time-dependent networks



Transportation Research Part B: Methodological 108: 127-147




(PDF emailed within 0-6 h: $19.90)

Accession: 065127487

Download citation: RISBibTeXText

DOI: 10.1016/j.trb.2017.12.015


Related references

Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations. Transportation Research Part B: Methodological 96: 68-91, 2017

Dynamic and stochastic shortest path in transportation networks with two components of travel time uncertainty. Transportation Research Part C: Emerging Technologies 11(5): 331-354, 2003

Application of the support vector machine and heuristic k-shortest path algorithm to determine the most eco-friendly path with a travel time constraint. Transportation Research Part D: Transport and Environment 57: 458-473, 2017

The time-dependent vehicle routing problem with soft time windows and stochastic travel times. Transportation Research Part C: Emerging Technologies 48: 66-83, 2014

Dynamic routing for milk-run tours with time windows in stochastic time-dependent networks. Transportation Research Part E: Logistics and Transportation Review 97: 251-267, 2017

Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks. Transportation Research Part C: Emerging Technologies 21(1): 196-213, 2012

A simplified algorithm for the all pairs shortest path problem withO(n2logn) expected time. Journal of Combinatorial Optimization 25(2): 326-337, 2013

Delay-distribution-dependent stability of stochastic discrete-time neural networks with randomly mixed time-varying delays. Neurocomputing 72(16-18): 3830-3838, 2009

New delay-distribution-dependent stability analysis for discrete-time stochastic neural networks with randomly time-varying delays. Neurocomputing 116: 30-37, 2013

Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem. Transportation Research Part B: Methodological 59: 22-44, 2014

Eco-reliable path finding in time-variant and stochastic networks. Energy 121: 372-387, 2017

Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm. International Journal of Production Economics 125(1): 137-145, 2010

Time-dependent congestion pricing system for large networks: Integrating departure time choice, dynamic traffic assignment and regional travel surveys in the Greater Toronto Area. Transportation Research Part A: Policy and Practice 94: 411-430, 2016

Robust delay-distribution-dependent stability of discrete-time stochastic neural networks with time-varying delay. Neurocomputing 72(4-6): 1265-1273, 2009

Estimating the value of travel time and of travel time reliability in road networks. Transportation Research Part B: Methodological 66: 129-147, 2014