基于粒计算的双权网络分层算法

Double weighted hierarchical network algorithm based on granular computing

复杂网络环境下数据分布优化问题是个NP问题,但由于大多复杂网络有层次性特征,在此情形下可降低优化问题计算复杂性。应用粒计算理论提出了一种双权分层网络数据分布优化模型和算法,将双权复杂网络映射成一个分层网络,在分层网络上计算数据优化解。算法的时间复杂度为O(C×n2)。仿真实验表明,算法能够得到数据分布优化的满意解,且可通过调整子网络的粒度达到实际应用的需求。

The data distribution optimization problem is a NP hard problem in a complex network.But the most complex net-works can be mapped into hierarchical networks,so that the computational complexity can be reduced.This paper proposes a double weighted hierarchical network model and algorithm based on granular computing theory.This algorithm maps the gen-eral double weighted complex network into the double weighted hierarchical network,and the optimal solution of data distri-bution can be solved in the hierarchical network.The algorithm time complexity is O（C×n2）.And the simulation results show that the algorithm can obtain satisfactory solution by adjusting the sub-networks’s particle size.