Skip to main content
SpringerLink
Log in

Extended distributed learning automata

An automata-based framework for solving stochastic graph optimization problems

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

In this paper, a new structure for cooperative learning automata called extended learning automata (eDLA) is introduced. Based on the new structure, an iterative randomized heuristic algorithm using sampling is proposed for finding an optimal subgraph in a stochastic edge-weighted graph. Stochastic graphs are graphs in which the weights of edges have an unknown probability distribution. The proposed algorithm uses an eDLA to find a policy that leads to a subgraph that satisfy some restrictions such as minimum or maximum weight (length). At each stage of the proposed algorithm, the eDLA determines which edges should be sampled. The proposed eDLA-based sampling method may reduce unnecessary samples and hence decrease the time required for finding an optimal subgraph. It is shown that the proposed method converges to an optimal solution, the probability of which can be made arbitrarily close to 1 by using a sufficiently small learning parameter. A new variance-aware threshold value is also proposed that can significantly improve the convergence rate of the proposed eDLA-based algorithm. It is further shown that our algorithm is competitive in terms of the quality of the solution.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Narendra K. S., Thathachar M. L. A. A. (1974) Learning automata-a survey. IEEE Trans on Syst, Man Cybern (4),323–334

  2. Thathachar ML, Sastry PS (2002) Varieties of learning automata: An overview. IEEE Transactions on Systems, Man, and Cybernetics. Part B, Cybernetics: A publication of the IEEE Systems, Man, and cybernetics society 32:711–22

    Article  Google Scholar 

  3. Meybodi M, Beigy H (2001) A sampling method based on distributed learning automata for stochastic shortest path problem. In: the 10th Iranian conference on electrical engineering, vol I

  4. Jahanshahi M, Dehghan M, Meybodi MR (2012) LAMR: learning automata based multicast routing protocol for multi-channel multi-radio wireless mesh networks. Appl Intell 38:58–77

    Article  Google Scholar 

  5. Yazidi A, Granmo O-C, Oommen BJ (2011) Service selection in stochastic environments: A learning-automaton based solution. Appl Intell 36:617–637

    Article  Google Scholar 

  6. Beigy H, Meybodi M (2003) Solving stochastic shoretst path problem using Monte Carlo sampling method: a distributed learning automata approach. Springer-Verlag lecture notes in advances in soft computing: Neural networks and soft computing, pp 626– 632

  7. Beigy H, Meybodi M R (2006) Utilizing distributed learning automata to solve stochastic shortest path problems. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 14:591–615

    Article  MathSciNet  MATH  Google Scholar 

  8. Mollakhalili Meybodi M, Meybodi MR (2004) A New Distributed Learning Automata Based Algorithm for Solving Stochastic Shortest Path. In: 6th conference on intelligent systems, (kerman)

  9. Alipour M, Meybodi M (2005) Solving traveling salesman problem using distributed learning automata. In: Proceedings of 10th Annual CSI Computer Conference, (Tehran, Iran), pp 759–761

  10. Motevalian A, Meybodi M (2006) Solving maximal independent set problem using distributed learning automata. In: 14th Iranian electrical engineering conference (ICEE2006), vol 1. Tehran

  11. Saati S, Meybodi M (2005) A self organizing model for document structure using distributed learning automata. In: Second international conference on information and knowledge technology (IKT2005)

  12. Anari B, Meybodi MR (2007) A Method based on distributed learning automata for determining web documents structure. In: 12th annual CSI computer conference of Iran, pp 2276– 2282

  13. Mollakhalili Meybodi M, Meybodi M (2008) Link prediction in adaptive web sites using distributed learning automata. In: 13th annual CSI computer conference of Iran, Kish Island

  14. Mollakhalili Meybodi M, Meybodi M R (2012) A distributed learning automata based approach for user modeling in adaptive hypermedia. In: Congress on electrical, computer and information technology, Mashhad

  15. BaradaranHashemi A, Meybodi M (2007) Web Usage Mining Using Distributed Learning Automata, In: 12th Annual CSI Computer Conference of Iran, Tehran, pp 553–560

  16. Akbari Torkestani J (2012) An adaptive focused web crawling algorithm based on learning automata. Appl Intell 37:586–601

    Article  Google Scholar 

  17. Thathachar B, Harita MAL (1987) Learning automata with changing number of actions. IEEE Trans Syst Man Cybern Syst Hum 17(6):1095–1100

    Article  Google Scholar 

  18. Sato T (1999) On some asymptotic properties of learning automaton networks. Techical Report

  19. Lakshmivarahan S, Thathachar M (1976) Bounds on the convergence probabilities of learning automata. IEEE Trans Syst Man Cybern Syst Hum 6(11):756–763

    Article  MathSciNet  MATH  Google Scholar 

  20. Norman F (1968) On the linear model with two absorbing. J Math Psychol 5:225–241

    Article  MathSciNet  MATH  Google Scholar 

  21. Zhang X, Granmo O-C, Oommen B J, Jiao L (2014) A formal proof of the 𝜖-optimality of absorbing continuous pursuit algorithms using the theory of regular functions. In: Applied intelligence

  22. Akbari Torkestani J (2012) An adaptive focused Web crawling algorithm based on learning automata. Appl Intell 37:586–601

    Article  Google Scholar 

  23. Narendra, Kumpati S., M. L. A. A. Thathachar (1989) Learning automata: An introduction. Prentice Hall, Englewood Cliffs

  24. Ross SM (2004) Introduction to probability and statistics dor engineers and scientists, 3rd edn. Elsevier Academic Press

  25. Papoulis A (1991) Probability, random variables, and stochastic processes, 3rd edn., McGrawHill

  26. Hutson K R, Shier D R (2005) Bounding distributions for the weight of a minimum spanning tree in stochastic networks. Oper Res 53(5):879–886

    Article  MathSciNet  MATH  Google Scholar 

  27. Akbari Torkestani J, Meybodi M R (2011) Learning automata-based algorithms for solving stochastic minimum spanning tree problem. Appl Soft Comput 11:4064–4077

    Article  Google Scholar 

Download references

Author information

Author notes

  1. Mohammad Reza Mollakhalili Meybodi

    Present address: Department of Computer Engineering, Maybod Branch, Islamic Azad University, Maybod, Iran

Authors and Affiliations

  1. Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran

    Mohammad Reza Mollakhalili Meybodi

  2. Soft Computing Laboratory, Amirkabir University of Technology, Tehran, Iran

    Mohammad Reza Meybodi

Authors
  1. Mohammad Reza Mollakhalili Meybodi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad Reza Meybodi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohammad Reza Mollakhalili Meybodi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mollakhalili Meybodi, M.R., Meybodi, M.R. Extended distributed learning automata. Appl Intell 41, 923–940 (2014). https://doi.org/10.1007/s10489-014-0577-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-014-0577-2

Keywords

Search

Navigation