.png){kind=icon}
返回
Network reduction in the Transmission-Constrained Unit Commitment problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2012.02.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper examines a preprocessing technique for a Mixed Integer Linear Programming (MILP) formulation of the Transmission-Constrained Unit Commitment problem (TC-UC). Incorporating transmission constraints into the Unit Commitment problem can significantly increase the size and difficulty of the problem. By examining the structure of the transmission network, variables that have no impact on the quality of the overall solution can be identified and removed. This preprocessing can reduce the time needed to solve the linear programming relaxation of the MILP, and as a result, the MILP itself. Illinois's transmission network was used to test the benefit of the proposed technique. Preprocessing was able to remove 30% of the buses in the transmission network. This reduction led to a significant decrease in the time needed to solve a 24 h TC-UC problem. An added benefit of the preprocessing is that symmetry can be introduced into the problem. Identifying this symmetry and exploiting it can improve overall solution times even further. (C) 2012 Published by Elsevier Ltd.
Keyword:
Unit Commitment
Transmission network
Mixed Integer Linear Programming
Network reduction
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
Estimation in Forest Yield Models Using Composite Link Functions with Random Effects.png)
Biometrics
BiometricsIF0
PREAI
分享收藏Terrestrial, benthic, and pelagic resource use in lakes: results from a three-isotope Bayesian mixing modelEcology
EcologyIF0
PREAI
分享收藏Effect of White Mud as a Second Filler on the Mechanical and Thermal Properties of Bamboo Residue Fiber/Polyethylene CompositesBioResources
OAAI
BioResourcesIF0
OAAI分享收藏
查看更多内容