Novel Degree Constrained Minimum Spanning Tree Algorithm Based on an Improved Multicolony Ant Algorithm

Table 2

Parameters	Values	Notes
	100	Maximum number of iterations
	30	Maximum iterations without improvement
maxSteps	75	Number of steps that an ant traverses each iteration
Candidates		Candidate set cardinality
	0.5	Initial pheromone evaporation factor
	1.5	Initial pheromone enhancement factor
updatePeriod	maxSteps/3	Pheromone update period
	10	Number of iterations without improvement before escaping