0
The initial result is taken from an Ant Colony Optimization algorithm, and is introduced to the heuristic in this form:
path = [(12, 7), (7, 10), (10, 21), (21, 13), (13, 0), \
(0, 11), (11, 14), (14, 15), (15, 2), (2, 17), \
(17, 16), (16, 1), (1, 3), (3, 6), (6, 4), (4, 5), \
...