.png){kind=icon}
返回
A practical codification and its analysis for the generalized reconfiguration problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.epsr.2012.12.002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Distribution network reconfiguration problem is simply aimed at finding the best set of radial configurations among a huge number of possibilities. Each solution of this set ensures optimal operation of the system without violating any prescribed constraint. To solve such problem, it is important to count on efficient procedure to enforce radiality. In this paper, we propose a reliable approach to deal properly with topology constraint enabling algorithm convergence toward optimal or quasi-optimal solutions. A simple and practical codification of individuals used in evolutionary algorithms to solve the generalized reconfiguration problem is detailed in this paper. Mathematical formulation, algorithm, and simulation results are presented for the distribution reconfiguration problem, incorporating a new representation scheme which is immune to topologically unfeasible possibilities. The individual interpretation procedure is straight and it demands no additional data structure or graph preprocessing. Comparisons are made for five well-known distribution systems to demonstrate the efficacy of the proposed methodology. It is also demonstrated that optimal configurations are properly surveyed when single or multiple sources are dealt. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Radial distribution networks
Multi-objective
Constrained optimization problem
Graph theory
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.2
论文数:
1.2W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
Main chain representation for evolutionary algorithms applied to distribution system reconfiguration
PREAI
分享收藏分享收藏Comparative study of modern heuristic algorithms to service restoration in distribution systems
PREAI
分享收藏
分享收藏
查看更多内容