The Stochastic Time-Varying Shortest Path Problem

Wei Jie; Hang Wei

doi:10.1061/41184(419)65

ScienceGate Book Chapters

JOURNAL ARTICLE

The Stochastic Time-Varying Shortest Path Problem

Wei Jie Hang Wei

Year: 2011 Pages: 390-397

DOI: 10.1061/41184(419)65

Get Full-Text PDF Get Analytical Report

Abstract

Shortest path problem is a basic problem in the research of combinatorial optimization. The transportation network is time-varying and stochastic affected by traffic, weather and other factors. The paper built a model for stochastic time-varying shortest path problem and proposed an algorithm to solve this problem. After discussing the complexity of the algorithm, and a case study is given.

Keywords:

Shortest path problem K shortest path routing Computer science Yen's algorithm Mathematical optimization Shortest Path Faster Algorithm Constrained Shortest Path First Longest path problem Path (computing) Euclidean shortest path Widest path problem Stochastic process Dijkstra's algorithm Mathematics Theoretical computer science Graph Computer network

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.12

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Data Management and Algorithms

Physical Sciences → Computer Science → Signal Processing

Transportation Planning and Optimization

Social Sciences → Social Sciences → Transportation

Traffic Prediction and Management Techniques

Physical Sciences → Engineering → Building and Construction

The Stochastic Time-Varying Shortest Path Problem

Abstract

Metrics

Topics

Related Documents

Shortest Path Problem in Stochastic Time-varying Transportation Networks Considering Risk Measurement

Approximation Solutions for Time-Varying Shortest Path Problem

Time-Varying Shortest Path Problems

Model and Algorithm for Continuous Time-Varying Shortest Path Problem

Distributionally robust stochastic shortest path problem