Advertisement

Parallel Combination of Genetic Algorithm and Ant Algorithm Based on Dynamic K-Means Cluster

  • Jianli Ding
  • Wansheng Tang
  • Liuqing Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4114)

Abstract

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.

Keywords

Satisfactory Solution Parallel Combination Divided Area Dual Challenge Connection Chain 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jianli Ding
    • 1
    • 2
  • Wansheng Tang
    • 1
  • Liuqing Wang
    • 1
  1. 1.Institute of Systems Engineering, Tianjin University, Tianjin 300072China
  2. 2.Tianjin Key Lab for Advanced Signal Processing, Civil Aviation University of China, Tianjin 300300China

Personalised recommendations