2
votes
Can neural networks efficiently solve the traveling salesmen problem?
There is some recent work addressing this issue, to learn the conditional probability of an output sequence with elements that are discrete tokens corresponding to positions in an input sequence. See ...
- 364
2
votes
Accepted
Can neural networks efficiently solve the traveling salesmen problem?
To the best of my knowledge, there isn't any difference between the algorithmic methods and the NN methods. Those that can solve in polynomial time do not give a precise solution. Those that do give a ...
- 281
2
votes
Is there a crossover that also considers that every index in the vector also influences the fitness function?
Really you're entering the world in which you probably want to develop genetic operators that have meaning in your domain. You mention TSP, and correctly point out that the absolute position within ...
- 611
1
vote
Accepted
How could we solve the TSP using a hill-climbing approach?
I will give you a basic idea of an approach.
The basic idea behind hill climbing algorithms is to find local neighbouring solutions to the current one and, eventually, replace the current one with ...
- 41.4k
Only top scored, non community-wiki answers of a minimum length are eligible