Recently, we can get ready for large-scale computing environments such as PC-cluster as a low price. Hereby, some parallelized optimization algorithms are proposed. By now, we have proposed a co-evolutionary immune algorithm (IA) to solve the division-of-labor problems, in particular n-th agent's Travelling Salesman Problem (n-TSP). In this paper, we extend the co-evolutionary IA for large-scale n-TSP with (1) the improvement for the search speed through parallelized search on the PC-cluster, and (2) the introduction of a new division-processing "pre-estimated division processing" to improve the search ability.
展开▼
