检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华中科技大学电力系
出 处:《中国电机工程学报》2002年第11期59-63,共5页Proceedings of the CSEE
摘 要:在阻塞管理中,费用分摊法已成为阻塞定价中的一种重要方法。然而在阻塞费用对阻塞线路的分摊中,目前提出的影子价格法和边际微增法仍存在一些不合理的地方。为了克服这些方法的缺点,该文针对双边交易提出了一种基于Aumann-Shapley值的阻塞费用分摊法。该方法利用无限多局中人联盟博弈中的Aumann-Shapley值,计及了所有阻塞消除顺序,通过Gauss积分法较为简单和精确地计算出分摊结果,真正实现了阻塞费用在阻塞线路上的公平分摊。通过算例分析,证明了基于Aumann-Shapley值的阻塞费用分摊法优于影子价格法和边际微增法。In congestion management, the cost allocation methods have been one of the most important congestion pricing methods. Unfortunately in the congestion cost alloca-tion to congested lines, the shadow price method and the marginal and incremental method existed have some defects. This paper presents an Aumann-Shapley value based cost allocation method in bilateral transaction environment to overcome the shortcomings of these methods above. By means of the Aumann-Shapley value in the cooperative game with infinitely many players, the proposed method considers all orders of congestion relief and calculates the allocation simply and accurately using the Gauss Integration Method. The method equitably allocates the cost of relieving congestion to congested lines. Test results illustrate that the method provides better allocation than the shadow price method and the marginal and incremental method.
关 键 词:双边交易模式 Aumann-Shapley值 阻塞费用分摊方法 电力系统
分 类 号:TM731[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222