The Coalition Partitioning Strategy Based on the Genetic Algorithm and Markov Random Walk Method

摘要

A kind of roadside terminal coalition partitioning strategy based on the improved genetic algorithm is proposed in this paper. This strategy overcomes the strict restrictions that in the Coalition Game Strategy (CGS), the union members need to contribute to all the coalition members in order to join in the coalition and also increases the contribution made by individual member to the specific or part of the coalition, fully considering the influence on the remaining members, The strategy avoids the disadvantage that the coalition partitioning strategy based on graph partition theory relies on the network topology to collaborate so cannot coordinate the cooperative relationship among the members flexibly, thus achieved the local search of the solution space effectively and also improved the average revenue for roadside terminal. The rationality and validity of the strategy were verified by a large number of experiments.