Back to Search
Start Over
A primal-proximal heuristic applied to the French Unit-commitment problem.
- Source :
-
Mathematical Programming . Sep2005, Vol. 104 Issue 1, p129-151. 23p. 5 Charts, 8 Graphs. - Publication Year :
- 2005
-
Abstract
- This paper is devoted to the numerical resolution of unit-commitment problems, with emphasis on the French model optimizing the daily production of electricity. The solution process has two phases. First a Lagrangian relaxation solves the dual to find a lower bound; it also gives a primal relaxed solution. We then propose to use the latter 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00255610
- Volume :
- 104
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Mathematical Programming
- Publication Type :
- Academic Journal
- Accession number :
- 17997313
- Full Text :
- https://doi.org/10.1007/s10107-005-0593-4