UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS

DOI10.1142/S0218488506004217zbMath1107.68076OpenAlexW2054326643MaRDI QIDQ3422198

Hamid Beigy, M. R. Meybodi

Publication date: 9 February 2007

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/s0218488506004217

zbMATH Keywords

learning automatashortest path problemdistributed learning automatastochastic graph

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata ⋮ A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs ⋮ Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem ⋮ Clustering the wireless ad hoc networks: a distributed learning automata approach ⋮ Grid resource discovery based on distributed learning automata ⋮ A NEW APPROACH FOR SOLVING THE MINIMUM COST FLOW PROBLEM WITH INTERVAL AND FUZZY DATA ⋮ LEARNING AUTOMATA-BASED ALGORITHMS FOR FINDING MINIMUM WEAKLY CONNECTED DOMINATING SET IN STOCHASTIC GRAPHS ⋮ Risk-Averse Shortest Path Interdiction ⋮ An Introduction to Learning Automata and Optimization

Cites Work

• A note on learning automata-based schemes for adaptation of BP parameters
• Adaptive least-expected time paths in stochastic, time-varying transportation and data networks
• Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
• Mathematische Optimierungsverfahren des Operations Research
• A Learning Model for Routing in Telephone Networks
• Shortest-path algorithms: Taxonomy and annotation
• State space partitioning methods for stochastic shortest path problems
• Graph partitioning using learning automata
• On the online shortest path problem with limited arc cost dependencies
• Stochastic shortest path problems with recourse

This page was built for publication: UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS