TITLE

An Integrated GA-ABC Optimization Technique to Solve Unit Commitment and Economic Dispatch Problems

AUTHOR(S)
Surekha, P.; Archana, N.; Sumathi, S.
PUB. DATE
August 2012
SOURCE
Asian Journal of Scientific Research;2012, Vol. 5 Issue 3, p93
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Unit Commitment (UC) and Economie Load Dispatch (ELD) problems are significant research areas to determine the economical generation schedule with ail generating unit constraints, such as unit ramp rates, unit minimum and maximum generation capabilities and minimum up-time and down-time. This study proposed a technique for solving the UC and ELD problems using bio-inspired techniques like Genetic Algorithm (GA) and Artificial Bee Colony (ABC) Optimization. The experiments are performed in two phases: UC phase and ELD phase. In the UC phase, a turn-on and turn-off schedule for a given combination of generating units is performed using GA, thus satisfying a set of dynamic operational constraints. During the second ELD phase, the pre-committed schedules are optimized and the optimal load is distributed among the scheduled units using ABC algorithm. The effectiveness of the proposed technique is investigated on two test Systems namely, IEEE 30 bus System and ten unit System. Experimental results prove that the proposed method is capable of yielding higher quality solution including mathematical simplicity, fast convergence, diversity maintenance, robustness and scalability for the complex UC-ELD problem
ACCESSION #
75899604

 

Related Articles

  • Multi-Area Unit Commitment with Transmission Losses Using Particle Swarm Optimization Approach. Selvi, S. Chitra; Devi, R. P. Kumudini; Rajan, C. Christober Asir // International Review of Electrical Engineering;May/Jun2012, Vol. 7 Issue 3, p4514 

    This paper presents a novel approach to solve the Multi-Area unit commitment problem using particle swarm optimization algorithm. The objective of the multi-area unit commitment problem is to determine the optimal or a near optimal commitment strategy for generating units located in multiple...

  • Non-Convex Economic Dispatch with Prohibited Operating Zones through Gravitational Search Algorithm. Hota, P. K.; Sahu, N. C. // International Journal of Electrical & Computer Engineering (2088;Dec2015, Vol. 5 Issue 6, p1234 

    This paper presents a new approach to the solution of optimal power generation for economic load dispatch (ELD) using gravitational search algorithm (GSA) when all the generators include valve point effects and some/all of the generators have prohibited operating zones. In this paper a...

  • Genetic Algorithm Based Simulated Annealing Method for Solving Unit Commitment Problem in Utility System. Rajan, C. Christober Asir // AIP Conference Proceedings;10/26/2010, Vol. 1298 Issue 1, p677 

    The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal generating unit commitment in the power system for the next H hours. Genetic...

  • A Unit Commitment Model with Implicit Reserve Constraint Based on an Improved Artificial Fish Swarm Algorithm. Wei Han; Hong-hua Wang; Xin-song Zhang; Ling Chen // Mathematical Problems in Engineering;2013, p1 

    An implicit reserve constraint unit commitment (IRCUC) model is presented in this paper. Different from the traditional unit commitment (UC) model, the constraint of spinning reserve is not given explicitly but implicitly in a trade-off between the production cost and the outage loss. An...

  • A New Heuristic Approach for Unit Commitment Problem Using Particle Swarm Optimization. Khorasani, Javid // Arabian Journal for Science & Engineering (Springer Science & Bu;Jun2012, Vol. 37 Issue 4, p1033 

    In this paper, a new method is proposed to solve unit commitment problem using particle swarm optimization. This method limits the search space considering demand information and the generation history of the generating units to solve the UC problem in an hourly basis. An expert system is...

  • A Memory Simulated Annealing Method to the Unit Commitment Problem with Ramp Constraints. Arif, S.; Mohammedi, R.; Hellal, A.; Choucha, A. // Arabian Journal for Science & Engineering (Springer Science & Bu;Jun2012, Vol. 37 Issue 4, p1021 

    This paper proposes an improved local search metaheuristic using simulated annealing method with memory component (MSA) for solving the unit commitment problem (UCP) with ramp constraints. The proposed method benefits simultaneously from the advantages of a two metaheuristics: acceptance of...

  • UNIT COMMITMENT SOLUTION USING GENETIC ALGORITHM BASED ON PRIORITY LIST APPROACH. SARJIYA; MULYAWAN, ARIEF BUDI; SUDIARSO, ANDI // Journal of Theoretical & Applied Information Technology;2/28/2015, Vol. 72 Issue 3, p394 

    This paper presents the completion of unit commitment (UC) problem using genetic algorithm based on priority list (GABPL) approach. The UC problem is divided into two sub problems. The problem of unit scheduling is solved by using GABPL method. The lambda iteration method is used for solving the...

  • Constrained Elitist Genetic Algorithm for Economic Load Dispatch: Case Study on Nigerian Power System. Orike, Sunny; Corne, David W. // International Journal of Computer Applications;Aug2013, Vol. 76 Issue 1-16, p27 

    The Economic Load Dispatch problem concerns the determination of the optimal combination of power generators' outputs with the lowest generation cost for a defined level of load. The problem arises from the fact that there are rated limits of generators' power output, fuel costs of power plants...

  • A Memetic Approach for Improving Minimum Cost of Economic Load Dispatch Problems. Jinho Kim; Chang Seob Kim; ZongWoo Geem // Mathematical Problems in Engineering;2014, p1 

    Economic load dispatch problem is a popular optimization problem in electrical power system field, which has been so far tackled by various mathematical and metaheuristic approaches including Lagrangian relaxation, branch and bound method, genetic algorithm, tabu search, particle swarm...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics