| 基于蚁群最优的配电网网架规划方法 |
| |
| 引用本文： | 胡斌,顾洁,王衍东.基于蚁群最优的配电网网架规划方法[J].电力系统保护与控制,2005,33(21):59-62. |
| |
| 作者姓名： | 胡斌 顾洁 王衍东 |
| |
| 作者单位： | 上海交通大学电气工程系，上海 200030 |
| |
| 基金项目： | 高等学校优秀青年教师教学科研奖励计划资助项目 |
| |
| 摘 要： | 配电网规划问题是一个复杂的组合优化问题。蚁群算法是用于解决组合优化问题的一种高效的随机化内启发式全局搜索技术,能有效地求解大规模组合优化问题。文中结合单阶段配电网规划问题的特点,应用蚁群算法来解决配电网规划问题,建立了相应的数学模型,并给出求解算法。算例的计算结果表明了这种方法是可行、有效的。
|
| 关 键 词： | 配电网络 蚁群最优 现代启发式方法 |
| 文章编号： | 1003-4897(2005)21-0054-04 |
| 收稿时间： | 2004-12-14 |
| 修稿时间： | 2005-08-11 |
An ant colony optimization based method for power distribution network planning |
| |
| HU Bin, GU Jie, WANG Yan-dong.An ant colony optimization based method for power distribution network planning[J].Power System Protection and Control,2005,33(21):59-62. |
| |
| Authors: | HU Bin GU Jie WANG Yan-dong |
| |
| Affiliation: | Shanghai Jiaotong University, Shanghai 200030, China |
| |
| Abstract: | Distribution network planning is a complex combinatorial optimization problem. Although this problem has been extensively studied, it is still not well solved. In recent years, an ant colony algorithm is employed. It is a new meta-heuristic method. It is highly efficient for quickly finding high quality solutions to combinatorial optimization problems. In this paper, an improved ant colony algorithm is introduced to the distribution network planning, and the corresponding mathematical model and its solution algorithm are also presented. The feasibility and efficiency of the algorithm are verified by its application result in two sample systems. |
| |
| Keywords: | distribution network ant colony optimization(ACO) modern heuristic method |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《电力系统保护与控制》浏览原始摘要信息 |
|
点击此处可从《电力系统保护与控制》下载全文 |
