检索结果-内蒙古大学图书馆

International Conference on Power System Technology

作者： Li, MJ Tang, Z Changsha Univ Elect Power Dept Elect Engn Changsha 410077 Peoples R China

ISBN: (纸本)0780374592

This paper presents an artificial immune algorithm simulating the biological immune systems with self-adjustment function, and introduces its basic principle. For the bidding in power markets, this paper gives computation steps of the artificial immune algorithm. The artificial immune algorithm can simultaneously solve unit commitment and economic load distribution, and can expediently handle constraints of bidding in,power markets. So the artificial immune algorithm is an effective method of the bidding in power markets.

关键词： artificial immune algorithm bidding algorithm power markets

来源：评论

学校读者我要写书评

暂无评论

An Energy Sharing Mechanism Considering Network Constraints and Market Power Limitation

引用

IEEE TRANSACTIONS ON SMART GRID 2023年第2期14卷 1027-1041页

作者： Chen, Yue Zhao, Changhong Low, Steven H. H. Wierman, Adam Chinese Univ Hong Kong Dept Mech & Automat Engn Hong Kong Peoples R China Chinese Univ Hong Kong Dept Informat Engn Hong Kong Peoples R China CALTECH Comp & Math Sci Dept Pasadena CA 91125 USA

As the number of prosumers with distributed energy resources (DERs) grows, the conventional centralized operation scheme may suffer from conflicting interests, privacy concerns, and incentive inadequacy. In this paper, we propose an energy sharing mechanism to address the above challenges. It takes into account network constraints and fairness among prosumers. In the proposed energy sharing market, all prosumers play a generalized Nash game. The market equilibrium is proved to have nice features in a large market or when it is a variational equilibrium. To deal with the possible market failure, inefficiency, or instability in general cases, we introduce a price regulation policy to avoid market power exploitation. The improved energy sharing mechanism with price regulation can guarantee the existence and uniqueness of a socially near-optimal market equilibrium. Some advantageous properties are proved, such as the prosumer's individual rationality, a sharing price structure similar to the locational marginal price, and the tendency towards social optimum with an increasing number of prosumers. For implementation, a practical bidding algorithm is developed with a convergence condition. Experimental results validate the theoretical outcomes and show the practicability of our model and method.

关键词： Regulation Production Costs Games Nash equilibrium Uncertainty Sensitivity Prosumers networked energy sharing generalized Nash equilibrium price regulation bidding algorithm

来源：评论

学校读者我要写书评

暂无评论

A COORDINATED LOCATION POLICY FOR LOAD SHARING IN HYPERCUBE-CONNECTED MULTICOMPUTERS

引用

IEEE TRANSACTIONS ON COMPUTERS 1995年第5期44卷 669-682页

作者： SHIN, KG CHANG, YC UNIV TEXAS DEPT ELECT & COMP ENGNEL PASOTX 79968

Uneven task arrivals in a hypercube-connected multicomputer may temporarily overload some nodes while leaving others underloaded. This problem can be solved or alleviated by load sharing (LS);that is, some of the tasks arriving at overloaded nodes, caned overflow tasks, are transferred to underloaded nodes. One important issue in LS is to locate underloaded nodes to which the overflow tasks can be transferred. This is termed the location policy, Any efficient location policy should distribute the overflow tasks to the entire system instead of 'dumping' them on a few underloaded nodes, To reduce the overhead for collecting state information and transferring tasks, each node is required to maintain the state information of only those nodes in its proximity, called a buddy set, Several location policies-random probing, random selection, preferred lists, and bidding algorithm-are analyzed and compared for hypercube-connected multicomputer systems, Under the random-selection and preferred-list policies, an overloaded node can select, without probing other nodes, an underloaded node within its buddy set, while under the random probing policy and the bidding algorithm the overloaded node needs to probe other nodes before transferring the overflow task, Task collision(s) is said to occur if two or more overflow tasks are transferred (almost) simultaneously to the same underloaded node, The performances of these location policies are analyzed and compared in terms of the average number of task collisions, Our analysis shows that use of preferred lists allows the overflow tasks to be shared more evenly throughout the entire hypercube than the other two location policies.

关键词： LOAD SHARING HYPERCUBE-CONNECTED MULTICOMPUTERS LOCATION POLICY BUDDY SETS PREFERRED LISTS RANDOM PROBING AND SELECTION bidding algorithm

来源：评论

学校读者我要写书评

暂无评论

Approaching Prosumer Social Optimum via Energy Sharing With Proof of Convergence

引用

IEEE TRANSACTIONS ON SMART GRID 2021年第3期12卷 2484-2495页

作者： Chen, Yue Zhao, Changhong Low, Steven H. Mei, Shengwei Tsinghua Univ Dept Elect Engn State Key Lab Power Syst Beijing 100084 Peoples R China Chinese Univ Hong Kong Dept Informat Engn Hong Kong Peoples R China CALTECH Dept Comp & Math Sci Pasadena CA 91125 USA

With the advent of prosumers, the traditional centralized operation may become impracticable due to computational burden, privacy concerns, and conflicting interests. In this article, an energy sharing mechanism is proposed to accommodate prosumers' strategic decision-making on their self-production and demand in the presence of capacity constraints. Under this setting, prosumers play a generalized Nash game. We prove main properties of the game: an equilibrium exists and is partially unique;no prosumer is worse off by energy sharing and the price-of-anarchy is 1 - O(1/I) where I is the number of prosumers. In particular, the PoA tends to 1 with a growing number of prosumers, meaning that the resulting total cost under the proposed energy sharing approaches social optimum. We prove that the corresponding prosumers' strategies converge to the social optimal solution as well. Finally we propose a bidding process and prove that it converges to the energy sharing equilibrium under mild conditions. Illustrative examples are provided to validate the results.

关键词： Energy sharing generalized Nash equilibrium prosumer bidding algorithm distributed mechanism

来源：评论

学校读者我要写书评

暂无评论

A DISTRIBUTED DRAFTING algorithm FOR LOAD BALANCING

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1985年第10期11卷 1153-1161页

作者： NI, LM XU, CW GENDREAU, TB Department of Computer Science Michigan State University

Load balancing is important for efficient resource use in distributed systems. In the present paper, a distributed ''drafting'' algorithm is developed for load balancing in local-network-based distributed systems. The algorithm serves as the basis for a dynamic process migration protocol that allows load balancing to be accomplished in a manner transparent to users. The algorithm operates independently of network topology information since only some system design parameters are influenced by topology or low-level communication protocol differences. With the algorithm, a compromise can be reached in pursuing the conflicting goals of maximizing processor usage and minimizing communications overhead. The algorithm is illustrated in application to a sample distributed system, showing how it is used for design parameter definition. The algorithm results in significant system improvement without requiring highly accurate estimation of processor loads.

关键词： System Performance bidding algorithm Computer Network Distributed algorithm Distributed Operation System Distributed System Load Balancing Process Migration

来源：评论

学校读者我要写书评

暂无评论

A new approach for integrating process planning with scheduling

引用

INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY 2011年第4期42卷 253-266页

作者： Yang, Weizhou Xu, Xun W. Univ Auckland Sch Engn Dept Mech Engn Auckland 1142 New Zealand

Integrated process planning with scheduling is a core activity in the manufacturing chain. Modern manufacturing processes require higher flexibility and capability of supporting distributed activities. In this paper, a novel STEP-NC Compliant Process Planning and Scheduling algorithm (STEP-NCPPSA) is proposed to meet such requirements. The STEP-NCPPSA utilises STEP-NC compliant data models to represent the related manufacturing information. STEP-NCPPSA aims to achieve an Integrated, Intelligent, Informative and Interoperable (I4) manufacturing in a distributed manufacturing environment. Three phases, STEP-NC initial process planning, initial bidding, and Tree-based Genetic algorithm optimisation are naturally integrated by the supporting STEP-NC concepts. STEP-NCPPSA is also capable of handling shop-floor information and re-process planning and scheduling to adapt to shop floor changes.

关键词： integrated process planning and scheduling STEP-NC based manufacturing feature-based process planning bidding algorithm tree-based genetic algorithm dynamic shop-floor changes

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：