I have an urgent question about the travelling salesman problem.
I have to find four optimal solutions to the travelling salesman problem for 5 cities with given co-ordinates, using 12 randomly generated numbers found with the Linear Congruental Method. I have generated the 12 numbers but then don't know what to do next.
The question says something about using the Monte Carlo method but I don't know how to do that. Any help would be much appreciated! Thanks!