Loading...

An iterative stochastic algorithm based on distributed learning automata for finding the stochastic shortest path in stochastic graphs

Beigy, H ; Sharif University of Technology | 2019

280 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s11227-019-03085-0
  3. Publisher: Springer , 2019
  4. Abstract:
  5. In this paper, we study the problem of finding the shortest path in stochastic graphs and propose an iterative algorithm for solving it. This algorithm is based on distributed learning automata (DLA), and its objective is to use a DLA for finding the shortest path from the given source node to the given destination node whose weight is minimal in expected sense. At each stage of this algorithm, DLA specifies edges needed to be sampled. We show that the given algorithm finds the shortest path with minimum expected weight in stochastic graphs with high probability which can be close to unity as much as possible. We compare the given algorithm with some distributed learning automata-based iterative algorithms, a particle swarm optimization-based algorithm, an ant colony-based algorithm, a Q-learning-based algorithm, and an actor–critic-based algorithm for finding the shortest path. Computer experiments show that the proposed algorithm requires fewer edge samples to find the shortest path than the previously introduced DLA-based algorithms. © 2019, Springer Science+Business Media, LLC, part of Springer Nature
  6. Keywords:
  7. Distributed learning automata ; Learning automata ; Stochastic shortest path
  8. Source: Journal of Supercomputing ; 2019 ; 09208542 (ISSN)
  9. URL: https://link.springer.com/article/10.1007/s11227-019-03085-0?shared-article-renderer