| 引用本文: | 王梓耀,陈俊斌,林丹,曾广璇,余涛.基于精英蚁群Q算法的中压配电网双Q规划模型[J].电力自动化设备,2020,40(11): |
| WANG Ziyao,CHEN Junbin,LIN Dan,ZENG Guangxuan,YU Tao.Double Q planning model for medium voltage distribution network based on Elite Ant-Q algorithm[J].Electric Power Automation Equipment,2020,40(11): |
|
| 摘要: |
| 为了有效应用数字化技术提供的精细化地理与负荷信息，根据中压配电网的基本特点，将配电网中的元件抽象为图论中的节点和支路，以经济性和可靠性为目标，建立一种新型的大规模中压配电网双Q规划模型；将0-1变量编码方式转化为序列整数编码方式，降低模型求解的复杂度；提出精英蚁群Q算法，并利用该算法求解辐射状网架，根据最短路法和联络优先原则设置联络线，经过反复迭代得到闭环最优网架。广州某新建园区的算例结果验证了所提模型与算法的有效性。 |
| 关键词: 大规模配电网规划 双Q规划模型 精英蚁群Q算法 序列编码 最短路法 闭环设计 |
| DOI：10.16081/j.epae.202010004 |
| 分类号:TM715 |
| 基金项目:国家自然科学基金资助项目(51777078)；广东省普通高校基础研究与应用基础研究重点项目(2018KZDXM001)；国家电网有限公司总部科技项目(能源互联网环境下的多源互联配电网及多样化用电方式的需求策略系统研究)；中国南方电网公司科技项目(GDKJXM20172942) |
|
| Double Q planning model for medium voltage distribution network based on Elite Ant-Q algorithm |
|
WANG Ziyao, CHEN Junbin, LIN Dan, ZENG Guangxuan, YU Tao
|
|
School of Electric Power Engineering, South China University of Technology, Guangzhou 510641, China
|
| Abstract: |
| In order to effectively apply the refined geographic and load information provided by digital technology, according to the basic characteristics of medium voltage distribution network, the components in distribution network are abstracted into nodes and branches of the graph theory, and a novel double Q planning model for large-scale medium voltage distribution network is built, which takes the economy and reliability as its objectives. The 0-1 variable encoding mode is transformed into sequence integer encoding mode, which reduces the solving complexity. The EAQ(Elite Ant-Q) algorithm is proposed and used to solve the radial network, the tie lines are set according to the shortest path method and connection priority principle, and the optimal closed-loop network is obtained by repeated iterations. The case results of a newly built park in Guangzhou verify the effectiveness of the proposed model and algorithm. |
| Key words: large-scale distribution network planning double Q planning model EAQ algorithm sequence coding shortest path method closed-loop design |
