Solve and compare travelling salesman problem (TSP) with metaheuristic algorithms Dynamic programming and Three Metaheuristic algorithms have been used to solve this problem. hill climbing, simulated annealing and genetic algorithm.
Sadegh Bagherzadeh