Augment Greedy Local Search on TSP with Ideas From Tabu Search Paradigm
Maintain set L of all points visited.
At each step, move to neighboring point of lower cost that is not in L, if one exists.
Otherwise move to neighbor of higher cost that is in L.
If get to situation where all neighbors of current position in L, start afresh from random solution.