Intelligent dynamic programming for the generalised travelling salesman problem

We develop a method based on the simulated annealing and genetic algorithms to solve the travelling salesman problem (TSP) and the generalised TSP (GTSP) problem. These two problems are known to be NP-hard. The GTSP exist in many application fields.