Optimal routing for maximizing the travel time reliability
type: Item
instance of: scholarly article
title: Optimal routing for maximizing the travel time reliability
zbMATH Open document ID: 1128.90015
author: Yueyue Fan
author: Yu (Marco) Nie
published in: Networks and Spatial Economics
publication date: 2007-01-24T00:00:00Z
Mathematics Subject Classification ID: 90B15
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 5118173
zbMATH Keywords: shortest path problem
zbMATH Keywords: dynamic programming
zbMATH Keywords: stochastic networks
zbMATH Keywords: reliability
zbMATH Keywords: successive approximation
MaRDI profile type: Publication
full work available at URL: s11067-006-9287-6
OpenAlex ID: W1974399255
cites work: On a routing problem
cites work: Q3292915
cites work: ON A NEW APPROACH TO THE NUMERICAL SOLUTION OF A CLASS OF PARTIAL DIFFERENTIAL INTEGRAL EQUATIONS OF TRANSPORT THEORY
cites work: Algorithms for minimum-cost paths in time-dependent networks with waiting policies
cites work: A note on two problems in connexion with graphs
cites work: An Appraisal of Some Shortest-Path Algorithms
cites work: Shortest paths in stochastic networks with correlated link costs
cites work: Arriving on time
cites work: Shortest Paths in Probabilistic Graphs
cites work: Q3266141
cites work: Optimal paths in graphs with stochastic or multidimensional weights
cites work: Least expected time paths in stochastic, time-varying transportation networks
cites work: Stochastic shortest path problems with piecewise-linear concave utility functions
cites work: Minimizing risk models in stochastic shortest path problems
cites work: The Stochastic Shortest Route Problem
cites work: On the online shortest path problem with limited arc cost dependencies
cites work: Minimising a threshold probability in discounted Markov decision processes
DOI: 10.1007/S11067-006-9287-6
description: scientific article; zbMATH DE number 5118173