A profit-based unit commitment GA for the competitive environment Export

@article{citeulike:712138, abstract = {As the electrical industry restructures, many of the traditional algorithms for controlling generating units need modification or replacement, previously utilized to schedule generation units in a manner that minimizes costs while meeting all demand, the unit commitment (UC) algorithm must be updated. A UC algorithm that maximizes profit will play an essential role in developing successful bidding strategies for the competitive generator. Simply bidding to win contracts is insufficient; bidding strategies must result in contracts that, on average, cover the total generation costs. No longer guaranteed to be the only electricity supplier, a generation company's share of the demand will be more difficult to predict than in the past. Removing the obligation to serve softens the demand constraint. In this paper the authors provide a price/profit-based UC formulation which considers the softer demand constraint and allocates fixed and transitional costs to the scheduled hours. The authors describe a genetic algorithm solution to this new UC problem and present results for an illustrative example}, author = {Richter, C. W. and Sheble, G. B.}, citeulike-article-id = {712138}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=867164}, journal = {Power Systems, IEEE Transactions on}, keywords = {energy, genetic-algorithms, unit-commitment}, number = {2}, pages = {715--721}, posted-at = {2006-06-27 13:10:42}, priority = {5}, title = {A profit-based unit commitment GA for the competitive environment}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=867164}, volume = {15}, year = {2000} }

TY - JOUR ID - citeulike:712138 L3 - citeulike-article-id:712138 N2 - As the electrical industry restructures, many of the traditional algorithms for controlling generating units need modification or replacement, previously utilized to schedule generation units in a manner that minimizes costs while meeting all demand, the unit commitment (UC) algorithm must be updated. A UC algorithm that maximizes profit will play an essential role in developing successful bidding strategies for the competitive generator. Simply bidding to win contracts is insufficient; bidding strategies must result in contracts that, on average, cover the total generation costs. No longer guaranteed to be the only electricity supplier, a generation company's share of the demand will be more difficult to predict than in the past. Removing the obligation to serve softens the demand constraint. In this paper the authors provide a price/profit-based UC formulation which considers the softer demand constraint and allocates fixed and transitional costs to the scheduled hours. The authors describe a genetic algorithm solution to this new UC problem and present results for an illustrative example IS - 2 JF - Power Systems, IEEE Transactions on EP - 721 TI - A profit-based unit commitment GA for the competitive environment VL - 15 SP - 715 KW - energy KW - genetic-algorithms KW - unit-commitment AU - Richter, CW AU - Sheble, GB PY - 2000/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=867164 ER -