检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:黎灿兵[1] 胡亚杰[1] 赵弘俊[1] 李晓辉[1]
机构地区:[1]郑州大学电气工程学院,河南省郑州市450001
出 处:《电力系统自动化》2007年第11期26-30,共5页Automation of Electric Power Systems
基 金:"电力系统及发电设备控制与仿真国家重点实验室开放课题基金"的资助(GZH(2006)02)
摘 要:在电力库模式下,各发电厂获得的合约电量都需要进行分解,如年合约电量向月分解、月合约电量向日分解等。合约电量分解是交易中心普遍需要解决的问题。将合约电量分解归纳为二次规划的优化问题,提出了能考虑检修、水电电量受限、热电联产等特殊问题的进度系数概念,并根据进度系数提出逐段法进行分解,使各个时间单元每个发电厂的进度系数尽可能保持均衡。模型具有普遍适应性,结果优化可行,计算速度快。采用IEEERTS-96的24节点系统算例,证明了模型和算法的有效性。The contract power energy should be decomposed to each period of time in power pool. For example, the contract energy that a power plant won the bidding in year-contract market should be decomposed to each month, and month-contract energy should be decomposed to each day, etc. Decomposition of contract energy is a universal problem that should be resolved by the trading center. The decomposition of contract energy is reduced to a quadratic programming problem. The concept of rates of progress is proposed with such special problems as the maintenance, the limiting of hydraulic power and the thermal power generation taken into account and the contract energy could be decomposed step by step, making rates of progress of all power plants balance in all time slices. The model is universally adaptable. The algorithm calculates fast and the result is optimal and feasible. Finally, a case with 24 buses is studied based on IEEE RTS-96 system. It's proved that the model and algorithm are effective through case study.
关 键 词:合约交易 合约分解 多项式算法 二次规划 电力市场
分 类 号:TM74[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249