Finding the shortest path in stochastic graphs using learning automata and adaptive stochastic Petri nets

DOI10.1142/S0218488517500180MaRDI QIDQ4600564zbMATHOpenAlexFDO

Authors

Publication date 11 January 2018

Published in International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218488517500180

zbMATH Keywords

shortest path problemlearning automatastochastic graphsadaptive stochastic Petri net based on learning automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS
• Models and algorithm for stochastic shortest path problem
• scientific article; zbMATH DE number 3869088
• Stochastic shortest path problems with recourse
• An Analysis of Stochastic Shortest Path Problems

Cited in

(4)

• Time Series Forecasting Using Range Regression Automata
• Cellular automata, learning automata, and cellular learning automata for optimization
• UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS
• An introduction to learning automata and optimization

This page was built for publication: Finding the shortest path in stochastic graphs using learning automata and adaptive stochastic Petri nets

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