| 最小化运行费用的时变重构全局优化算法 |
| |
| 引用本文： | 吴建中,余贻鑫.最小化运行费用的时变重构全局优化算法[J].中国电机工程学报,2003,23(11):13-17. |
| |
| 作者姓名： | 吴建中 余贻鑫 |
| |
| 作者单位： | 天津大学自动化学院电力系,天津,300072 |
| |
| 基金项目： | 国家自然科学基金(59877017)，教育部博士学科点基金(20010056002)，天津大学优秀博士论文基金~~ |
| |
| 摘 要： | 该文提出了一种以运行费用最小为目标的时变重构全局优化算法。将时变重构问题分解为多个静态重构子问题，使用核心模式遗传最短路算法(CSGSA)分别求解每个子问题，得出候选放射状网络结构，并使用动态规划，根据各子问题的结果求解全局最优的时变重构策略。算法还对开关操作次数约束进行了处理，使之不影响动态规划的全局最优性。所提算法是配电网络实时调度，规划和离线分析的有效工具。
|
| 关 键 词： | 电力系统 配电网 实时调度 时变重构全局优化算法 最小化运行费用 最短路算法 |
| 文章编号： | 0258-8013(2003)11-0013-05 |
| 修稿时间： | 2003年4月15日 |
GLOBAL OPTIMIZATION ALGORITHM TO TIME-VARYING RECONFIGURATION FOR OPERATION COST MINIMIZATION |
| |
| WU Jian-zhong,YU Yi-xin.GLOBAL OPTIMIZATION ALGORITHM TO TIME-VARYING RECONFIGURATION FOR OPERATION COST MINIMIZATION[J].Proceedings of the CSEE,2003,23(11):13-17. |
| |
| Authors: | WU Jian-zhong YU Yi-xin |
| |
| Abstract: | A global optimization algorithm to time-varying reconfiguration for operation cost minimization is proposed in this paper. Dividing the time-varying reconfiguration problem into several static reconfiguration sub-problems, solving each sub-problem to get candidate radial network configurations by using the Core Schema Genetic Shortest-path Algorithm (CSGSA), and then searching for the global optimal time-varying reconfiguration strategy with dynamic programming based on the results of each sub-problem. The switches operation numbers constraint is also disposed to avoid affecting the global optimality of dynamic programming. The proposed method can be used as an efficient tool for distribution network on-line dispatching, planning and off-line analysis. |
| |
| Keywords: | Power system Distribution network Time-varying reconfiguration Dynamic programming Genetic algorithm Shortest-path algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
