English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Solving unit commitment (UC) problem is one of the most critical tasks in electric power system operations. Therefore, proposing an accurate method to solve this problem is of great interest. The original bacterial foraging (BF) optimization algorithm suffers from poor convergence characteristics for larger constrained optimization problems. In addition, the stopping criterion used in the original BF increases the computation burden of the original algorithm in many cases. To overcome these drawbacks, a hybridized adaptive bacterial foraging and genetic algorithm (HABFGA) approach is proposed in this paper to solve the unit commitment problem with ramp rate constraint. The HABFGA approach can be derived by combining adaptive stopping criterion, BF algorithm and genetic algorithm, so that the drawbacks of original BF algorithm can be treated before employing it to solve the complex UC problem. To illustrate the effectiveness of the HABFGA approach, several standard and real test systems with different numbers of generating units are used. The results of HABFGA approach are compared with the results obtained using other published methods employing same test systems. This comparison shows the effectiveness and the superiority of the proposed method over other published methods. نا ةلكشم لح ةمهاسم ديدحت ديلوتلا تادحو داحرملا لدالم دوايي اابتعلإا ىف ذخلأا عم نام واملاا ىاف اداد ةاماهلا ةاقي ط ايبكلا مامتهلإا تاذ وملأا نم ةلكشملا هذه لحل هقييد هقي ط حا تيإ نإف كلذل ،ةيب هكلا ىوقلا مظر ليغشت ةلكشم نم ىرالت ةيلصلأا ىموث دلا مالطلا نع ثحبلا مدختاسملا مايوتلا اايلم نا ىالا ةفااضلإاب ءىطبلا ب اقتلا لكاشملا هذه لحل ةيلصلأا ةيمز اوخلل تاباسحلا نمز نم ديزي كالذو هاريده ىالثم ةقي ط حا تيإ مت ثحبلا اذه ىف فيكتلا ىموث دلا مالطلا نع ثحبلا ةقي ط جمدب ي ،ةايريدلا ةيمز اوخلا عم ه ط بوايع ىالع بالغتلا متاي ىلااتلابو ةاقي ةلكشم لح ىف اهمادختسا لبي ةيلصلأا ىموث دلا مالطلا نع ثحبلا ةمهاسم ديدحت داقلملا دايلوتلا تاداحو ميايقت مات مادختساب ةح تقملا ةقي طلا ءادأ ةايقيقح ى اخأو ةيسايي ةمظرأ عام ج ااترلا ةار اقم و تاتبثأ واشرملا ا اطلا الب خلأا ا طلا ىلع ةح تقملا ةقي طلا اوفت ج اترلا ةر اقملا ىف ةمدختسملا ى

UNIT COMMITMENT PROBLEM WITH RAMP RATE CONSTRAINT USING NEW HYBRIDIZED ADAPTIVE OPTIMIZATION METHOD