I'm currently working on TSP which has been given to me as my end of year project in my computer science course.
In this problem we are given a list of the top 1000 colleges in the world. Then starting at our own colleges, we have to travel to all the other colleges once and make it back to ours. But we are only allowed to travel to colleges that are within 100 rank of college that you are currently at, with no wraparound at either ends of the list.
I tried to approach it using nearest neighbour but I kept on running to a problem where my code would get stuck at a certain university because it would have already travelled to all the other colleges within 100 rank of it. I am now currently trying to use a genetic algorithm to solve it but I'm running into some issues.
Is there any other algorithm that would be good for this problem that I could use in the meantime while trying to fix my genetic algorithm?