用户名: 密码: 验证码:
城市配电网优化规划模型和算法的研究及其实现
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
配电网优化规划是一个复杂的非线性问题,由于许多现有模型过于简化,不能更好的描述问题的很多方面,因此,本文提出了一个更全面的模型。该模型考虑了配电网优化规划中存在的可靠性、线路走径、中间节点、线路型号与回数、多负荷状念、多运行状态、原有电网的改建等多个方面。
     以往模型相对简单的一个原因是缺乏有力的配电网优化算法。因此,本文提出了一种基于进化算法的适应性和效率更高的优化算法。进化算法被认为是一种通用的、可求解复杂非线性优化问题的方法。然而将其应用与配电网优化规划问题时,问题中所包含的专有知识往往没有得到应有的重视。本文发现了一种利用这些专有知识的方法,该方法不是对个体的基因型进行操作,而是直接作用于配电网的构造过程。通过引入专有知识,算法的性能得到提升,使得更复杂的模型能够在可接受的时间内得到有效解决。此外,该算法对进化算法本身也提出了一些改进措施。
     最后,本文提供了一些算例,通过实验和分析证明了本文模型和算法是有效、可行的。
Distribution System Planning is a non-linear and complicated problem that was simplified too greatly in many present models. So a more complete model was proposed in this paper. Reliability, paths of lines, middle nodes, circuit number and type of lines, rebuilding and multiple load and running states were considered in the novel model.
    One of the reasons for the former simple models was the lack of powerful enough algorithm. So a more robust and efficient method was introduced. This method was based on the Evolutionary Algorithm that was known as a kind of general-purpose method for non-linear and complicated optimization problem. When people used EA for Distribution System Planning, the special knowledge about the distribution system was often ignored. This paper found a way to use the knowledge by keeping constructing the net of distribution system instead of operating on the chromosome or other numerical data. Thus, the algorithm's performance was higher and more complicated model was solvable within acceptable time. At the same time, some improvement was made for EA.
    At last, some examples were provided and the result showed that the model was feasible and the algorithm was effective.
引文
1 陈章潮,唐德光.城市电网规划与改造.北京:中国电力出版社,1998
    2 杨期余,刘斌,余景胡.城市电网规划的一种新方法—拉各朗日松弛法.湖南大学学报,1996(4):99~103,106
    3 杨丽徙,陈根永.各规划水平年间网络改造方案的优化方法.电力自动化设备,2001(1):33~34
    4 周玲,李顺宗.基因禁忌算法在配电网网架优化规划中的应用.电网技术,1999(9):35~37,42
    5 王春生,赵凯,彭建春.基于地理信息系统和遗传算法的配电网优化规划.电力系统自动化,2000(14):48~51,48
    6 李靖霞,鞠平.配电网络优化规划的基因算法.电力系统自动化,1999(2):12~14
    7 李大卫,王莉,王梦光.遗传算法与禁忌算法的混合策略.系统工程学报,1998(3)
    8 谢敬东,唐国庆,吴新余.进化规划在电网规划中的应用.电力系统及其自动化学报,1998(10)
    9 文福拴,韩祯祥.基于Tabu搜索方法的输电系统最优规划.电网技术,1997(5)
    10 潘力强,杨期余.Tabu搜索在城网规划中应用研究.全国高等学校电力系统及其自动化专业第十四届学术年会论文集,1998:27~32
    11 王永德.供电网络优化设计德模拟退火算法.基础自动化,1996(3):33~37
    12 倪秋龙,黄民翔.用逐步线性化网络流算法进行配电网络规划.电力系统及其自动化学报,2000(3):31~35
    13 王平洋.配电系统规划中的若干重要问题.电网技术,2001(5):1~5
    14 韩富春,董青松.实用城市配电网优化规划模型.中国电力,1998(4):39~42
    15 Khator S K, Leung L C. Power distribution planning, a review of models and issues IEEE Trans. on Power Systems, 1997(3): 1151~1159
    16 Ramfres-Rosado I J, Bernal-Agustin J L. Genetic Algorithm Applied to the Design of Large Power Distribution Systems. IEEE Trans on Power Systems, 1998(2)
    17 孙洪波.电力网络规划.重庆:重庆大学出版社,1996
    18 Chow M Y, Tram H. Application of fuzzy logic technology for spatial load forecasting. IEEE Trans. on Power Systems, 1997(3): 1360~1366
    19 曲伟君,张步涵.开式配电网络的优化设计.水电能源科学,2000(1):35~37
    20 李士勇.模糊控制、神经网络和智能控制.哈尔滨:哈尔滨工业大学出版社,1996
    21 吴元华,王志明.基于决策支持系统的配电网优化规划.现代电力,1999(3)34~39
    22 余贻鑫,邱伟,刘若沁.基于启发式算法与遗传算法的配电网重构.电网技术,
    
    2001(11)19~21
    23 Miranda Vladi-miro. genetic Algorithm in Optimal Multistage Distribution Network Planning. IEEE Trans on Power Systems, 1994(4)
    24 Holland. J. H. Adaptation in Natural and Artificial System. The University of Michign Press. Ann Arbor, 1975
    25 Fogel. D. B. Asympototic Convergency Properties of genetic Algorithms and Evolutionary Programming: An Analysis and Experiments. Cyber and Systems: An Int. J, 1994(25): 389~407
    26 赵祖康,王伟.中国城市配电网自动化与网络结构优化.电力系统自动化,2000(19):43~46
    27 Geol L, Billin-ton R. Evaluation of Interrupted Energy Assessment Rates in Distribution Systems. IEEE Trans on Power Delivery, 1991(4)
    28 Jonnavi-thula Satish, Billin-ton Roy. Minimum Cost Analysis of Feeder Routing in Distribution System Planning. IEEE Trans on Power Systems, 1996(4)
    29 王金芝,江荣汉.配电系统结线方式的可靠性分析.全国高等学校电力系统及其自动化专业第十届学术年会论文集,1994
    30 Brown R E, Gupta S, Christie R D. Automated Primary Distribution System Design: Reliability and Cost Optimization. IEEE Trans on Power Delivery, 1997 (2)
    31 王锡凡.电力系统优化规划.北京:水利电力出版社,1990
    32 Aoki K and Nara K. New Approximate Optimization Method for Distribution System Planning. IEEE PWRS, 1990(1): 126~132
    33 王天华,王平洋,袁钦成.空间负荷预测处理不确定性因素的方法论CICED2000论文集,2000(10):94~97
    34 王天华,王平洋,范明天.遗传算法、模糊逻辑和运输模型在配电网空间负荷预测中的应用.电网技术,1999(1):24~28
    35 张焰,陈章潮.计及不确定性的模糊潮流计算方法研究.电网技术,1998(2):20~22,25
    36 王天华,王平洋,范明天.配电规划系统的空间负荷GIS平台与总体设计框架.电网技术,1998(12):6~10
    37 H L Wills. Substation siting and Caoacity Selection Based on Diversity Maximization. IEEE Trans on Power Systems PWRS, 1987: 692
    38 陈全林.最优化理论与算法.北京:清华大学出版社,1990
    39 孙宏斌,张伯明.发输配电全局潮流计算.电网技术,1998(12):39~42
    40 畅毅刚等.电力系统优化的理论基础.北京:水利电力出版社,1990
    41 陈章潮,顾洁.配电网规划及其自动化(三).电网技术,1995(11):61~67
    
    
    42 周全仁,张清益.电网计算与程序设计.长沙:湖南科学技术出版社,1983
    43 陈章潮.地区电网规划与监控.北京:水利电力出版社,1990
    44 宋文南,张尧,李树鸿.电力系统潮流计算.天津:天津大学出版社,1988
    45 Zhang F, Cheng C S. A modified Newton method for radial distribution system power flow analysis. IEEE Trans on Power Systems, 1997(1)
    46 Lin W M, Chin H C. A new approach for distribution feeder reconfiguration for loss reduction and service restoration. IEEE Trans on Power Delivery, 1998
    47 张学松.配电网潮流算法比较研究.电网技术,1998(4):45~49
    48 K Aoki. New Approximate Optimization Method for Distribution Systems Planning. IEEE Trans. on Power Systems, 1990 (1): 125
    49 Yifan Tang. Power Distribution System Planning with Reliability Modeling and Optimization. IEEE Trans .on Power Systems, 1996(1): 181
    50 Marie Blanched. Experience with Optimization Software for Distribution System Planning. IEEE Trans on Power Systems, 1996(4): 1891
    51 林敏.配电网优化规划中变电站站址及站间连接的研究.江苏电机工程,2001(3):6~9
    52 苏小林,赵铭凯.配电网络优化重构算法.电力自动化设备,1997:15~19
    53 宋文南,张双瑞,王勇.用于降低网络损耗的配电网重构算法.电网技术,2000(10):45~49
    54 刘键,毕鹏翔,董海鹏.复杂配电网简化分析与优化.中国电力出版社,2002
    55 朱时光.线损最小网架的探讨.电力技术,1985(3):66~59
    56 王守相,王成山.配电系统联络开关的优化配置.继电器,2002(30):24~27

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700