A Primal-Proximal Heuristic Applied to the Unit-Commitment Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2003

A Primal-Proximal Heuristic Applied to the Unit-Commitment Problem

Abstract

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 primal proximal algorithm. This second step comes as an alternative to an earlier approach based on augmented Lagrangian (i.e. a dual proximal algorithm). We illustrate the method with some real-life numerical results. A companion paper is devoted to a theoretical study of the heuristic in the second phase.
Fichier principal
Vignette du fichier
RR-4978.pdf (215.81 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00071600 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071600 , version 1

Cite

Louis Dubost, Robert Gonzalez, Claude Lemaréchal. A Primal-Proximal Heuristic Applied to the Unit-Commitment Problem. [Research Report] RR-4978, INRIA. 2003. ⟨inria-00071600⟩
555 View
543 Download

Share

Gmail Facebook X LinkedIn More