from    
to    
search  

 


Assembly of Lightweight and Multi-Material Systems
全球变化科学紫荆论坛第429期:The importance of governance and public particip...
车辆与运载学院296期学术沙龙-从诺贝尔奖获奖潮看日本高校的教育,科研和创新
【低维量子物理国家重点实验室杰出学者讲座】Ultrafast Microscopy of Structured ...
报告题目:
Optimal Auctions for Deregulated Electricity Market
 报告人:
陆宝森
美国康涅狄格大学讲座教授
电子与计算机工程系主任
清华大学访问教授
IEEE fellow
报告时间:
2007-06-04 14:30
报告地点:
中央主楼511会议室
主办单位:
做到互相学术委员会
  简介:
Abstract
 
In deregulated electricity markets, auction mechanisms are used to select supply bids for energy and ancillary services.  Currently, most Independent System Operators in the US use a "bid cost minimization" auction mechanism that minimizes total supply bid costs to select bids, and afterwards settle the market based on market-clearing prices.  Consequently, the consumer payments could be significantly higher than the minimized bid cost from the auction.  This gives rise to "payment cost minimization," an alternative auction mechanism that directly minimizes consumer payments.  A review of literature shows that with the same set of supply bids, payment cost minimization leads to reduced consumer payments as compared to bid cost minimization.  While methods for minimizing offer costs abound, limited approaches for minimization of payment costs have been reported.  This talk presents an effective method for directly minimizing payment costs.  In view of the specific features of the problem including the non-separability of its objective function, the discontinuity of offer curves, and the maximum term in defining MCPs, our key idea is to use augmented Lagrangian relaxation, and to form and solve offer and MCP subproblems by using the surrogate optimization framework.  Numerical testing results demonstrate that the method is effective, and the resulting payment costs are significantly lower than what are obtained by minimizing the offer costs for a given set of offers.  Additionally, strategic behaviors of suppliers are studied within the game theoretic framework for the two auction mechanisms.  General matrix games are solved by using the approximate Nash concept and with our auction algorithms developed as the core.  Testing results demonstrate the cost savings for consumers under payment cost minimization as compared to bid cost minimization.
 
演讲人简历:Peter B. Luh received his B.S. in Electrical Engineering from National Taiwan University, M.S. in Aeronautics and Astronautics from M.I.T., and Ph.D. in Applied Mathematics from Harvard University.  He has been with the University of Connecticut since 1980, and currently is the SNET Professor of Communications & Information Technologies and Head of the Department of Electrical and Computer Engineering.  He is a Fellow of IEEE, the founding Editor-in-Chief of the new IEEE Transactions on Automation Science and Engineering, an Associate Editor of IIE Transactions on Design and Manufacturing, was the Editor-in-Chief of IEEE Transactions on Robotics and Automation (1999-2003), and Publications Vice President Elect of IEEE Robotics and Automation Society. 
今日相关信息
全球科技展望--开发和应用科学技术的远景
报网互动的发展前景
 
同类别相关信息
清华信息大讲堂第111讲-三星第9讲:Mac...
动物伦理学与护生文化系列讲座:从校园动...
清华信息大讲堂第110讲-三星第8讲:Cog...
Recent Developments on Image and Vi...
Machine Learning to Visual Big Data...
学术活动