A comparative analysis of different dual problems in the Lagrangian Relaxation context for solving the Hydro Unit Commitment problem

被引:25
作者
Finardi, Erlon Cristian [1 ]
Scuzziato, Murilo Reolon [1 ]
机构
[1] Univ Fed Santa Catarina, LabPlan UFSC, Elect Syst Planning Res Lab, BR-88040900 Florianopolis, SC, Brazil
关键词
Hydro Unit Commitment and Loading problem; Hydropower function; Lagrangian Relaxation; Dual problems; Primal recovery; SCHEDULING PROBLEM; DECOMPOSITION; PLANT;
D O I
10.1016/j.epsr.2013.10.015
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
One of the most attractive methods to solve large-scale combinatorial optimization problems is the Lagrangian Relaxation (LR). The LR can be seen as a broad range of techniques which supplies a lower bound of the objective function and good starting points for heuristic searches to obtain feasible primal solutions. In this paper, we are interested in one of the most intriguing questions related to LR which is the construction of the dual problem. To accomplish this task, we use the Hydro Unit Commitment and Loading (HUCL) problem. Two reasons justify the choice: (i) it is a large-scale nonlinear 0-1 programming problem; (ii) the problem is highly relevant to use the energy resources in an electrical energy system efficiently. By means of the HUCL, we apply different kinds of decompositions, in the LR context, to construct two distinct dual problems. The analyses are strictly based on numerical experiments and the ideas here presented are intended to encourage researchers in the optimization community to explore LR dualization in other practical and relevant problems. (c) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:221 / 229
页数:9
相关论文
共 32 条
[1]   A problem of forest harvesting and road building solved through model strengthening and Lagrangean relaxation [J].
Andalaft, N ;
Andalaft, P ;
Guignard, M ;
Magendzo, A ;
Wainer, A ;
Weintraub, A .
OPERATIONS RESEARCH, 2003, 51 (04) :613-628
[2]  
[Anonymous], 1999, Athena scientific Belmont
[3]  
[Anonymous], 2011, Approximate dynamic programming: Solving the curses of dimensionality
[4]  
[Anonymous], 1996, Die Grundlehren der mathematischen Wissenschaften
[5]   Bundle relaxation and primal recovery in unit commitment problems.: The Brazilian case [J].
Belloni, A ;
Lima, ALDS ;
Maceira, MEP ;
Sagastizábal, CA .
ANNALS OF OPERATIONS RESEARCH, 2003, 120 (1-4) :21-44
[6]  
Bertsekas D.P., 2019, Reinforcement learning and optimal control
[7]  
Bonnans J.F., 2006, Numerical optimization theoretical and practical aspects, V2
[8]   Scheduling of head-dependent cascaded reservoirs considering discharge ramping constraints and start/stop of units [J].
Catalao, J. P. S. ;
Pousinho, H. M. I. ;
Mendes, V. M. F. .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2010, 32 (08) :904-910
[9]   Polyhedral analysis and decompositions for capacitated plant location-type problems [J].
Chen, BT ;
Guignard, M .
DISCRETE APPLIED MATHEMATICS, 1998, 82 (1-3) :79-91
[10]   AUXILIARY PROBLEM PRINCIPLE AND DECOMPOSITION OF OPTIMIZATION PROBLEMS [J].
COHEN, G .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1980, 32 (03) :277-305