A comparison of four approaches from stochastic programming for large-scale unit-commitment

EURO Journal on Computational Optimization

Volumn 5, Issue 1-2, 2017, Pages 119-147

  van Ackooij, Wim ^a  

^a EDF R AND D   (France)

Author keywords

Probabilistically constrained programming; Robust optimization; Stochastic programming; Unit commitment

Indexed keywords

CONSTRAINED OPTIMIZATION; CONSTRAINT SATISFACTION PROBLEMS; COST FUNCTIONS; COSTS; FORTH (PROGRAMMING LANGUAGE); PROBLEM SOLVING; PRODUCTION CONTROL; STOCHASTIC PROGRAMMING;

COMPUTATIONAL COSTS; CONSTRAINED PROGRAMMING; DECOMPOSITION APPROACH; OPERATIONAL CONSTRAINTS; OPTIMIZATION APPROACH; ROBUST OPTIMIZATION; UNIT COMMITMENT PROBLEM; UNIT-COMMITMENT;

STOCHASTIC SYSTEMS;

EID: 85022162985     PISSN: 21924406     EISSN: 21924414     Source Type: Journal    
DOI: 10.1007/s13675-015-0051-x     Document Type: Article

References (58)

1. Beltran C, Heredia FJ (2002) Unit commitment by augmented lagrangian relaxation: testing two decomposition approaches. J Optim Theory Appl 112(2):295–314
2. Ben-Salem S (2011) Gestion Robuste de la production électrique à horizon court-terme. PhD thesis, Ecole Centrale Paris, Mars
3. Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust optimization. Princeton University Press, Princeton
4. Bertsimas D, Litvinov E, Sun XA, Zhao J, Zheng T (2013) Adaptive robust optimization for the security constrained unit commitment problem. IEEE Trans Power Syst 28(1):52–63
5. Birge JR, Louveaux F (1988) A multicut algorithm for two-stage stochastic linear programs. Eur J Oper Res 34(3):384–392
6. Birge JR, Louveaux F (1997) Introduction to stochastic programming. Springer, New York
7. Bonnans JF, Gilbert JC, Lemaréchal C, Sagastizábal C (2006) Numerical optimization: theoretical and practical aspects, 2nd edn. Springer, Berlin
8. Borghetti A, Frangioni A, Lacalandra F, Nucci CA (2003) Lagrangian heuristics based on disaggregated bundle methods for hydrothermal unit commitment. IEEE Trans Power Syst 18:313–323
9. Bremer I, Henrion R, Möller A (2015) Probabilistic constraints via SQP solver: application to a renewable energy management problem. Comput Manag Sci 12:435–459
10. Bruhns A, Deurveilher G, Roy JS (2005) A non-linear regression model for mid-term load forecasting and improvements in seasonality. PSCC 2005 Luik
11. Carrión M, Arroyo JM (2006) A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem. IEEE Trans Power Syst 21(3):1371–1378
12. Daniildis A, Lemaréchal C (2005) On a primal-proximal heuristic in discrete optimization. Math Program Ser A 104:105–128
13. de Oliveira W, Sagastizábal C (2014) Level bundle methods for oracles with on demand accuracy. Optim Methods Softw 29(6):1180–1209
14. de Oliveira W, Sagastizábal C, Lemaréchal C (2014) Convex proximal bundle methods in depth: a unified analysis for inexact oracles. Math Program Ser B 148:241–277
15. Dentcheva D (2009) Optimisation models with probabilistic constraints. In: Shapiro A, Dentcheva D, Ruszczynski A (eds) Lectures on stochastic programming. Modeling and theory, MPS-SIAM series on optimization, vol 9. SIAM and MPS, Philadelphia
16. Ding X, Lee W-J, Jianxue W, Liu L (2010) Studies on stochastic unit commitment formulation with flexible generating units. Electr Power Syst Res 80:130–141
17. Dubost L, Gonzalez R, Lemaréchal C (2005) A primal-proximal heuristic applied to french unitcommitment problem. Math Program 104(1):129–151
18. Dyer ME, Frieze AM (1988) On the complexity of computing the volume of a polyhedron. SIAM J Comput 17(5):967–974
19. Feltenmark S, Kiwiel KC (2000) Dual applications of proximal bundle methods, including lagrangian relaxation of nonconvex problems. SIAM J Optim 10(3):697–721
20. Finardi EC, Da Silva EL (2006) Solving the hydro unit commitment problem via dual decomposition and sequential quadratic programming. IEEE Trans Power Syst 21(2):835–844
21. Frangioni A, Gentile C, Lacalandra F (2008) Solving unit commitment problems with general ramp contraints. Int J Electr Power Energy Syst 30:316–326
22. Frangioni A, Gentile C, Lacalandra F (2011) Sequential Lagrangian-MILP approaches for unit commitment problems. Int J Electr Power Energy Syst 33:585–593
23. Genz A (1992) Numerical computation of multivariate normal probabilities. J Comput Graph Stat 1:141–149
24. Genz A, Bretz F (2009) Computation of multivariate normal and t probabilities. In: Number 195 in Lecture Notes in Statistics. Springer, Dordrecht
25. Gersho A, Gray RM (1992) Vector Quantization and Signal Compression. In: Number 159 in The Springer International Series in Engineering and Computer Science. Springer, US
26. Henrion R, Möller A (2012) A gradient formula for linear chance constraints under Gaussian distribution. Math Oper Res 37:475–488
27. Hiriart-Urruty JB, Lemaréchal C (1996) Convex Analysis and Minimization Algorithms I. In: Number 305 in Grundlehren der mathematischen Wissenschaften, 2nd edn. Springer
28. Hong LJ, Yang Y, Zhang L (2011) Sequential convex approximations to joint chance constrained programed: a monte carlo approach. Oper Res 3(59):617–630
29. Kall P, Mayer J (2005) Stochastic linear programming: models, theory and computation. International series in operations research and management science, 1st edn. Springer, New York
30. Lejeune MA (2012) Pattern-based modeling and solution of probabilistically constrained optimization problems. Oper Res 60(6):1356–1372
31. Lloyd S (1982) Least squares quantization in pcm. IEEE Trans Inf Theory 28(2):129–137
32. Luedtke J (2010) An integer programming and decomposition approach to general chance-constrained mathematical programs. In: Eisenbrand F, Shepherd FB (eds) Integer programming and combinatorial optimization, lecture notes in computer science, vol 6080. Springer, Berlin, pp 271–284
33. Luedtke J (2014) A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support. Math Program 146(1–2):219–244
34. Minoux M (2014) Two-stage robust optimization, state-space representable uncertainty and applications. RAIRO-Oper Res 48:455–475
35. Morales-España G, Latorre JM, Ramos A (2013) Tight and compact MILP formulation for the thermal unit commitment problem. IEEE Trans Power Syst 28(4):4897–4908
36. Morales-España G, Latorre JM, Ramos A (2013) Tight and compact MILP formulation of start-up and shut-down ramping in unit commitment. IEEE Trans Power Syst 28(2):1288–1296
37. Nemirovski A, Shapiro A (2006) Convex approximations of chance constrained programs. SIAM J Optim 17(4):969–996
38. Ozturk UA, Mazumdar M, Norman BA (2004) A solution to the stochastic unit commitment problem using chance constrained programming. IEEE Trans Power Syst 19(3):1589–1598
39. Pagès G, Printems J (2003) Optimal quadratic quantization for numerics: the gaussian case. Monte Carlo Methods Appl 9(2):135–166
40. Prékopa A (1995) Stochastic programming. Kluwer, Dordrecht
41. Prékopa A (2003) Probabilistic programming. In: Ruszczyński A, Shapiro A (eds) Stochastic programming. Handbooks in operations research and management science, vol 10. Elsevier, Amsterdam
42. Ruszczyński A (2003) Decomposition methods. In: Ruszczyński A, Shapiro A (eds) Stochastic programming. Handbooks in operations research and management science, vol 10. Elsevier, Amsterdam
43. Sagastizábal C (2012) Divide to conquer: decomposition methods for energy optimization. Math Program 134(1):187–222
44. Shan F, Zhang LW, Xiao X (2014) A smoothing function approach to joint chance constrained programs. J Optim Theory Appl 163:181–199
45. Tahanan M, van Ackooij W, Frangioni A, Lacalandra F (2015) Large-scale unit commitment under uncertainty: a literature survey. 4OR 13(2):115–171
46. Takriti S, Birge JR (2000) Using integer programming to refine lagrangian-based unit commitment solutions. IEEE Trans Power Syst 15(1):151–156
47. van Ackooij W (2014) Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment. Math Methods Oper Res 80(3):227–253
48. van Ackooij W, de Oliveira W (2014) Level bundle methods for constrained convex optimization with various oracles. Comput Optim Appl 57(3):555–597
49. van Ackooij W, Henrion R, Möller A, Zorgati R (2010) On probabilistic constraints induced by rectangular sets and multivariate normal distributions. Math Methods Oper Res 71(3):535–549
50. van Ackooij W, Henrion R, Möller A, Zorgati R (2014) Joint chance constrained programming for hydro reservoir management. Optim Eng 15:509–531
51. van Ackooij W, Malick J (2014) Decomposition algorithm for large-scale two-stage unit-commitment. Draft submitted, http://www.optimization-online.org/DB_HTML/2015/04/4873.html, pages 1–26, 2014
52. van Ackooij W, Minoux M (2015) A characterization of the subdifferential of singular Gaussian distribution functions. Set valued and variational analysis. pages 1–19 (to appear in)
53. van Ackooij W, Sagastizábal C (2014) Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems. SIAM J Optim 24(2):733–765
54. Wang SJ, Shahidehpour M, Kirschen DS, Mokhtari S, Irisarri GD (1995) Short-term generation scheduling with transmission and environmental constraints using an augmented lagrangian relaxation. IEEE Trans Power Syst 10(3):1294–1301
55. Xiong P, Jirutitijaroen P (2011) Stochastic unit commitment using multi-cut decomposition algorithm with partial aggregation. In IEEE Power and Energy Society General Meeting
56. Zaourar S, Malick J (2013) Prices stabilization for inexact unit-commitment problems. Math Methods Oper Res 78(3):341–359
57. Zhuang F, Galiana FD (1988) Towards a more rigorous and practical unit commitment by lagrangian relaxation. IEEE Trans Power Syst 3(2):763–773
58. Zugno M, Conejo AJ (2013) A robust optimization approach to energy and reserve dispatch in electricity markets. Technical report, University of Denmark