A Colored Traveling Salesman Problem with Varying City Colors

Algorithm 2

Dynamic Environment.

(1)	Begin
(2)	Input: gen;
(3)	If gen = = 1
(4)
(5)	Else
(6)	If
(7)	a = random(0,1)
(8)	If
(9)
(10)	Else
(11)
(12)	End If
(13)	End If
(14)	End If
(15)	Output:.
(16)	End