Multicriteria stochastic shortest path problem for electric vehicles
type: Item
instance of: scholarly article
title: Multicriteria stochastic shortest path problem for electric vehicles
zbMATH Open document ID: 1390.90068
author: Ehsan Jafari
author: Stephen D. Boyles
published in: Networks and Spatial Economics
publication date: 2018-06-18T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90B15
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90B25
zbMATH DE Number: 6890502
zbMATH Keywords: electric vehicles
zbMATH Keywords: stochastic networks
zbMATH Keywords: range anxiety
zbMATH Keywords: generalized dynamic programming
zbMATH Keywords: reliability
MaRDI profile type: Publication
full work available at URL: s11067-017-9358-x
OpenAlex ID: W2732632216
cites work: The electric vehicle shortest-walk problem with battery exchanges
cites work: Multi-objective and multi-constrained non-additive shortest path problems
cites work: On the online shortest path problem with limited arc cost dependencies
cites work: Optimal information location for adaptive routing
cites work: Generalized dynamic programming for multicriteria optimization
cites work: Optimal Routing and Energy Allocation for Lifetime Maximization of Wireless Sensor Networks With Nonideal Batteries
cites work: Finding reliable shortest paths in road networks under uncertainty
cites work: Q3888874
cites work: Optimal deployment of alternative fueling stations on transportation networks considering deviation paths
cites work: Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
cites work: Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
cites work: Least possible time paths in stochastic, time-varying networks.
cites work: Least expected time paths in stochastic, time-varying transportation networks
cites work: On the cardinality of the Pareto set in bicriteria shortest path problems
cites work: A directed hypergraph model for random time dependent shortest paths
cites work: A polynomial-time algorithm to find shortest paths with recourse
DOI: 10.1007/S11067-017-9358-X
description: scientific article; zbMATH DE number 6890502