Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation
type: Item
instance of: scholarly article
title: Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation
zbMATH Open document ID: 1390.90079
author: A. Arun Prakash
author: K. Srinivasan
published in: Networks and Spatial Economics
publication date: 2018-06-18T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B15
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 90B25
zbMATH DE Number: 6890493
zbMATH Keywords: reliability
zbMATH Keywords: robust-cost
zbMATH Keywords: stochastic and time-dependent networks
zbMATH Keywords: hypergraphs
zbMATH Keywords: network optimization
MaRDI profile type: Publication
full work available at URL: s11067-017-9345-2
OpenAlex ID: W2607843552
cites work: Finding reliable shortest paths in road networks under uncertainty
cites work: Optimal routing for maximizing the travel time reliability
cites work: Directed hypergraphs and applications
cites work: A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems
cites work: Finding efficient and environmentally friendly paths for risk-averse freight carriers
cites work: Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
cites work: Least expected time paths in stochastic, time-varying transportation networks
cites work: Optimal path problems with second-order stochastic dominance constraints
cites work: Finding the \(K\) shortest hyperpaths
cites work: Ranking paths in stochastic time-dependent networks
cites work: Stochastic shortest path problems with recourse
cites work: A directed hypergraph model for random time dependent shortest paths
cites work: Effects of countdown displays in public transport route choice under severe overcrowding
cites work: Finding the K Shortest Loopless Paths in a Network
DOI: 10.1007/S11067-017-9345-2
description: scientific article; zbMATH DE number 6890493