تعهد واحد حرارتی با استفاده از باینری / کد واقعی الگوریتم مصنوعی کلونی زنبور عسل
|کد مقاله||سال انتشار||تعداد صفحات مقاله انگلیسی||ترجمه فارسی|
|7412||2012||11 صفحه PDF||سفارش دهید|
نسخه انگلیسی مقاله همین الان قابل دانلود است.
هزینه ترجمه مقاله بر اساس تعداد کلمات مقاله انگلیسی محاسبه می شود.
این مقاله تقریباً شامل 8868 کلمه می باشد.
هزینه ترجمه مقاله توسط مترجمان با تجربه، طبق جدول زیر محاسبه می شود:
- تولید محتوا با مقالات ISI برای سایت یا وبلاگ شما
- تولید محتوا با مقالات ISI برای کتاب شما
- تولید محتوا با مقالات ISI برای نشریه یا رسانه شما
پیشنهاد می کنیم کیفیت محتوای سایت خود را با استفاده از منابع علمی، افزایش دهید.
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Electric Power Systems Research, Volume 84, Issue 1, March 2012, Pages 109–119
This paper presents a binary/real coded artificial bee colony (BRABC) algorithm to solve the thermal unit commitment problem (UCP). A novel binary coded ABC with repair strategies is used to obtain a feasible commitment schedule for each generating unit, satisfying spinning reserve and minimum up/down time constraints. Economic dispatch is carried out using real coded ABC for the feasible commitment obtained in each interval. In addition, non-linearities like valve-point effect, prohibited operating zones and multiple fuel options are included in the fuel cost functions. The effectiveness of the proposed algorithm has been tested on a standard ten-unit system, on IEEE 118-bus test system and IEEE RTS 24 bus system. Results obtained show that the proposed binary ABC is efficient in generating feasible schedules.
Unit commitment is a nonlinear mixed integer optimization problem to schedule the operation of the generating units at minimum operating cost satisfying the demand and other equality and inequality constraints. UCP is to find the commitment schedule (on/off status of generators) and thereby the power output level of each committed generating unit. This scheduling has to be done daily for the time interval planned (hourly or for every five minutes) for dispatch in order to minimize the total fuel cost. Minimization of total cost which includes the fuel cost, start up, and shut down cost is carried out by satisfying various system and unit constraints. The UCP is formulated as a mixed integer-programming problem and it is computationally expensive to solve for large power systems. Many solution strategies are available to solve the UCP and the ED problem. A literary review of UCP and the solution techniques are given in Refs.  and . Techniques like priority list method , dynamic programming , mixed integer programming , branch and bound ,  and Lagrangian relaxation  are the widely used conventional techniques. The priority list method is simple and fast. However, it produces suboptimal solution with higher operation cost. Dynamic programming method has dimensionality problem. That is with increase in problem size, the solution time increases rapidly with the number of generating units to be committed. Though LR method provides a fast solution, it suffers from numerical convergence and the solution quality due to the dual nature of the algorithm is poor. In branch-and-bound method, the computational time increases enormously for a large-scale power system. So, artificial intelligence techniques like, neural networks , expert systems , genetic algorithm  and  simulated annealing , evolutionary programming , tabu search , fuzzy logic , particle swarm optimization  and  and ant colony optimization  are used. These are population based search techniques and can search for the global or near global optimal solution for any large-scale system incorporating all system constraints with ease. In expert system, interaction with the plant operators are required making it inconvenient for a realistic system. Though GA, EP, SA and ACO are able to obtain near optimal solution, for a large power system the computational time is quiet high. Though many techniques are developed to solve UCP, no technique has been accepted as the best so far. In this context, an attempt is made to solve UCP using a newly developed novel binary artificial bee colony (ABC) algorithm. In this paper, binary ABC algorithm is proposed to solve the UCP and the real-coded ABC algorithm is used to solve the economic dispatch problem. In addition to the quadratic cost functions generally used for representing the fuel cost functions, non-linearities due to valve-point loading, prohibited operating zone and multiple fuel options are also incorporated. The algorithm presented in this paper is validated on a standard ten-unit system taken from the literature, IEEE 118-bus system and IEEE RTS 24 bus system. From the results, it can be inferred that the BRABC algorithm performs well.
نتیجه گیری انگلیسی
In this paper, a novel binary ABC method is proposed to solve the UC problem. For a feasible commitment schedule, economic dispatch is performed using real coded ABC. The applicability and feasibility of this method is validated on 10-unit system and IEEE 118-bus system with 54 thermal units and also on IEEE RTS 24 bus system. Non-linearities introduced by valve-point loading, multiple fuel options and prohibited operating zones are incorporated in the fuel cost functions. Repair strategies are used for violation of minimum up/down time and power balance constraints. The comprehensive numerical results demonstrate the successful implementation and feasibility of the proposed technique even for a larger test case with non-linearities in the fuel cost function. The proposed binary ABC performs better in terms of solution quality and can be used for any large scale systems.