Aiming at the problems of single algorithm,being prone to local optima,and weak generalization ability of the current strategies,based on an improved differential evolutionary algorithm,a chaos algorithm,an adaptive variational crossover algorithm,and a problem solution processing mechanism,a time slot allocation strategy is proposed.The chaos algorithm is used to initialize the population to increase the diversity and avoid the premature convergence.The selection probability parameter is then used to make the crossover and variation process more flexible,expanding the search range in early to increase the possibility of global optima in late.The experiment results show that the proposed algorithm outperforms the difference algorithm and genetic algorithm in all four indicators of time slot allocation balance,stability,algorithm efficiency,and generalization ability.The proposed algorithm achieves higher time slot allocation balance and algorithm efficiency,better stability,and stronger generalization ability.
关键词
战术数据链/时隙分配/差分进化算法/混沌映射/时隙方差
Key words
tactical data link/slot allocation/differential evolution algorithm/chaotic mapping/time slot variance
维普
万方数据