Degree-Constrained -Minimum Spanning Tree Problem

Algorithm 7

Pure Q-learning-based approach for the DCMST problem.

	Data: an instance of the DCMST problem using degree .
	Result: a feasible solution and its objective function value.
	Step 1
	Initialize parameters , ,
	, , , , ,
	Step 2
	While () do
	Construct a unique tour
	Randomly choose a node
	, ,
	For to do
	Ifthen
	Randomly choose a node
	Else
	,
	Ifthen
	Find best solution
	Denote by the length of consecutive nodes in starting from node
	Compute
	If () then
	Set and save the best tour of length in
	, ,
	Return best feasible solution found and its objective function value