Treffer: Dynamic shortest paths in acyclic networks with Markovian arc costs
Title:
Dynamic shortest paths in acyclic networks with Markovian arc costs
Authors:
Source:
Operations research. 41(1):91-101
Publisher Information:
Linthicum, MD: Institute for Operations Research and the Management Sciences, 1993.
Publication Year:
1993
Physical Description:
print, 14 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Flots dans les réseaux. Problèmes combinatoires, Flows in networks. Combinatorial problems, Approximation successive, Successive approximation, Aproximación sucesiva, Chemin plus court, Shortest path, Camino más corto, Complexité calcul, Computing complexity, Complejidad cálculo, Graphe acyclique, Acyclic graph, Grafo acíclico, Modèle dynamique, Dynamic model, Modelo dinámico, Modèle stochastique, Stochastic model, Modelo estocástico, Méthode récursive, Recursive method, Método recursivo, Problème transport, Transportation problem, Problema transporte, Processus Markov, Markov process, Proceso Markov, Programmation dynamique, Dynamic programming, Programación dinámica, Programmation linéaire, Linear programming, Programación lineal, Programmation paramétrique, Parametric programming, Programación paramétrica, Réseau, Network, Red, Arc cost, Policy iteration
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
National tech. univ. Athens, Athens, Greece
ISSN:
0030-364X
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.4635673
Database:
PASCAL Archive
Weitere Informationen
We examine shortest path problems in acyclic networks in which arc costs are known functions of certain environment variables at network nodes. Each of these variables evolves according to an independent Markov process. The vehicle can wait at a node (at a cost) in anticipation of more favorable arc costs. We first develop two recursive procedures for the individual arc case, one based on successive approximations, and the other on policy iteration. We also solve the same problem via parametric linear programming.