A Hybrid Cellular Genetic Algorithm for the Traveling Salesman Problem

Algorithm 8

The pseudocode of the hybrid cellular genetic algorithm (SCGA) for solving TSP.

The hybrid cellular genetic algorithm (SCGA) for solving TSP
	Begin
	Input: city coordinates: , . Pc, Pm, r, T0, Num,
	Num. C, Maxiter, L, Tt
	Initialization: using ordinal coding to generate randomly the initial population as cellular space, generate randomly an n-th order square matrix N composed of 0 and 1 as state matrix, number of iteration k = 1
	while k ≤ Maxiter
	for i = 1 to n^2
	if
	Genetic operations
	Elitist strategy
	End if
	Save the optimal result in the iteration
	End for
	k = k +1
	End while
	Output: the optimal result:
	End