A Hybrid Cellular Genetic Algorithm for the Traveling Salesman Problem

Table 1

Central cell and neighbors.

Cell	Route	Distance	Cell	Route	Distance	Cell	Route	Distance
K	3 4 6 9 7 1 8 10 2 5	316.0711	U	6 2 4 8 9 3 1 5 7 10	344.9062	AE	7 8 1 9 3 5 10 4 2 6	244.1511
L	8 9 4 6 10 5 2 7 1 3	262.5791	V	4 3 2 7 10 6 8 1 5 9	290.6597	AF	2 3 8 4 6 10 9 7 5 1	267.6944
M	4 8 12 7 3 9 10 6 5	260.2487	W	2 4 8 5 7 3 6 1 9 10	299.5755	AG	1 10 4 8 6 5 7 2 9 3	288.2223