Column generation for the discrete Unit Commitment problem with min-stop ramping constraints

12/13/2019
by   Nicolas Dupin, et al.
0

The discrete unit commitment problem with min-stop ramping constraints optimizes the daily production of thermal power plants (coal, gas, fuel units). For this problem, compact Integer Linear Programming (ILP) formulations have been designed to solve exactly small instances and heuristically real-size instances. This paper investigates whether Dantzig-Wolfe reformulation allows to improve the previous exact method and matheuristics. The extended ILP formulation is presented with the column generation algorithm to solve its linear relaxation. The experimental results show that the Dantzig-Wolfe reformulation does not improve the quality of the linear relaxation of the tightest compact ILP formulations. Computational experiments suggest also a conjecture which would explain such result: the compact ILP formulation of min-stop ramping constraints would be tight. Such results validate the quality of the exact methods and matheuristics based on compact ILP formulations previously designed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/23/2022

A Cut-and-solve Algorithm for Virtual Machine Consolidation Problem

The virtual machine consolidation problem (VMCP) attempts to determine w...
research
08/14/2019

Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data

We address the Interval Data Min-Max Regret 0-1 Integer Linear Programmi...
research
08/09/2023

Comparative analysis of mathematical formulations for the two-dimensional guillotine cutting problem

About ten years ago, a paper proposed the first integer linear programmi...
research
12/13/2018

Matheuristics to optimize maintenance scheduling and refueling of nuclear power plants

Scheduling the maintenances of nuclear power plants is a complex optimiz...
research
01/02/2022

Solving the signed Roman domination and signed total Roman domination problems with exact and heuristic methods

In this paper we deal with the signed Roman domination and signed total ...
research
10/01/2020

Arc Flow Formulations Based on Dynamic Programming: Theoretical Foundations and Applications

Network flow formulations are among the most successful tools to solve o...
research
08/18/2019

Computing Estimators of Dantzig Selector type via Column and Constraint Generation

We consider a class of linear-programming based estimators in reconstruc...

Please sign up or login with your details

Forgot password? Click here to reset