单向限量最速网络消息传播模型及其进化算法

Fastest network message one-way spreading model with bounds of transitive messages and its evolutionary algorithm

提出了单向限量式最速网络消息传播问题,建立了该问题的数学模型,并给出了相应的模拟进化求解算法.通过分析单向限量式最速网络消息传播问题的特征,包括决策变量的特点、决策的网络时空影响特殊模式及网络消息分布状态特点,构建了问题的最优化模型.利用决策变量的二元取值特点和单一轮次信息交互模式的相对独立性,设计了操作灵活的遗传算法的复制、交叉和变异算子,实现了模型的模拟进化求解.数值算例验证了模型和算法的有效性.最后总结了最速网络消息传播问题的主要可扩展研究方向.

The fastest network message one-way spreading problem with bounds of transitive messages was introduced.The problem was formulated with strict mathematics.The corresponding simulated evolutionary algorithm was provided.Through analysing the characteristics of the problem,induding the features of decision variables,the special pattern of the spatial and temporal impacts of decision-makings and the distribution features of network messages,the optimization model of the problem was built.Taking advantage of the binary feature of decision variables and the relative independence of the pattern of single round information interchanging,the reproduction operator,the crossover operator and the mutation operator of genetic algorithm were designed,that can be manipulated flexibly.So the simulated evolutionary solution of the model was achieved.The numerical example demonstrates the effectiveness of the model and the algorithm.The main extensible research directions with regard to the problem were summed up.