Timeline for The fastest algorithm for asymmetric travelling salesman problem (TSP)
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 12, 2011 at 5:50 | comment | added | igor | @Zach Langley, @Dukes No problem, agree, no one algorithm can resolve this problem in controled, predictable time. Can I use genetic algorithm to ASYMMETRIC TSP? How should I input A -> B and B' -> A' data (they have different distances) to calculate by using this algorithm? | |
| Apr 12, 2011 at 0:41 | comment | added | Zach Langley | It sounds like @igor is looking for exact algorithms, and as I understand it, genetic algorithms for the TSP are heuristics that work via randomized improvement. Also, how do you justify that a genetic algorithm will be the fastest? | |
| Apr 11, 2011 at 23:31 | history | answered | Dukes | CC BY-SA 3.0 |