Degree-Constrained -Minimum Spanning Tree Problem

Algorithm 4

Embedded Q-learning code.

	Generate an initial random tuple of vertices. Let denote this set of vertices and its complement
	Execute Algorithm 2 using parameters
	Save the initial feasible solution found and its objective function value
	,
	, , , ,
	While () do
	For to do
	Interchange randomly an element of with an element of
	Set and run Algorithm 2 using parameters
	If (a better solution is obtained) then
	Save the new solution and set , ,
	, ,
	Else
	,
	If () then
	If () then
	Else