A Colored Traveling Salesman Problem with Varying City Colors

Algorithm 1

Best population immigrant scheme.

(1)	Begin
(2)	Input: , k = 0;
(3)	Rank the ps solutions from small to large, where is the smallest one and is the largest one. .
(4)	While () do
(5)	l = random (1, m);
(6)	Do 2-opt for Rl in ,.
(7)	.
(8)	k++;
(9)	End While
(10)	Output:
(11)	End