Learning automata with changing number of actions
IEEE Transactions on Systems, Man and Cybernetics
Learning automata: an introduction
Learning automata: an introduction
Transitions in geometric minimum spanning trees
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Approximate solution of NP optimization problems
Theoretical Computer Science
Computers and Operations Research
An iterative algorithm for delay-constrained minimum-cost multicasting
IEEE/ACM Transactions on Networking (TON)
A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Variable neighborhood search for the degree-constrained minimum spanning tree problem
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree
Journal of Heuristics
The Delay-Constrained Minimum Spanning Tree Problem
ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
ICCIMA '03 Proceedings of the 5th International Conference on Computational Intelligence and Multimedia Applications
An ant-based algorithm for finding degree-constrained minimum spanning tree
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Design of capacitated minimum spanning tree with uncertain cost and demand parameters
Information Sciences: an International Journal
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
Computers and Operations Research
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Using Lagrangian dual information to generate degree constrained spanning trees
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
A forest representation for evolutionary algorithms applied to network design
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Mathematical Programming: Series A and B
An ant colony optimization approach to the degree-constrained minimum spanning tree problem
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Finding minimum weight connected dominating set in stochastic graph based on learning automata
Information Sciences: an International Journal
A new evolutionary approach to the degree-constrained minimumspanning tree problem
IEEE Transactions on Evolutionary Computation
Mobility prediction in mobile wireless networks
Journal of Network and Computer Applications
A distributed resource discovery algorithm for P2P grids
Journal of Network and Computer Applications
A new approach to the job scheduling problem in computational grids
Cluster Computing
An adaptive learning automata-based ranking function discovery algorithm
Journal of Intelligent Information Systems
An adaptive learning to rank algorithm: Learning automata approach
Decision Support Systems
A NEW DISTRIBUTED JOB SCHEDULING ALGORITHM FOR GRID SYSTEMS
Cybernetics and Systems
LAAP: A Learning Automata-based Adaptive Polling Scheme for Clustered Wireless Ad-Hoc Networks
Wireless Personal Communications: An International Journal
An energy-efficient topology construction algorithm for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-efficient backbone formation in wireless sensor networks
Computers and Electrical Engineering
| Hi-index | 0.00 |
Degree-constrained minimum spanning tree problem is an NP-hard bicriteria combinatorial optimization problem seeking for the minimum weight spanning tree subject to an additional degree constraint on graph vertices. Due to the NP-hardness of the problem, heuristics are more promising approaches to find a near optimal solution in a reasonable time. This paper proposes a decentralized learning automata-based heuristic called LACT for approximating the DCMST problem. LACT is an iterative algorithm, and at each iteration a degree-constrained spanning tree is randomly constructed. Each vertex selects one of its incident edges and rewards it if its weight is not greater than the minimum weight seen so far and penalizes it otherwise. Therefore, the vertices learn how to locally connect them to the degree-constrained spanning tree through the minimum weight edge subject to the degree constraint. Based on the martingale theorem, the convergence of the proposed algorithm to the optimal solution is proved. Several simulation experiments are performed to examine the performance of the proposed algorithm on well-known Euclidean and non-Euclidean hard-to-solve problem instances. The obtained results are compared with those of best-known algorithms in terms of the solution quality and running time. From the results, it is observed that the proposed algorithm significantly outperforms the existing method.