Routing problems and Markovian decision processes

DOI10.1016/0022-247X(85)90097-6zbMATH Open0555.90100MaRDI QIDQ761359FDOQ761359

Authors: N. G. F. Sancho 

Publication date: 1985

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Recommendations

• Optimal dynamic routing in Markov queueing networks
• Optimal routing for maximizing the travel time reliability
• Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs
• Markovian assignment decision process
• Problem of optimal choice of a route under conditions of time discounting

zbMATH Keywords

networkoptimal policymaximum reliabilitystochastic direction choicestochastic routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Markov and semi-Markov decision processes (90C40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Introduction to the mathematical theory of control processes. Vol. II:Nonlinear processes
• Title not available (Why is that?)
• Routing through a network with maximum reliability

Cited In (5)

• Stochastic shortest path problems with associative accumulative criteria
• Optimal routing for maximizing the travel time reliability
• Multiple objective (fuzzy) dynamic programming problems: a survey and some applications
• A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching
• A MDP approach to fault-tolerant routing

This page was built for publication: Routing problems and Markovian decision processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761359)