.png){kind=icon}
返回
Transmission expansion planning using multivariate interpolation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.epsr.2015.03.031.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The total cost of the transmission expansion planning (TEP) problem consists of investment and operation costs. The former is the required capital investment cost for new circuits throughout the network, and the latter is the cost of optimal generation dispatch to meet the demand at each hour. Traditionally, due to computational limits and long-term planning, the operation cost is not computed for hourly demand in the TEP problem. It is typically computed for the peak demand occurring during each year. In addition, the price of fuel used in the operation problem is considered fixed rather than variable overtime. In this paper, we use a multivariate interpolation method to compute the operation cost for the TEP problem in which the demand changes from hour to hour and the fuel price from day to day. A binary particle swarm optimization (BPSO) is proposed to solve the TEP problem. We apply our method to the Garver's 6-bus system and the IEEE 24-bus system for a planning horizon of ten years. By using the multivariate interpolation, the computational time of the solving algorithm is reduced. We compare our method with traditional methods based on the total cost of the obtained expansion plans. Experimental results show that the proposed method is an enhancement to solving the multi-year security-constrained TEP problem. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Transmission expansion planning
Multivariate interpolation
BPSO
N-1 security criterion
Dynamic planning
Optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.2
论文数:
1.1W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
分享收藏A reliable approach for solving the transmission network expansion planning problem using genetic algorithms用遗传算法求解输电网扩展规划问题的一种可靠方法
PREAI
分享收藏
查看更多内容