【人工智能導論】遺傳算法求解TSP問題

Symmetric traveling salesman problem (TSP) Given a set of n nodes and distances for each pair of nodes, find a roundtrip of minimal total length visiting each node exactly once. The distance from node

>>阅读原文<<