Many actual project problems generally belong to large-scale TSP, The large-scale TSP as a famous NP-hard problem will be faced with the dual challenges of the optimization performance and the CPU run-time performance for any single algorithm. In fact, the optimal solution is not pursued overwhelmingly in actual projects, but it needs to meet certain optimization efficiency. This paper reduces the problem’s complexity based on the idea of “divide and rule”. We use the method of K-Means cluster to divide the nearest neighbor quickly. Then, we employ parallel computing method to all divided areas by using combination of genetic algorithm and ant algorithm (GAAA). Finally, we globally link all the subsets using the method of K centers connect. The results of simulations show that its complexity has been greatly reduced and we can quickly obtain a satisfactory solution to the large-scale problem. It is one effective way to solve the large-scale complex problems.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
- Parallel Combination of Genetic Algorithm and Ant Algorithm Based on Dynamic K-Means Cluster
Neuer Inhalt/© ITandMEDIA