在公共信息模型(CIM)扩展的配电网模型基础上构建了组合式迭代器以实现系统级元件遍历。讨论了实际配电网规划普遍存在的多交叉点的情况,运用改进的基于关键节点最小代价多播路由算法建立配电网规划模型,提出了组合边的概念,以组合边的形式参与边的动态迭代,获得总体费用最小的优化规划结果。以迭代器隔离算法和数据,降低耦合度并增强稳定性和可拓展性。算例表明了文中方法的有效性。
In order to traverse all the distribution elements,a composite iterator is formulated based on the distribution network model using the extended common information model(CIM) scheme.In consideration of the presence of many junctions in planning the distribution network in practice,a discussion is made of the development of an improved key nodes based multicast routing algorithm at minimum path cost for solving this problem.The concept of composite-edge is put forward by adjusting the weights of each composite-edge dynamically and the optimal planning result of minimum total cost is obtained.Algorithm and data models are isolated by the iterator,which can effectively reduce the coupling and enhance the maintainability and extensibility.Numerical example results show the feasibility of the distribution planning method proposed.