A solution to the unit commitment problem—a review

Saravanan, B.; Das, Siddharth; Sikri, Surbhi; Kothari, D.P.

doi:10.1007/s11708-013-0240-3

Cited by 174 publications

(101 citation statements)

References 54 publications

Supporting

Mentioning

100

Contrasting

Unclassified

Order By: Relevance

“…Sendaula and Biswas (1993) developed model that attempt to solve the UC problem and ELD problem simultaneously. UC is deciding out of the current electrical resources to fulfil the load demand and allocate margin of operating reserve over a considerable amount of time (Saravanan et al, 2013). UC problems are usually modelled as MILP problems with some binary variables.…”

Section: Unit Commitmentmentioning

confidence: 99%

Policy-based unit commitment problem: a case in a peaking power generation plant

Jr.

Santillan

Senen

et al. 2017

IJADS

View full text Add to dashboard Cite

Unit commitment (UC) along with economic load dispatch (ELD) is an integral optimisation problem in the power generation industry. In this paper, policy-based algorithms are developed to address dispatch problems under different system configurations with the benefit of providing flexibility in addressing several desired policies of decision-makers. A case study is conducted in a diesel-fired, power plant in central Philippines to elucidate the proposed approach. Three policies were created to effectively address the optimisation problem: 1) classic UC model; 2) buying and selling strategy; 3) continuous loading strategy with various issues being considered. Results show that the strategies exhibit a significant decrease in total costs and ease of implementation with respect to the current production schedule of the case firm. Furthermore, the second policy provides the least generated cost which implies that generating firms must consider the option to sell power when market prices reach desired levels.

show abstract

Section: Unit Commitmentmentioning

confidence: 99%

Policy-based unit commitment problem: a case in a peaking power generation plant

Jr.

Santillan

Senen

et al. 2017

IJADS

View full text Add to dashboard Cite

show abstract

“…In literature, different solutions using numerical optimization techniques have been proposed to solve the unit commitment problem such as dynamic programming [26], priority list [27], Bender decomposition [28], mixed integer programming [29], exhaustive enumeration and branch and bound method [27,32] etc., Bio inspired techniques using genetic algorithm [33], particle swarm optimization (PSO) [34], bacterial foraging problem (BFOA) [35], ant colony optimization (ACO) [36] , simulated annealing [37], shuffled frog optimization algorithm (SFLA) [38], invasive weed optimisation [51], etc. The exhaustive enumeration method is a simple combination technique, suffers with high computation time [27].…”

Section: Introductionmentioning

confidence: 99%

“…The exhaustive enumeration method is a simple combination technique, suffers with high computation time [27]. Lagrange Relaxation (LR) is fast and flexible, but it suffers in sub optimality [27,[29][30][31]. Branch and bound is a general optimization algorithm used in discrete and combinatorial optimization [27,32].…”

Section: Introductionmentioning

confidence: 99%

“…Lagrange Relaxation (LR) is fast and flexible, but it suffers in sub optimality [27,[29][30][31]. Branch and bound is a general optimization algorithm used in discrete and combinatorial optimization [27,32]. Priority list is fast, but highly heuristic and gives more operating cost [27].…”

Section: Introductionmentioning

confidence: 99%

“…Branch and bound is a general optimization algorithm used in discrete and combinatorial optimization [27,32]. Priority list is fast, but highly heuristic and gives more operating cost [27]. Dynamic Programming is good for a variety of sizes, but more complex hence the computation time more [27].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Novel Imperialistic Competitive Algorithm for Unit Commitment with Wind Generation

Sudhakar¹,

Balasubramanian²,

Padmanaban³

2018

IJIES

View full text Add to dashboard Cite

Abstract:The integration of wind power to the grid is essential to meet the growing power demand and possess a challenge to unit commitment to meet the load demand at low cost for scheduling the generating units. A new imperialistic competitive algorithm (ICA) has been developed for the above mentioned unit commitment problem for solving deterministic and stochastic condition. This imperialistic competitive algorithm has been developed with constraints, including generation limits, start up and shut down cost, minimum up and downtime along with ramp constraint. The ICA has been studied initially on the 10 units 24 hour system and 40 units 24 hour system for the deterministic load. Later, a wind generator has been added to the 10 units 24 hour system with wind data for 24 hours and the results are compared with genetic algorithm (GA), particle swarm optimization (PSO), hybrid particle swarm optimisation (HPSO), shuffled frog leaping algorithm (SFLA), invasive weed optimization (IWO). The comparison result is presented in this paper and it shows that the ICA gives optimized fuel cost of $482246.2 which is less than the LR, GA, BFOA, SFLA, IWO for stochastic unit commitment.

show abstract

Algorithms for OptimalACPower Flow in the Presence of Renewable Sources

Chamanbaz

Dabbene

Lagoa

2019

Wiley Encyclopedia of Electrical and Electronics Engineering

View full text Add to dashboard Cite

This chapter presents recent solutions to the optimal power flow (OPF) problem in the presence of renewable energy sources (RES), such as solar photo-voltaic and wind generation. After introducing the original formulation of the problem, arising from the combination of economic dispatch and power flow, we provide a brief overview of the different solution methods proposed in the literature to solve it. Then, we explain the main difficulties arising from the increasing RES penetration, and the ensuing necessity of deriving robust solutions. Finally, we present the state-of-the-art techniques, with a special focus on recent methods we developed, based on the application on randomization-based methodologies.

show abstract

A solution to the unit commitment problem—a review

Cited by 174 publications

References 54 publications

Policy-based unit commitment problem: a case in a peaking power generation plant

Policy-based unit commitment problem: a case in a peaking power generation plant

A Novel Imperialistic Competitive Algorithm for Unit Commitment with Wind Generation

Algorithms for OptimalACPower Flow in the Presence of Renewable Sources

Contact Info

Product

Resources

About