Skip to main content
SpringerLink
Log in

A rapid learning automata-based approach for generalized minimum spanning tree problem

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Generalized minimum spanning tree problem, which has several real-world applications like telecommunication network designing, is related to combinatorial optimization problems. This problem belongs to the NP-hard class and is a minimum tree on a clustered graph spanning one node from each cluster. Although exact and metaheuristic algorithms have been applied to solve the problems successfully, obtaining an optimal solution using these approaches and other optimization tools has been a challenge. In this paper, an attempt is made to achieve a sub-optimal solution using a network of learning automata (LA). This algorithm assigns an LA to every cluster so that the number of actions is the same as that of nodes in the corresponding cluster. At each iteration, LAs select one node from their clusters. Then, the weight of the constructed generalized spanning tree is considered as a criterion for rewarding or penalizing the selected actions. The experimental results on a set of 20 benchmarks of TSPLIB demonstrate that the proposed approach is significantly faster than the other mentioned algorithms. The results indicate that the new algorithm is competitive in terms of solution quality.

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.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Akbari Torkestani J, Meybodi MR (2010a) An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata. Comput Netw 54(5):826–843

    Article  MATH  Google Scholar 

  • Akbari Torkestani J, Meybodi MR (2010b) Mobility-based multicast routing algorithm for wireless mobile Ad-hoc networks: a learning automata approach. Comput Commun 33(6):721–735

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  • BoussaïD I, Lepagnot J, Siarry P (2013) A survey on optimization metaheuristics. Inf Sci 237:82–117

    Article  MathSciNet  MATH  Google Scholar 

  • Contreras-Bolton C, Gatica G, Rey C, Parada V (2016) A multi-operator genetic algorithm for the generalized minimum spanning tree problem. Expert Syst Appl 50:1–8

    Article  Google Scholar 

  • Daliri Khomami MM, Rezvanian A, Bagherpour N, Meybodi MR (2018) Minimum positive influence dominating set and its application in influence maximization: a learning automata approach. Appl Intell 48(3):570–593

    Article  Google Scholar 

  • Di C, Li S, Li F, Qi K (2019) A novel framework for learning automata: a statistical hypothesis testing approach. IEEE Access 7:27911–27922

    Article  Google Scholar 

  • Dror M, Haouari M (2000) Generalized steiner problems and other variants. J Comb Optim 4(4):415–436

    Article  MathSciNet  MATH  Google Scholar 

  • Dua A, Sharma P, Ganju S, Jindal A, Aujla GS, Kumar N, Rodrigues JJ (2018) Rovan: a rough set-based scheme for cluster head selection in vehicular ad-hoc networks. In: 2018 IEEE global communications conference (GLOBECOM), IEEE, pp 206–212

  • Fahimi M, Ghasemi A (2017) A distributed learning automata scheme for spectrum management in self-organized cognitive radio network. IEEE Trans Mob Comput 16(6):1490–1501

    Article  Google Scholar 

  • Farman H, Jan B, Javed H, Ahmad N, Iqbal J, Arshad M, Ali S (2018) Multi-criteria based zone head selection in internet of things based wireless sensor networks. Future Gener Comput Syst 87:364–371

    Article  Google Scholar 

  • Ferreira CS, Ochi LS, Parada V, Uchoa E (2012) A GRASP-based approach to the generalized minimum spanning tree problem. Expert Syst Appl 39(3):3526–3536

    Article  Google Scholar 

  • García S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 special session on real parameter optimization. J Heurist 15(6):617–644

    Article  MATH  Google Scholar 

  • Ghavipour M, Meybodi MR (2016) An adaptive fuzzy recommender system based on learning automata. Electron Commer Res Appl 20:105–115

    Article  Google Scholar 

  • Ghavipour M, Meybodi MR (2018) Trust propagation algorithm based on learning automata for inferring local trust in online social networks. Knowl Based Syst 143:317–326

    Article  Google Scholar 

  • Golden B, Raghavan S, Stanojević D (2005) Heuristic search for the generalized minimum spanning tree problem. INFORMS J Comput 17(3):290–304

    Article  MathSciNet  MATH  Google Scholar 

  • Haouari M, Chaouachi JS (2006) Upper and lower bounding strategies for the generalized minimum spanning tree problem. Eur J Oper Res 171(2):632–647

    Article  MathSciNet  MATH  Google Scholar 

  • Hasanzadeh-Mofrad M, Rezvanian A (2018) Learning automata clustering. J Comput Sci 24:379–388

    Article  MathSciNet  Google Scholar 

  • Hu B, Leitner M, Raidl GR (2008) Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. J Heurist 14(5):473–499

    Article  MATH  Google Scholar 

  • Jiang W, Li B, Li S, Tang Y, Chen CLP (2016) A new prospective for learning automata: a machine learning approach. Neurocomputing 188:319–325

    Article  Google Scholar 

  • Krishna PV, Misra S, Nagaraju D, Saritha V, Obaidat MS (2016) Learning automata based decision making algorithm for task offloading in mobile cloud. In: IEEE CITS 2016—2016 international conference on computer, information and telecommunication systems

  • Kumar N, Misra S, Obaidat MS (2015) Collaborative learning automata-based routing for rescue operations in dense urban regions using vehicular sensor networks. IEEE Syst J 9(3):1081–1090

    Article  Google Scholar 

  • Misra S, Krishna PV, Kalaiselvan K, Saritha V, Obaidat MS (2014) Learning automata-based QoS framework for cloud IaaS. IEEE Trans Netw Serv Manag 11(1):15–24

    Article  Google Scholar 

  • Misra S, Venkata Krishna P, Saritha V, Agarwal H, Vasilakos AV, Obaidat MS (2017) Learning automata-based fault-tolerant system for dynamic autonomous unmanned vehicular networks. IEEE Syst J 11(4):1–10

    Article  Google Scholar 

  • Mollakhalili Meybodi MR, Meybodi MR (2014) Extended distributed learning automata: an automata-based framework for solving stochastic graph optimization problems. Appl Intell 41(3):923–940

    Article  Google Scholar 

  • Moradabadi B, Meybodi MR (2017) A novel time series link prediction method: learning automata approach. Physica A Stat Mech Its Appl 482:422–432

    Article  Google Scholar 

  • Moradabadi B, Meybodi MR (2018) Link prediction in weighted social networks using learning automata. Eng Appl Artif Intell 70(February):16–24

    Article  MATH  Google Scholar 

  • Mostafaei H (2015) Stochastic barrier coverage in wireless sensor networks based on distributed learning automata. Comput Commun 55:51–61

    Article  Google Scholar 

  • Mostafaei H, Meybodi MR (2013) Maximizing lifetime of target coverage in wireless sensor networks using learning automata. Wirel Pers Commun 71(2):1461–1477

    Article  Google Scholar 

  • Mostafaei H, Montieri A, Persico V, Pescapé A (2017) A sleep scheduling approach based on learning automata for WSN partial coverage. J Netw Comput Appl 80(December 2016):67–78

    Article  Google Scholar 

  • Mukherjee A, Keshary V, Pandya K, Dey N, Satapathy SC (2018) Flying ad hoc networks: a comprehensive survey. In: Information and decision sciences. Springer, pp 569–580

  • Myung Y-S, Lee C-H (1995) On the generalized minimum spanning tree problem. Networks 11(4):231–241

    Article  MathSciNet  MATH  Google Scholar 

  • Nettleton DF (2013) Data mining of social networks represented as graphs. Comput Sci Rev 7:1–34

    Article  MATH  Google Scholar 

  • Öncan T, Cordeau J-F, Laporte G (2008) A tabu search heuristic for the generalized minimum spanning tree problem. Eur J Oper Res 191(2):306–319

    Article  MATH  Google Scholar 

  • Park J-H, Choi S-C, Hussen HR, Kim J (2017) Analysis of dynamic cluster head selection for mission-oriented flying ad hoc network. In: 2017 ninth international conference on ubiquitous and future networks (ICUFN). IEEE, pp 21–23

  • Pop PC, Kern W, Still G (2006) A new relaxation method for the generalized minimum spanning tree problem. Eur J Oper Res 170(3):900–908

    Article  MathSciNet  MATH  Google Scholar 

  • Prabaharan G, Jayashri S (2019) Mobile cluster head selection using soft computing technique in wireless sensor network. Soft Comput 23(18):8525–8538

    Article  Google Scholar 

  • Ranjbari M, Akbari Torkestani J (2018) A learning automata-based algorithm for energy and SLA efficient consolidation of virtual machines in cloud data centers. J Parallel Distrib Comput 113:55–62

    Article  Google Scholar 

  • Rao PS, Jana PK, Banka H (2017) A particle swarm optimization based energy efficient cluster head selection algorithm for wireless sensor networks. Wirel Netw 23(7):2005–2020

    Article  Google Scholar 

  • Reddy MPK, Babu MR (2019) A hybrid cluster head selection model for internet of things. Clust Comput 22(6):13095–13107

    Google Scholar 

  • Ren J, Wu G, Su X, Cui G, Xia F, Obaidat MS (2018) Learning automata-based data aggregation tree construction framework for cyber-physical systems. IEEE Syst J 12(2):1467–1479

    Article  Google Scholar 

  • Rezvanian A, Meybodi MR (2015) Finding minimum vertex covering in stochastic graphs: a learning automata approach. Cybern Syst 46(8):698–727

    Article  MATH  Google Scholar 

  • Rezvanian A, Meybodi MR (2017) A new learning automata-based sampling algorithm for social networks. Int J Commun Syst 30(5):1–21

    Article  MATH  Google Scholar 

  • Sang Q, Lin Z, Acton ST (2016) Learning automata for image segmentation. Pattern Recognit Lett 74:46–52

    Article  Google Scholar 

  • Sengottuvelan P, Prasath N (2017) Bafsa: breeding artificial fish swarm algorithm for optimal cluster head selection in wireless sensor networks. Wirel Pers Commun 94(4):1979–1991

    Article  Google Scholar 

  • Shojafar M, Abolfazli S, Mostafaei H, Singhal M (2015) Improving channel assignment in multi-radio wireless mesh networks with learning automata. Wirel Pers Commun 82(1):61–80

    Article  Google Scholar 

  • Tang D, Liu X, Jiao Y, Yue Q (2011) A load balanced multiple cluster-heads routing protocol for wireless sensor networks. In: 2011 IEEE 13th international conference on communication technology. IEEE, pp 656–660

  • Tarabalka Y, Benediktsson JA, Chanussot J (2009) Spectral-spatial classification of hyperspectral imagery based on partitional clustering techniques. IEEE Trans Geosci Remote Sens 47(8):2973–2987

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Maybod Branch, Islamic Azad University, Maybod, Iran

    Masoumeh Zojaji, Mohammad Reza Mollakhalili Meybodi & Kamal Mirzaie

Authors
  1. Masoumeh Zojaji
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad Reza Mollakhalili Meybodi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kamal Mirzaie
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Masoumeh Zojaji.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zojaji, M., Meybodi, M.R.M. & Mirzaie, K. A rapid learning automata-based approach for generalized minimum spanning tree problem. J Comb Optim 40, 636–659 (2020). https://doi.org/10.1007/s10878-020-00605-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-020-00605-0

Keywords

Search

Navigation