考虑地理信息城市配网规划模型和算法研究
|
摘要
随着城市的发展,在市中心、商业闹市区等对道路景观要求较高的地段,常常采用电缆供电进行配网规划。相比架空线供电的配网规划,电缆的采用将带来敷设方式的选择、电缆分支箱的设置等一系列新问题。同时,考虑实际电网中线路沿街道布置的特点,在地理图中需增加街道交叉点。街道交叉点的引入将出现电气走廊不定、电气分支点随机产生等新情况。因此,对考虑街道地理信息并采用全电缆的配网规划进行深入研究,具有十分重要的理论和实际意义。针对上述规划问题,论文建立了两种新模型,并提出了求解模型的遗传算法。概括起来,主要工作包括以下几部分:
①以采用全电缆的城市新建供电区配网网架规划为研究对象,建立了一种详细考虑街道地理信息的多电源配网规划新模型。该模型以综合费用最小为目标。在计算投资费用时,明确区分了电气走廊的土建费用和电气费用。在进行电网布线时,允许负荷任意选择电源和线路走廊,允许任意产生新的电气分支点。相对常规模型而言,新模型在投资费用的计算、线路走廊的选择和电气分支点的变化方面更加符合实际。
②论文提出了一种考虑电缆分支箱位置和成本影响的单电源配网规划新模型。该模型在计算投资费用时,增加了电源(开闭所)的出线开关柜费用和分支箱费用。在网架的形成和修改过程中,允许分支箱的个数、位置、所带负荷、线路走廊以及电气连接随机变化。相对现有模型,论文模型更加实用有效。
③论文提出了求解上述两种新模型的遗传算法。其中,采用了包括节点、支路、线路和电源在内的多信息矩阵级联编码方法来实现个体的染色体编码,以方便电网地理信息和电气信息的动态修改、查询和统计,并能有效处理各种约束和确定个体适应度。根据新模型的特点,采用了边重组交叉策略和多种变异策略,包括支路最短路径替换、末端负荷转移、分支箱所带负荷、分支箱个数、分支箱位置以及支路走廊变异,以兼顾随机个体的多样性和最优性,并有利于满足个体的可行性。
④分别以某城市的实际配网规划系统为例进行了仿真分析,仿真结果验证了论文模型和算法的有效性。
With the development of city, the cables are used frequently in distribution network planning (DNP) of some areas with high request of load sight, such as the city centre, shopping centre, etc. Compared with DNP of using overhead lines, the usage of cables will bring a series of new problems including the choice of laying modes and the setting of cable branch boxes. Since the distribution lines are built along the streets, the street segmenting points should be added on the map, which may make the electric corridors along the streets uncertained and the electric branch nodes on the feeder random. Therefore, the further research of DNP of using cables with consideration of street geographic information is of important theoretical and practical significance. Two new models and Genetic Algorithm (GA) for them are proposed. The research mainly includes following parts:
①For DNP of new urban power supply area with wholly cables, a new model for multi-source planning of distribution network is proposed with the detailed consideration of street geographic information. The proposed model takes the integrated investment as objective function. As regards the network investment, the civil construction and electrical costs of the electric corridors are calculated separately. In the process of configuring the network, sources and electric corridors along the streets can be selected randomly for any load, and any new electric branch nodes on the feeder can also be produced if necessary. In contrast with conventional models, the proposed model is more practical in calculating investment, determining electric corridors and producing new electric branch nodes.
②The model for single-source planning of distribution network is developed considering location and costs of cable branch boxes. The costs of outlet switch cabinets in switching station and cable branch boxes are added to the investment. In the process of configuring or modifying the network, the quantity and location of cable branch boxes, the loads supplied by cable switch boxes, electric corridors along the streets and electric connection can be selected randomly. In contrast with existing models,the new model is more practical and more efficient.
③GA for the new models is proposed. In GA, a multi-information matrix encoding strategy is adopted, which is composed of node, branch, line, and source matrix, in order that the geographic and electric information of network can be easily modified, inquired and counted, the constraints can be effectivly dealt with and the fitness of individuals can be correctly determined. Taking advantage of the feature of the new models, edge recombination crossover strategy and different mutation strategies are adopted to give consideration to diversity and optimality of individuals, and help to realize feasibility of individuals. The mutation strategies include shortest path substitution, load node transfer, loads of cable branch boxes transfer, quantity and location of cable switch cabinet variation and electric corridors along the streets transfer.
④Two actual urban medium-voltage distribution network planning systems are simulated and the validity of the proposed models and algorithms are illustrated.
①以采用全电缆的城市新建供电区配网网架规划为研究对象,建立了一种详细考虑街道地理信息的多电源配网规划新模型。该模型以综合费用最小为目标。在计算投资费用时,明确区分了电气走廊的土建费用和电气费用。在进行电网布线时,允许负荷任意选择电源和线路走廊,允许任意产生新的电气分支点。相对常规模型而言,新模型在投资费用的计算、线路走廊的选择和电气分支点的变化方面更加符合实际。
②论文提出了一种考虑电缆分支箱位置和成本影响的单电源配网规划新模型。该模型在计算投资费用时,增加了电源(开闭所)的出线开关柜费用和分支箱费用。在网架的形成和修改过程中,允许分支箱的个数、位置、所带负荷、线路走廊以及电气连接随机变化。相对现有模型,论文模型更加实用有效。
③论文提出了求解上述两种新模型的遗传算法。其中,采用了包括节点、支路、线路和电源在内的多信息矩阵级联编码方法来实现个体的染色体编码,以方便电网地理信息和电气信息的动态修改、查询和统计,并能有效处理各种约束和确定个体适应度。根据新模型的特点,采用了边重组交叉策略和多种变异策略,包括支路最短路径替换、末端负荷转移、分支箱所带负荷、分支箱个数、分支箱位置以及支路走廊变异,以兼顾随机个体的多样性和最优性,并有利于满足个体的可行性。
④分别以某城市的实际配网规划系统为例进行了仿真分析,仿真结果验证了论文模型和算法的有效性。
With the development of city, the cables are used frequently in distribution network planning (DNP) of some areas with high request of load sight, such as the city centre, shopping centre, etc. Compared with DNP of using overhead lines, the usage of cables will bring a series of new problems including the choice of laying modes and the setting of cable branch boxes. Since the distribution lines are built along the streets, the street segmenting points should be added on the map, which may make the electric corridors along the streets uncertained and the electric branch nodes on the feeder random. Therefore, the further research of DNP of using cables with consideration of street geographic information is of important theoretical and practical significance. Two new models and Genetic Algorithm (GA) for them are proposed. The research mainly includes following parts:
①For DNP of new urban power supply area with wholly cables, a new model for multi-source planning of distribution network is proposed with the detailed consideration of street geographic information. The proposed model takes the integrated investment as objective function. As regards the network investment, the civil construction and electrical costs of the electric corridors are calculated separately. In the process of configuring the network, sources and electric corridors along the streets can be selected randomly for any load, and any new electric branch nodes on the feeder can also be produced if necessary. In contrast with conventional models, the proposed model is more practical in calculating investment, determining electric corridors and producing new electric branch nodes.
②The model for single-source planning of distribution network is developed considering location and costs of cable branch boxes. The costs of outlet switch cabinets in switching station and cable branch boxes are added to the investment. In the process of configuring or modifying the network, the quantity and location of cable branch boxes, the loads supplied by cable switch boxes, electric corridors along the streets and electric connection can be selected randomly. In contrast with existing models,the new model is more practical and more efficient.
③GA for the new models is proposed. In GA, a multi-information matrix encoding strategy is adopted, which is composed of node, branch, line, and source matrix, in order that the geographic and electric information of network can be easily modified, inquired and counted, the constraints can be effectivly dealt with and the fitness of individuals can be correctly determined. Taking advantage of the feature of the new models, edge recombination crossover strategy and different mutation strategies are adopted to give consideration to diversity and optimality of individuals, and help to realize feasibility of individuals. The mutation strategies include shortest path substitution, load node transfer, loads of cable branch boxes transfer, quantity and location of cable switch cabinet variation and electric corridors along the streets transfer.
④Two actual urban medium-voltage distribution network planning systems are simulated and the validity of the proposed models and algorithms are illustrated.
引文
[1]城乡建设环境保护部,城市电力网规划设计导则[S]. 1985,5.
[2]中华人民共和国建设部,城市电力规划规范GB50293—1999[S]. 1999,6.
[3]陈章潮,唐德光.城市电网规划与改造[M].北京:中国电力出版社,1998.
[4] El-Kady M.A.. Computer-aided planning of distribution substation and primary feeders[J]. IEEE Trans.on PWS,1984,103(6):1183-1189.
[5]杨苏.城市配电网优化规划模型和算法的研究及其实现.硕士学位论文. 2004.
[6]杨丽徙等.各规划水平年间网络改造方案的优化方法[J].电力自动化设备,2001(1):33-34.
[7]于平洋.配电系统规划中的若干重要问题[J].电网技术,2001(5):1-5.
[8]韩富春,董青松,实用城市配电网优化规划模型[J].中国电力,1998(4):39-42.
[9] Khator S K,Leung L C. Power distribution planning a review of models and issue[J]:1151-1159.
[10]倪秋龙,黄民翔.用逐步线性化网络流算法进行配电网络规划[J].电力系统及其自动化学报,2000(3):31-35.
[11]杨明皓.配电系统可靠性实用计算方法和计及供电可靠性的配电网络规划[D].硕士学位论文. 1986.
[12]许跃进.城市电力网综合规划研究[D].硕士学位论文. 1987.
[13]谭琼等.网络规划在城市电力网网架结构设计中的应用[J].湖南大学学报(增刊),1995(5).
[14] J.T. Boardman, C. C. neckiff. A Branch and Bound Formulation to electricity Distribution Planning Problem[J]. IEEE Trans PAS. 1985,104(8):2112-2118.
[15]孙洪波.电力网络规划[M].重庆:重庆大学出版社,1996.
[16] Albuyeh F, James J S. A Transmission Network Planning Method For Comparative Studies[M]. IEEE Trans. on PAS, 1982.
[17] EI-Sobkl S M,EI-Melual1y M. New Approach for Planning High-Voltage Transmission Network[J]. IEE Proc. 1986,133(5):256-262.
[18] Aoki.K.Nara, K.Satoh.T. New Approximate Optimization Method for Distribution Systems Planning[J]. IEEE Trans Power Systems,1990:126-132.
[19]韩富春,赵铭凯,刘亚新.城市电网规划方法研究[J].电力系统自动化,1994(11):57-62.
[20]王东平,黄山.基于启发式的地方电网结构规划及其应用[J].电力系统自动化,2002(2) :64-65.
[21] Aoki.K.Nara, K.Satoh.T. Mufti-Year Expasion Planning for Distribution Systems[J]. IEEE Trans Power Systems,1991:952-958.
[22] S.K.Goswami: Distribution System Planning Using Branch Exchange Techniques[J]. IEEE TransPower Systems,1997:718-723.
[23] Hsu.Y.Y,Chen.J.L. Distribution Planning Using Knowledge-Based Expert System[J]. IEEE Trans Power Systems,1990:1514-1519.
[24] Colorni A,Dorigo M, Maniezzo V. Distributed optimization by ant Colonies [A]. Proceeding of ECAL91-European Conference on Artificial Li life[C]Paris, 1991:134-142.
[25]王锡凡.电力系统优化规划(第一版) [M].北京:水利电力出版社,1990.
[26]陈根军,唐国庆.基于禁忌搜索与蚁群最优结合算法的配电网规划[J].电网技术,2005,29(2):23-27.
[27]王志刚,杨丽徒,陈根永.基于蚁群算法的配电网网架优化规划方法[J].电力系统及其自动化学报,2002,14(6):73-76.
[28]赵强,敬东,李正.蚁群算法在配电网规划中的应用[J].电力自动化设备,2002,23(2):52-54.
[29] R Romer,R A Gallego A Monticelli. Transmission System Expansion Planning by Simulated Annealing[J]. IEEE Transactions on Power Systems, 1996,11(1):364-369.
[30]刘宝靛,赵瑞清.随机规划与模糊规划[M].北京:清华大学出版社,1998.
[31]陈章潮,顾洁,孙纯军.改进的混合模拟退火法-遗传算法应用于电网规划[J].电力系统自动化,1999(10):21-29.
[32]刘晓飞,彭建春,高效,陈景怀,卜永红.基于单亲遗传算法的配电网络规划[J].电网技术,2002(2):52-56.
[33]周玲,王兴念,丁晓群,颜自坚,李顺宗.基因/禁忌组合算法在配电网网架优化规划中的应用[J].电网技术,1999(9):35-42.
[34]毛玉宾,王秀丽,王锡凡.多阶段输电网最优规划的遗传算法[J].电力系统自动化,1998(12): 13-19.
[35] Vladimiro Miranda,Rantio.J.V. Genetic Algorithms In Optimal Multistage Distribution Network Planning[J]. IEEE Trans Power Systems,1994:1927-1933.
[36]王雷,顾洁.中压配电网优化规划的改进遗传算法[J].继电器,2006,34(7):43-46,50.
[37]张李盈,范明天.配电网综合规划模型与算法的研究[J].中国电机工程学报,2004,24(6):59-64.
[38]代姚,周湶，雷绍兰，邓群，孙才新，方重秋.基于稳定参数控制的改进遗传算法在配电网络规划中的应用[J].电网技术,2006,30(10):50-53,74.
[39]余健明,吴海峰,杨文宇.基于改进多种群遗传算法的配电网规划[J].电网技术,2005,29(7):36-40,55.
[40]段刚,余贻鑫.输配电系统综合规划的全局优化算法[J].中国电机工程学报,2002,22(4):109-113.
[41]张永伍,余贻鑫,严雪飞,罗凤章.基于区间算法和范例学习的配电网网架规划[J].电力系统自动化,2005,29(17):40-44.
[42] Nicholas G. Boulaxis, Michael P.Papadopoulos. Optimal Feeder Routing in Distribution System Planning Using Dynamic Programming Technique and GIS Facilities[J]. IEEE Transactions on Power Delivery. 2002,17(1):242-247.
[43]刘健,杨文宇,余健明,宋蒙.一种基于改进最小生成树算法的配电网架优化规划[J].中国电机工程学报,2004,24(10):103-108.
[44]高炜欣,罗先觉.基于蚂蚁算法的配电网网络规划[J].中国电机工程学报,2004,24(9):110-114.
[45]任苹,高立群,王珂,李楠.基于混合粒子群优化的电网优化规划[J].东北大学学报,2006,27(8):843-846.
[46]王成山,王赛一.基于空间GIS和Tabu搜索技术的城市中压配电网络规划[J].电网技术,2004,28(14):68-73,78.
[47] Lin W M,Tsay M T,Wu S W. Application of geographic information system for substation and feeder planning[J]. International Journal of Electrical Power and Energy System,1996,18(3):175-183.
[48] Eloy Díaz-Dorado,JoséCidrás,Edelmiro Míguez. Application of Evolutionary Algorithms for the Planning of Urban Distribution Network of Medium Voltage[J]. IEEE Transaction on Power System,2002,17(3):879-884.
[49]孙成宝,苑微微,黑晓红,刘多斌.配电技术手册(10~35kV部分)[M].北京:中国电力出版社,2005.
[50]杨文宇,刘健,余健明等.基于改进prim算法的配电网络优化规划方法[J].电工技术学报,2005,20(3):75-79.
[51]周明,孙树栋.遗传算法原理及应用[M].北京:国防工业出版社,1999.
[52]颜伟,刘方,王官洁等.辐射型网络潮流的分层前推回代算法[J].中国电机工程学报,2003,23(8):76-80.
[53]言宇.基于改进遗传算法的配电网最优无功补偿研究[D].湖南大学硕士学位论文. 2006.
[54]杨新武.遗传归纳逻辑程序设计技术研究[D].北京工业大学博士学位论文. 2003.
[55] WHITLEY D,et al.Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operator[C]. Proc. Of 3rd Int. conf. on Genetic Algorithms, Morgan Kaufmann,1989:133-140.
[56]潘福全,王丰元,周旭东等.基于道路网络数据库的最短路径搜索[J].公路交通科技,2005,22(3):105-107.
[2]中华人民共和国建设部,城市电力规划规范GB50293—1999[S]. 1999,6.
[3]陈章潮,唐德光.城市电网规划与改造[M].北京:中国电力出版社,1998.
[4] El-Kady M.A.. Computer-aided planning of distribution substation and primary feeders[J]. IEEE Trans.on PWS,1984,103(6):1183-1189.
[5]杨苏.城市配电网优化规划模型和算法的研究及其实现.硕士学位论文. 2004.
[6]杨丽徙等.各规划水平年间网络改造方案的优化方法[J].电力自动化设备,2001(1):33-34.
[7]于平洋.配电系统规划中的若干重要问题[J].电网技术,2001(5):1-5.
[8]韩富春,董青松,实用城市配电网优化规划模型[J].中国电力,1998(4):39-42.
[9] Khator S K,Leung L C. Power distribution planning a review of models and issue[J]:1151-1159.
[10]倪秋龙,黄民翔.用逐步线性化网络流算法进行配电网络规划[J].电力系统及其自动化学报,2000(3):31-35.
[11]杨明皓.配电系统可靠性实用计算方法和计及供电可靠性的配电网络规划[D].硕士学位论文. 1986.
[12]许跃进.城市电力网综合规划研究[D].硕士学位论文. 1987.
[13]谭琼等.网络规划在城市电力网网架结构设计中的应用[J].湖南大学学报(增刊),1995(5).
[14] J.T. Boardman, C. C. neckiff. A Branch and Bound Formulation to electricity Distribution Planning Problem[J]. IEEE Trans PAS. 1985,104(8):2112-2118.
[15]孙洪波.电力网络规划[M].重庆:重庆大学出版社,1996.
[16] Albuyeh F, James J S. A Transmission Network Planning Method For Comparative Studies[M]. IEEE Trans. on PAS, 1982.
[17] EI-Sobkl S M,EI-Melual1y M. New Approach for Planning High-Voltage Transmission Network[J]. IEE Proc. 1986,133(5):256-262.
[18] Aoki.K.Nara, K.Satoh.T. New Approximate Optimization Method for Distribution Systems Planning[J]. IEEE Trans Power Systems,1990:126-132.
[19]韩富春,赵铭凯,刘亚新.城市电网规划方法研究[J].电力系统自动化,1994(11):57-62.
[20]王东平,黄山.基于启发式的地方电网结构规划及其应用[J].电力系统自动化,2002(2) :64-65.
[21] Aoki.K.Nara, K.Satoh.T. Mufti-Year Expasion Planning for Distribution Systems[J]. IEEE Trans Power Systems,1991:952-958.
[22] S.K.Goswami: Distribution System Planning Using Branch Exchange Techniques[J]. IEEE TransPower Systems,1997:718-723.
[23] Hsu.Y.Y,Chen.J.L. Distribution Planning Using Knowledge-Based Expert System[J]. IEEE Trans Power Systems,1990:1514-1519.
[24] Colorni A,Dorigo M, Maniezzo V. Distributed optimization by ant Colonies [A]. Proceeding of ECAL91-European Conference on Artificial Li life[C]Paris, 1991:134-142.
[25]王锡凡.电力系统优化规划(第一版) [M].北京:水利电力出版社,1990.
[26]陈根军,唐国庆.基于禁忌搜索与蚁群最优结合算法的配电网规划[J].电网技术,2005,29(2):23-27.
[27]王志刚,杨丽徒,陈根永.基于蚁群算法的配电网网架优化规划方法[J].电力系统及其自动化学报,2002,14(6):73-76.
[28]赵强,敬东,李正.蚁群算法在配电网规划中的应用[J].电力自动化设备,2002,23(2):52-54.
[29] R Romer,R A Gallego A Monticelli. Transmission System Expansion Planning by Simulated Annealing[J]. IEEE Transactions on Power Systems, 1996,11(1):364-369.
[30]刘宝靛,赵瑞清.随机规划与模糊规划[M].北京:清华大学出版社,1998.
[31]陈章潮,顾洁,孙纯军.改进的混合模拟退火法-遗传算法应用于电网规划[J].电力系统自动化,1999(10):21-29.
[32]刘晓飞,彭建春,高效,陈景怀,卜永红.基于单亲遗传算法的配电网络规划[J].电网技术,2002(2):52-56.
[33]周玲,王兴念,丁晓群,颜自坚,李顺宗.基因/禁忌组合算法在配电网网架优化规划中的应用[J].电网技术,1999(9):35-42.
[34]毛玉宾,王秀丽,王锡凡.多阶段输电网最优规划的遗传算法[J].电力系统自动化,1998(12): 13-19.
[35] Vladimiro Miranda,Rantio.J.V. Genetic Algorithms In Optimal Multistage Distribution Network Planning[J]. IEEE Trans Power Systems,1994:1927-1933.
[36]王雷,顾洁.中压配电网优化规划的改进遗传算法[J].继电器,2006,34(7):43-46,50.
[37]张李盈,范明天.配电网综合规划模型与算法的研究[J].中国电机工程学报,2004,24(6):59-64.
[38]代姚,周湶，雷绍兰，邓群，孙才新，方重秋.基于稳定参数控制的改进遗传算法在配电网络规划中的应用[J].电网技术,2006,30(10):50-53,74.
[39]余健明,吴海峰,杨文宇.基于改进多种群遗传算法的配电网规划[J].电网技术,2005,29(7):36-40,55.
[40]段刚,余贻鑫.输配电系统综合规划的全局优化算法[J].中国电机工程学报,2002,22(4):109-113.
[41]张永伍,余贻鑫,严雪飞,罗凤章.基于区间算法和范例学习的配电网网架规划[J].电力系统自动化,2005,29(17):40-44.
[42] Nicholas G. Boulaxis, Michael P.Papadopoulos. Optimal Feeder Routing in Distribution System Planning Using Dynamic Programming Technique and GIS Facilities[J]. IEEE Transactions on Power Delivery. 2002,17(1):242-247.
[43]刘健,杨文宇,余健明,宋蒙.一种基于改进最小生成树算法的配电网架优化规划[J].中国电机工程学报,2004,24(10):103-108.
[44]高炜欣,罗先觉.基于蚂蚁算法的配电网网络规划[J].中国电机工程学报,2004,24(9):110-114.
[45]任苹,高立群,王珂,李楠.基于混合粒子群优化的电网优化规划[J].东北大学学报,2006,27(8):843-846.
[46]王成山,王赛一.基于空间GIS和Tabu搜索技术的城市中压配电网络规划[J].电网技术,2004,28(14):68-73,78.
[47] Lin W M,Tsay M T,Wu S W. Application of geographic information system for substation and feeder planning[J]. International Journal of Electrical Power and Energy System,1996,18(3):175-183.
[48] Eloy Díaz-Dorado,JoséCidrás,Edelmiro Míguez. Application of Evolutionary Algorithms for the Planning of Urban Distribution Network of Medium Voltage[J]. IEEE Transaction on Power System,2002,17(3):879-884.
[49]孙成宝,苑微微,黑晓红,刘多斌.配电技术手册(10~35kV部分)[M].北京:中国电力出版社,2005.
[50]杨文宇,刘健,余健明等.基于改进prim算法的配电网络优化规划方法[J].电工技术学报,2005,20(3):75-79.
[51]周明,孙树栋.遗传算法原理及应用[M].北京:国防工业出版社,1999.
[52]颜伟,刘方,王官洁等.辐射型网络潮流的分层前推回代算法[J].中国电机工程学报,2003,23(8):76-80.
[53]言宇.基于改进遗传算法的配电网最优无功补偿研究[D].湖南大学硕士学位论文. 2006.
[54]杨新武.遗传归纳逻辑程序设计技术研究[D].北京工业大学博士学位论文. 2003.
[55] WHITLEY D,et al.Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operator[C]. Proc. Of 3rd Int. conf. on Genetic Algorithms, Morgan Kaufmann,1989:133-140.
[56]潘福全,王丰元,周旭东等.基于道路网络数据库的最短路径搜索[J].公路交通科技,2005,22(3):105-107.