CAJ | 학술논문

由于涉及许多变量和约束,中压配电网规划是一个非常复杂的大规模组合优化问题.蚁群算法是一种具有正反馈特性的贪婪性、分布式的现代启发式搜索方法,适合于路径的寻优,但是易陷入局部最优.该文将蚁群算法和生成树算法结合起来,用于带有交叉点的中压配电网网架规划.针对基本蚁群算法易于陷入局部最优的问题,提出了动态设定待选路径信息素阀值和动态调整路径选择策略的方法,以便提高蚁群算法的全局搜索能力.在考虑中压配电网辐射状和连通性约束时,提出了带有交叉点的生成树方法,大大减少了在规划中不可行解的产生.算例仿真结果表明采用该方法求解中压配电网架规划方案是有效的.
유우섭급허다변량화약속,중압배전망규화시일개비상복잡적대규모조합우화문제.의군산법시일충구유정반궤특성적탐람성、분포식적현대계발식수색방법,괄합우로경적심우,단시역함입국부최우.해문장의군산법화생성수산법결합기래,용우대유교차점적중압배전망망가규화.침대기본의군산법역우함입국부최우적문제,제출료동태설정대선로경신식소벌치화동태조정로경선택책략적방법,이편제고의군산법적전국수색능력.재고필중압배전망복사상화련통성약속시,제출료대유교차점적생성수방법,대대감소료재규화중불가행해적산생.산례방진결과표명채용해방법구해중압배전망가규화방안시유효적.
@@@@At present there are a lot of literatures referring to transmission network planning, but less about medium-voltage distribution network planning, especially for the network with cross-points of line corridors. Ant colony optimization (ACO) is a heuristic algorithm with positive feedback, distributed computation and greedy characteristic. It is very suitable to search optimal path in a graph but prone to fall into local optimum. @@@@This paper integrates ACO with spanning tree algorithm to solve medium-voltage distribution network planning with cross-points. The model of medium-voltage distribution network planning is established, which takes the minimum investment cost of expansion lines and minimum energy loss as objective functions, power flow balance as equality constraints, and maximum line current, upper and lower limit of node voltage as inequality constraints. Meanwhile,the network topology graph is radial and connected. The dynamic pheromone threshold of candidate paths and dynamic adjustment of path selection strategy are introduced in order to reduce the possibility of falling into local optimum in general ACO. According to the maximum iteration number, the current iteration number and the maximum pheromone value of all paths in the current iteration, the dynamic pheromone threshold of the candidate paths is given,which can ensure that the difference between the pheromones of the paths is as small as possible to increase the diversity of solutions at the early search stage, and the difference between the pheromones of the paths is as large as possible to speed up the algorithm convergence at the later search stage. The probability to be selected of one candidate path is decided by its length,investment and pheromone quantity. The shorter length, the smaller investment and the more pheromone can make the greater opportunity to be chosen. The dynamic adjustment of path selection strategy can help the search process tend to minimal objective function. Considering the radiation and connectivity constraints in medium-voltage distribution network, spanning tree algorithm with cross-points is proposed. Taking the power source and load points as the vertices of the graph, the spanning tree is produced by using depth-first search algorithm. Then the journey of each ant as a spanning tree is limited to a radial and connected grid, so infeasible solutions reduce greatly. After forming the path of one ant, do delete cross-point on path and its associated branches tentatively. If the deleted graph is disconnected, then retain the cross-point point and its associated branches, otherwise, remove the cross-point. @@@@To examine this method’s practical applicability, a practical 10 kV distribution line is used as an example for an empirical research. Simulation results demonstrate that the proposed method is feasible and effective for medium-voltage distribution network planning with cross-points. The dynamic pheromone threshold setting of candidate paths and dynamic adjustment of path selection strategy can improve the global search capability of ACO. The spanning tree algorithm can guarantee the radiation and connectivity of grid with cross-points, then the number of feasible solution increases greatly.