Two coding based adaptive parallel co-genetic algorithm with double agents structure

This paper systematically proposed a multi-population agent co-genetic algorithm with double chain-like agent structure (MPATCGA) to solve the problem of the low optimization precision and long optimization time of simple genetic algorithm in terms of two coding strategy. This algorithm adopted multi-population parallel searching mode, close chain-like agent structure, cycle chain-like agent structure, dynamic neighborhood competition, and improved crossover strategy to realize parallel optimization, and has the characteristics of high optimization precision and short optimization time. Besides, the size of each sub-population is adaptive. The characteristic is very competitive when dealing with imbalanced workload. In order to verify the optimization precision of this algorithm with binary coding, some popular benchmark test functions were used for comparing this algorithm and a popular agent genetic algorithm (MAGA). The experimental results show that MPATCGA has higher optimization precision and shorter optimization time than MAGA. Besides, in order to show the optimization performance of MPATCGA with real coding, the authors used it for feature selection problems as optimization algorithm and compared it with some other well-known GAs. The experimental results show that MPATCGA has higher optimization precision (feature selection precision). In order to show the performance of the adaptability of size of sub-populations, MPATCGA with sub-populations with same size and MPATCGA with sub-populations with different size are compared. The experimental results show that when the workload on different sub-populations becomes not same, the adaptability will adaptively change the size of different sub-population to obtain precision as high as possible.