Parallel matheuristics for the discrete unit commitment problem with min-stop ramping constraints
نویسندگان
چکیده
منابع مشابه
A new method for unit commitment with ramping constraints
Unit commitment with ramping constraints is a very difficult problem with significant economic impact. A new method is developed in this paper for scheduling units with ramping constraints within Lagrangian relaxation framework based on a novel formulation of the discrete states and the integrated applications of standard dynamic programming for determining the optimal discrete states across ho...
متن کاملSolving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
We present a dynamic programming algorithm for solving the single-unit commitment (1UC) problem with ramping constraints and arbitrary convex cost functions. The algorithm is based on a new approach for efficiently solving the single-unit economic dispatch (ED) problem with ramping constraints and arbitrary convex cost functions, improving on previously known ones that were limited to piecewise...
متن کاملParallel Processing Implementation of the Unit Commitment Problem with Full AC Power Flow Constraints
In this paper, the authors describe a parailel implementation of the Lagrangian Relaxation Algorithm with variable duplication for the thermal unit commitment problem. The formulation was previously reported bp the authors and allows inclusion of the full nonlinear AC’ network power flow model, which permits addressing voltage limits, as well as more realistic branch flow limits than is possibl...
متن کاملThe Ramping Polytope and Cut Generation for the Unit Commitment Problem
We present a perfect formulation for a single generator in the unit commitment problem, inspired by the dynamic programming approach taken by Frangioni and Gentile. This generator can have characteristics such as ramp up/down constraints, time-dependent start-up costs, and start-up/shut-down limits. To develop this perfect formulation we extend the result of Balas on unions of polyhedra to pres...
متن کاملGenerating Cuts from the Ramping Polytope for the Unit Commitment Problem
We present a perfect formulation for a single generator in the unit commitment problem, inspired by the dynamic programming approach taken by Frangioni and Gentile. This generator can have characteristics such as ramping constraints, time-dependent start-up costs, and start-up/shut-down ramping. To develop this perfect formulation we extend the result of Balas on unions of polyhedra to present ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Transactions in Operational Research
سال: 2018
ISSN: 0969-6016
DOI: 10.1111/itor.12557