Hi guys I've got a quesiton regarding Travelling salesman problem using Tabu search algorithm. Lets say I've got a map (X axis and Y axis) with 9 points. My goal is to find shortest path while travelling through all the points. The starting point is given.
Do i understand correctly, that the algorith at first try random path using Djikstra algorithm and with each iteration it flags bad moves (tabu) to be better optimalized in next iteration? Thanks in advance