SZodixStudyAcademic Library

Shelves Open access

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

Ranking paths in stochastic time-dependent networks · Study

ArticleShelves

ArticleRanking paths in stochastic time-dependent networks

Lars Relund Nielsen2013

OA

Articlegreen2013

Ranking paths in stochastic time-dependent networks

Lars Relund Nielsen · Kim Allan Andersen · Daniele Pretolani

17 citations·0/0 files stored·European Journal of Operational Research

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 Complexity and Algorithms in Graphs Vehicle Routing Optimization Methods

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 — 17 citations exist upstream.

References

1986The Fastest Path through a Network with Random Time-Dependent Travel Times 2000Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks 1998Expected shortest paths in dynamic and stochastic traffic networks 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 2012Optimal paths in dynamic networks with dependent random link travel times 2011Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks 1997Transit Service and Path Choice Models in Stochastic and Time-Dependent Networks

Cited by

2017Finding the Most Reliable Strategy on Stochastic and Time-Dependent Transportation Networks: A Hypergraph Based Formulation 2015Solving the K-shortest paths problem in timetable-based public transportation systems 2021Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks 2024Reliable Routing Strategies on Urban Transportation Networks

Related works

Explore the map →

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

2014Simulation-Based Method for Finding Minimum Travel Time Budget Paths in Stochastic Networks with Correlated Link Timesarticle · 6 shared references 2017Finding the Most Reliable Strategy on Stochastic and Time-Dependent Transportation Networks: A Hypergraph Based Formulationarticle · 6 shared references 2021Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networksarticle · 6 shared references 2021Adaptive routing behavior with real-time information under multiple travel objectivesarticle · 6 shared references 2024Reliable Routing Strategies on Urban Transportation Networksarticle · 6 shared references 2013Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problemarticle · 5 shared references

Details

Year2013

Typearticle

Published2013-10-18

VenueEuropean Journal of Operational Research

ISSN-L0377-2217

Languageen

Citations17

Files0 public / 0

ShelfTransportation Planning and Optimization

Identifiers

doi10.1016/j.ejor.2013.10.022

openalex_workW2107387902

Links

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