A Lagrangian Decomposition Model for Unit Commitment Problem
نویسندگان
چکیده
منابع مشابه
A Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem
In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, caused consequently, increase the air pollution. In this paper, two green approaches are introduced which demand is the main uncertain parameter in both. These approaches are addressed to provide a trade-off b...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Lagrangian Relaxation Neural Network for Unit Commitment
This paper presents a novel method for unit commitment by synergistically combining Lagrangian relaxation for constraint handling with Hopfield-type recurrent neural networks for fast convergence to the minimum. The key idea is to set up a Hopfieldtype network using the negative dual as its energy function. This network is connected to “neuron-based dynamic programming modules” that make full u...
متن کاملSolving the Hydrothermal Unit Commitment Problem via Lagrangian Relaxation and Augmented Lagrangian
This paper considers the hydrothermal unit commitment problem of power systems with high proportion of hydraulic generation. In this sense, a large-scale mixed-integer nonlinear programming problem for the two day cost-optimal generation of system is developed. The model involves a large number of mixed-integer decision variables and constraints linking time periods and operation units. A Lagra...
متن کاملA Hybrid Genetic Algorithm Based Lagrangian Relaxation Approach for Profit Based Unit Commitment Problem
In this paper an application of a combined method for the profit based unit commitment problem (PBUC) using Genetic Algorithm and Lagrangian Relaxation (LR) is presented. The algorithm is proposed to solve PBUC under deregulated environment with the objective of maximizing GENCO’s profit and minimizing the operating cost. The problem formulation of the unit commitment takes into consideration t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/6156-8550