نتایج جستجو برای: unit commitment problem
تعداد نتایج: 1270332 فیلتر نتایج به سال:
Optimization is the art of obtaining optimum result under given circumstances. In design, construction and maintenance of any engineering system, Engineers have to take many technological and managerial decisions at several stages. The ultimate goal of all such decisions is to either maximize the desired benefit or to minimize the effort or the cost required. This paper shows a memetic algorith...
In recent years, metaheuristics have been applied with some success to the Unit Commitment (UC) problem. Methods like Simulated Annealing, Tabu Search and Evolutionary Programming can be found in several papers, presenting results that are sufficiently interesting to justify further research in the area. In this paper, a new metaheuristic approach based on GRASP Greedy Randomized Adaptive Searc...
Optimization of the power system plays a major role in power system planning. Unit Commitment and Economic Dispatching are the most important part of every plant-planning project. Unit Commitment is the problem that searches the economical way for power generation, when the power consumption and altered constraints of the power plants are considered. Recently, the attention of the environmental...
This paper provides the convex hull description for the basic operation of slowand quick-start units in power-based unit commitment (UC) problems. The basic operating constraints that are modeled for both types of units are (1) generation limits and (2) minimum up and down times. Apart from this, the startup and shutdown processes are also modeled, using (3) startup and shutdown power trajector...
Unit Commitment is a fundamental problem in power systems engineering, deciding which generating units to switch on, and when to switch them on, in order to efficiently meet anticipated demand. It has traditionally been solved as a Mixed Integer Programming (MIP) problem but upcoming changes to the power system drastically increase the MIP solution time. In this paper, we discuss the benefits t...
This paper presents and identifies alternative strategies with the advantages of Genetic Algorithm for solving the Thermal Unit Commitment (UC) problem. A Parallel Structure has been developed to handle the infeasibility problem in a structured and improved Genetic Algorithm (GA) which provides an effective search and therefore greater economy. In addition, this proposed method lead us to obtai...
In this paper, BAT Algorithm is proposed to solve thermal unit commitment (UC) problem. The objective of UC is to determine the optimal generation of the committed units to meet the load demand and spinning reserve at each time interval, such that the overall cost of generation is minimized, while satisfying different operational constraints. BAT is a new cooperative agents approach, which is i...
This paper is devoted to the numerical resolution of unit-commitment problems. More precisely we present the French model optimizing the daily production of electricity. Its resolution is done is two phases: first a Lagrangian relaxation solves the dual to find a lower bound; it also gives a primal relaxed solution. The latter is used in the second phase for a heuristic resolution based on a pr...
Large scale power systems Unit Commitment (UC) is a complicated, hard limit, mixed integer combinatorial and nonlinear optimization problem with many constraints. This paper presents an innovative and effective solution based on modification of the Harmony Search (HS) Algorithm to solve the strategic planning of Generating unit's commitment. The proposed algorithm is easy in application compare...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید