期刊名称：International Journal of Soft Computing & Engineering
电子版ISSN：2231-2307
出版年度：2013
卷号：2
期号：6
页码：83-88
出版社：International Journal of Soft Computing & Engineering
摘要：In a restructured power market, traditional scheduling of generating units needs modification. The classical unit commitment problem aims at minimizing the operation costs by satisfying the forecasted electricity load. However, under new structure, Generation companies (GENCOs) schedule their generators with an objective to maximize their own profit by relaxation of the demand fulfillment constraint and without any regard for system social profit, to match the competitive market. A Unit Commitment algorithm with capability of profit maximization plays a significant role in successful development bidding strategies of a competitive generator. In such an environment, power price turns into an important factor in decision process. In this paper the authors utilized a new heuristic technique called Imperialistic Competitive Algorithm (ICA) to exert Profit Based Unit Commitment (PBUC) problem. In fact, the presented approach assists GENCOs to make a decision, how to schedule generators in order to gain the maximum profit by selling adequate amounts of power in power market. The effectiveness of the proposed method to solve generation scheduling optimization problem in a day-ahead deregulated electricity market is validated on 10 generating unit systems available in the literature. Comparison of results obtained from simulation verifies the ability of proposed method.
