نتایج جستجو برای: unit commitment problem

تعداد نتایج: 1270332  

2011
A. Ameli A. Safari H. A. Shayanfar

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...

Journal: :Operations Research 2016
Álvaro Lorca X. Andy Sun Eugene Litvinov Tongxin Zheng

The growing uncertainty associated with the increasing penetration of wind and solar power generation has presented new challenges to the operation of large-scale electric power systems. Motivated by these challenges, we present a multistage adaptive robust optimization model for the most critical daily operational problem of power systems, namely the unit commitment (UC) problem, in the situat...

2015
Semih Atakan Guglielmo Lulli Suvrajeet Sen

In this paper, we present an MIP formulation for the Unit Commitment problem that leads to significant computational time savings and almost-integral solutions when compared to the state-of-the-art formulations in the literature. Using a variety of test instances from the literature, we provide empirical evidence that the polyhedral structure of the new formulation is tighter than the polyhedra...

2012
V. P. Arunachalam R. Subramanian

The fuzzy logic has been applied in combination with Genetic Algorithm (GA) to solve the unit commitment problem (UCP). For smooth and better convergence in GA, the crossover probability and mutation rate are adjusted by fuzzy logic strategy leading to an improved GA technique termed as Fuzzy Logic Controlled Genetic Algorithm (FLCGA). An FLCGA for determining the solution for this UCP has been...

2011
Barry Rountree

I show how the unit commitment problem may be recast to a jobscheduling problem amenable to a linear programming solution. While this will require a much larger memory footprint than an equivalent mixed integer programming model, I hope to show that the LP approach lead to both faster time-to-solution and greater numerical stability. 1 The Unit Commitment Problem At its most basic, the unit com...

Journal: :مهندسی برق و الکترونیک ایران 0
m. pourakbari-kasmaei m. rashidi-nejad s. piltan

this paper proposes a novel technique for solving generation scheduling and ramp rate constrained unit commitment. a modified objective function associated with a new start-up cost term is introduced in this paper. the proposed method is used to solve generating scheduling problem satisfying srr, minimum up and down time as well as ramp rate constraints. two case studies are conducted to implem...

Journal: :TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES 2016

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید