Fastest network message spreading problem and its simulated evolutionary algorithm
Shengxue He · Jisuanji yingyong yanjiu · 2011
For the first time,this paper proposed the class of fastest network message spreading problems.Formulated the ba-sic problem of the class in strict mathematics.Provided the corresponding simulated evolutionary algorithm.Through analysing the characteristics of the basic fastest network message spreading problem that including the features of decision variables,the special pattern of the spatial and temporal impacts of decision-makings and the distribution features of network messages,built the optimal model of the problem.Analysed the extendibility of the model.Taking advantage of the binary feature of decision variables and the relative independence of the pattern of single round information interchanging,designed the reproduction operator,the crossover operator and the mutation operator of genetic algorithm that could be manipulated flexibly.So realized the simulated evolutionary solving of the model.The numerical example demonstrates the effectiveness of the model and the algorithm.The results show that the basic model of fastest network message spreading problems has strong extendibility and genetic algorithm is an effective way to solve these problems.