scholarly journals A New Approach for Solving the Unit Commitment Problem by Cuckoo Search Algorithm

2013 ◽  
Vol 6 (9) ◽  
pp. 1-7
Author(s):  
Alireza Gharegozi
2017 ◽  
pp. 1113-1144
Author(s):  
K. Chandrasekaran ◽  
Sishaj P. Simon

A new nature inspired metaheuristic algorithm known as the cuckoo search algorithm (CSA) is presented in this paper, to solve the unit commitment problem (UCP) for hybrid power system. The utilization of wind energy sources is increasing throughout the world. It is therefore important to develop the protocol for the integration of wind generation system with conventional thermal unit generation system. High wind penetration can lead to high-risk level in power system reliability. In order to maintain the system reliability, wind power dispatch is usually restricted and energy storage is considered for smoothing out the fluctuations. On solving UCP, the proposed binary coded CSA finds the ON/OFF status of the generating units while the economic dispatch problem (EDP) is solved using the real coded CSA. The proposed methodology is tested and validated on 3, 4, 9, 12 38 and 100 unit systems for 24 hour scheduling horizon. The effectiveness of the proposed technique is demonstrated by comparing its performance with the other methods reported in the literature.


Author(s):  
K. Chandrasekaran ◽  
Sishaj P. Simon

A new nature inspired metaheuristic algorithm known as the cuckoo search algorithm (CSA) is presented in this paper, to solve the unit commitment problem (UCP) for hybrid power system. The utilization of wind energy sources is increasing throughout the world. It is therefore important to develop the protocol for the integration of wind generation system with conventional thermal unit generation system. High wind penetration can lead to high-risk level in power system reliability. In order to maintain the system reliability, wind power dispatch is usually restricted and energy storage is considered for smoothing out the fluctuations. On solving UCP, the proposed binary coded CSA finds the ON/OFF status of the generating units while the economic dispatch problem (EDP) is solved using the real coded CSA. The proposed methodology is tested and validated on 3, 4, 9, 12 38 and 100 unit systems for 24 hour scheduling horizon. The effectiveness of the proposed technique is demonstrated by comparing its performance with the other methods reported in the literature.


2011 ◽  
Vol 62 (1) ◽  
pp. 11-18 ◽  
Author(s):  
C. Christober ◽  
Asir Rajan

An Evolutionary Programming Based Tabu Search Method for Unit Commitment Problem with Cooling-Banking Constraints This paper presents a new approach to solve the short-term unit commitment problem using An Evolutionary Programming Based tabu search method with cooling and banking constraints. Numerical results are shown comparing the cost solutions and computation time obtained by using the evolutionary programming method and other conventional methods like dynamic programming, lagrangian relaxation.


Author(s):  
Rachid Habachi ◽  
Achraf Touil ◽  
Abdelkabir Charkaoui ◽  
Abdelwahed Echchatbi

<p>Eagle strategy is a two-stage optimization strategy, which is inspired by the observation of the hunting behavior of eagles in nature. In this two-stage strategy, the first stage explores the search space globally by using a Levy flight; if it finds a promising solution, then an intensive local search is employed using a more efficient local optimizer, such as hillclimbing and the downhill simplex method. Then, the two-stage process starts again with new global exploration, followed by a local search in a new region. One of the remarkable advantages of such a combina-tion is to use a balanced tradeoff between global search (which is generally slow) and a rapid local search. The crow search algorithm (CSA) is a recently developed metaheuristic search algorithm inspired by the intelligent behavior of crows.This research article integrates the crow search algorithm as a local optimizer of Eagle strategy to solve unit commitment (UC) problem. The Unit commitment problem (UCP) is mainly finding the minimum cost schedule to a set of generators by turning each one either on or off over a given time horizon to meet the demand load and satisfy different operational constraints. There are many constraints in unit commitment problem such as spinning reserve, minimum up/down, crew, must run and fuel constraints. The proposed strategy ES-CSA is tested on 10 to 100 unit systems with a 24-h scheduling horizon. The effectiveness of the proposed strategy is compared with other well-known evolutionary, heuristics and meta-heuristics search algorithms, and by reported numerical results, it has been found that proposed strategy yields global results for the solution of the unit commitment problem.</p><p> </p>


Sign in / Sign up

Export Citation Format

Share Document