检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:高志华[1] 任震[1] 黄雯莹[1] 朱然[1] 吴国玥[1]
机构地区:[1]华南理工大学电力学院
出 处:《电力系统自动化》2005年第7期38-42,共5页Automation of Electric Power Systems
基 金:广东省自然科学基金资助项目(000397)
摘 要:分析了竞争性环境下发电机组计划检修制定时所面临的新问题,如系统安全可靠性、机组间的公平性和算法的透明性等,并在此基础上提出了基于竞标模式的机组竞争检修机制。首先通过引入可检修容量的概念,确定在一个检修周期内系统可能用于机组检修的容量大小;然后给出发电机组参与检修容量竞标的报价方式以及竞争检修机制的数学模型和算法;最后,在结算方式中对机组实际中标费用和由于竞价检修而产生的盈余收入进行重新分配。理论分析和数字算例均表明,竞价检修机制可以很好地解决发电机组检修中的公平性问题,模型和算法也具有良好的实用性和可操作性。The problems of existing unit maintenance scheduling in a competitive environment such as, how to ensure the security and reliability of power systems, the fairness among the units during scheduling, and the transparency of algorithms are discussed. And then, a competitive mechanism for maintenance scheduling is presented to solve these problems. First, the concept of variable maintenance capacity is introduced to find out how many units are concerned with maintenance in a certain period. Secondly, the bidding modes of the enlisted generating units and the mathematical model for the mechanism are proposed. Finally, the settlement for the cost and the corresponding surplus is rearranged to ensure optimal social benefits. It is shown by theoretical analysis and case study that the mechanism can well cope with impartiality and the model proposed is feasible.
关 键 词:发电机组 检修计划 可检修容量 竞争检修机制 差价结算
分 类 号:TM73[电气工程—电力系统及自动化] TM31
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15