Research Article
Novel Degree Constrained Minimum Spanning Tree Algorithm Based on an Improved Multicolony Ant Algorithm
| AntsMove() | | begin | | for to maxSteps do | | if mod updatePeriod = 0 then | | UpdatePheromone() | | foreach do | | Attempts | | moved False | | while not moved and Attempts < 5 do | | ⋅location | | Select an edge () at random and proportional to ()⋅phm | | if ⋅tabuList then | | add into ⋅tabuList | | ⋅location | | ()⋅Visited++ | | moved ← True | | else Attempts++ | | Calculation Entropy of the current colony |
|
