An adaptive modified firefly algorithm to unit commitment problem for large-scale power systems


  • A. Rastgou Department of Electrical Engineering, Kermanshah Branch, Islamic Azad University, Kermanshah, Iran
  • S. Bahramara Department of Electrical Engineering, Sanandaj Branch, Islamic Azad University, Sanandaj, Iran

Unit commitment (UC) problem tries to schedule output power of generation units to meet the system demand for the next several hours at minimum cost. UC adds a time dimension to the economic dispatch problem with the additional choice of turning generators to be on or off.  In this paper, in order to improve both the exploitation and exploration abilities of the firefly algorithm (FA), a new modification approach based on the mutation and crossover operators as well as an adaptive formulation is applied as an adaptive modified firefly algorithm (AMFA). In this paper, it is shown that AMFA can solve the UC problem in a better manner compared to the other meta-heuristic methods. The method is applied on some case studies, a typical 10-unit test system, 12, 17, 26, and 38 generating unit systems, and IEEE 118-bus test system, all with a 24-hour scheduling horizon. Comparison of the obtained results with the other methods addressed in the literature shows the effectiveness and fastness of the applied method.

برای دانلود باید عضویت طلایی داشته باشید

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the Unit Commitment Problem Using Modified Imperialistic Competition Algorithm

One of the most important problems for power system operation is unit commitment (UC), for which different constraints should be satisfied. UC is a nonlinear and large-scale problem; thus, using the evolutionary algorithms has been considered for solving the problem. In this paper, the solution of the UC problem was investigated using Modified Imperialistic Competition Algorithm (MICA).  Simula...

متن کامل

Decomposition algorithm for large-scale two-stage unit-commitment

Everyday, electricity generation companies submit a generation schedule to the grid operator for the coming day; computing an optimal schedule is called the unit-commitment problem. Generation companies can also occasionally submit changes to the schedule, that can be seen as intra-daily incomplete recourse actions. In this paper, we propose a two-stage formulation of unit-commitment, wherein b...

متن کامل

Large-scale Unit Commitment under uncertainty

The Unit Commitment problem in energy management aims at finding the optimal productions schedule of a set of generation units while meeting various system-wide constraints. It has always been a large-scale, non-convex difficult problem, especially in view of the fact that operational requirements imply that it has to be solved in an unreasonably small time for its size. Recently, the ever incr...

متن کامل

Modified Ant Colony Optimization Technique for Solving Unit Commitment Problem

Ant colony optimization (ACO) which is inspired by the natural behavior of ants in finding the shortest path to food is appropriate for solving the combinatorial optimization problems. Therefore, it is used to solve the unit commitment problem (UCP) and attain the minimum cost for scheduling thermal units in order to produce the demand load. In this paper modified ACO (MACO) is used to solve th...

متن کامل

Security-Constrained Unit Commitment Considering Large-Scale Compressed Air Energy Storage (CAES) Integrated With Wind Power Generation

Environmental concerns and depletion of nonrenewable resources has made great interest towards renewable energy resources. Cleanness and high potential are factors that caused fast growth of wind energy. However, the stochastic nature of wind energy makes the presence of energy storage systems (ESS) in wind integrated power systems, inevitable. Due to capability of being used in large-scale sys...

متن کامل

Modified Firefly Algorithm

Firefly algorithm is one of the new metaheuristic algorithms for optimization problems. The algorithm is inspired by the flashing behavior of fireflies. In the algorithm, randomly generated solutions will be considered as fireflies, and brightness is assigned depending on their performance on the objective function. One of the rules used to construct the algorithm is, a firefly will be attracte...

متن کامل

ذخیره در منابع من

ذخیره در منابع من ذخیره شده در منابع من

{@ msg_add @}

  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی راحت تر خواهید کرد

دانلود متن کامل

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 9  شماره 1

صفحات  68- 79

تاریخ انتشار 2021-04-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

copyright © 2015-2021