SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Expected shortest paths in dynamic and stochastic traffic networks · Study

ArticleShelves

ArticleExpected shortest paths in dynamic and stochastic traffic networks

Liping Fu1998

Article1998

Expected shortest paths in dynamic and stochastic traffic networks

Liping Fu · Laurence R. Rilett

285 citations·0/0 files stored·Transportation Research Part B Methodological

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Traffic control and management Traffic Prediction and Management Techniques

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 285 citations exist upstream.

References

1986The Fastest Path through a Network with Random Time-Dependent Travel Times

Cited by

2005Optimal routing policy problems in stochastic time-dependent networks 2006Chapter 9 Hazardous Materials Transportation 2005Arriving on Time 2001An adaptive routing algorithm for in-vehicle route guidance systems with real-time information 2000Adaptive least-expected time paths in stochastic, time-varying transportation and data networks 2005Path finding under uncertainty 2005Shortest paths in stochastic networks with correlated link costs 2013Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2000Least Expected Time Paths in Stochastic, Time-Varying Transportation Networksarticle · 1 shared reference 2009Shortest path problem considering on-time arrival probabilityarticle · 1 shared reference 2005Optimal routing policy problems in stochastic time-dependent networksarticle · 1 shared reference 2009Adaptive route choices in risky traffic networks: A prospect theory approacharticle · 1 shared reference 1993FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR INTELLIGENT VEHICLE-HIGHWAY SYSTEMS APPLICATION∗article · 1 shared reference 2006Chapter 2 Public Transitchapter · 1 shared reference

Details

Year1998

Typearticle

Published1998-09-01

VenueTransportation Research Part B Methodological

ISSN-L0191-2615

Languageen

Citations285

Files0 public / 0

ShelfTransportation Planning and Optimization

Identifiers

doi10.1016/s0191-2615(98)00016-2

openalex_workW2066145367

Links

Imported from OpenAlex (CC0) — nothing here is generated.