Finding the Shortest Path in Stochastic Graphs Using Learning Automata and Adaptive Stochastic Petri Nets

DOI10.1142/S0218488517500180zbMath1377.68153OpenAlexW2617189554MaRDI QIDQ4600564

No author found.

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

learning automatashortest path problemstochastic graphsadaptive stochastic Petri net based on learning automata

Mathematics Subject Classification ID

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

Related Items (3)

An Introduction to Learning Automata and Optimization ⋮ Cellular Automata, Learning Automata, and Cellular Learning Automata for Optimization ⋮ Time Series Forecasting Using Range Regression Automata

This page was built for publication: Finding the Shortest Path in Stochastic Graphs Using Learning Automata and Adaptive Stochastic Petri Nets