摘要
发电竞价可能用到的主要算法有 :排队法、等报价法 (或等微增率法 )、动态规划法、网络流规划法和线性规划法等 5种 ,它们分别适应于不同类型的报价曲线 ,并适合解决不同类型的约束条件。文中介绍第 1种发电竞价算法——排队法 ,可用来解决机组组合问题和功率分配问题。其优点是简单快速 ,但仅适用于常数 (或多段常数 )型报价曲线 ,处理第 2类约束 (时间 )和第 3类约束 (电网安全 )问题较困难。
There are five types of generation bidding algorithms com monly used in deregulation environm ent.They are the merit- order method,the equal bidding price equal increm ental equations method,the dynamic programm ing method,the network flow programm ing m ethod and the linear programm ing method.In general,they can be used to solve different types of bidding curves and deal with various sets of constraints.Here,the first algorithm,i.e.the m erit- order method is presented as beginning of the tutorials,which can be used to solve unit com mitm ent and power dispatch problems.The unique feature of the method is fast and brief,however,it is only used for the bidding curves with ladder type,and further it has som e difficulties for solving the second set of time constraint and the third set of security of power network constraints.
出处
《电力系统自动化》
EI
CSCD
北大核心
2001年第4期16-19,共4页
Automation of Electric Power Systems
