Security Constrained Unit Commitment in a Power System based on Benders Decomposition and Mixed Integer Non-linear Programming

  • Authors

    • Pranda Prasanta Gupta
    • Prerna Jain
    • Suman Sharma
    • Rohit Bhakar
    2018-03-11
    https://doi.org/10.14419/ijet.v7i1.6.11265
  • ACOPF, BD, SCUC, MINLP

  • In deregulated power markets, Independent System Operators (ISOs) maintains adequate reserve requirement in order to respond to generation and system security constraints. In order to estimate accurate reserve requirement and handling non-linearity and non-convexity of the problem, an efficient computational framework is required. In addition, ISO executes SCUC in order to reach the consistent operation. In this paper, a novel type of application which is Benders decomposition (BD) and Mixed integer non linear programming (MINLP) can be used to assess network security constraints by using AC optimal power flow (ACOPF) in a power system. It performs ACOPF in network security check evaluation with line outage contingency. The process of solving modified system would be close to optimal solution, the gap between the close to optimal and optimal solution is expected to determine whether a close to optimal solutionis accepetable for convenientpurpose. This approach drastically betters the fast computational requirement in practical power system .The numerical case studies are investigated in detail using an IEEE 118-bus system.

     

  • References

    1. [1] N. P. Padhy, "Unit commitment-a bibliographical survey," IEEE Transaction on Power System, Vol.19, No. 2, (2004), pp. 1196-1205.

      [2] Bai X & Wei H, “Semi-Definite Programming-Based Method For Security-Constrained Unit Commitment with Operational and Optimal Power Flow Constraintsâ€, IET Generation, Transmission andDistribution,Vol.3, No.2, (2009), pp.182–197

      [3] N. Amjady and H. Nasiri-Rad. “Security constrained unit commitment by a new adaptive hybrid stochastic search techniqueâ€. Energy Conversion and Management; Vol.52, No.2, (2011), pp.1097–106

      [4] QiaozhuZhai and Xiaohong Guan, “The Conditions for Obtaining Feasible Solutions to Security-Constrained Unit Commitment Problems†IEEE Transaction on Power System, Vol. 20, No.4, (2005)

      [5] J. J. Shaw, “A direct method for security-constrained unit commitment,†IEEE Transaction on Power System, Vol. 10, No. 3, (1995), pp. 1329–1342

      [6] Zhu, J, “Optimization of power system operation,†New Jersey, Wiley & Sons, Inc, (2009), p. 251.

      [7] M. Shahidehpour, H. Yamin, Z. Li, Market Operations in Electric Power Systems, John Wiley & Sons, (2002).

      [8] Y. Sun, Z. Li, W. Tian and M. Shahidehpour,†A Lagrangian Decomposition Approach to Energy Stoarge Transportation Scheduling in Power Systems,â€IEEE Transaction on Power System,Vol.31, No.6, (2016)

      [9] Shafie-khah, M., Moghaddam, M.P., Sheikh-El-Eslami, M.K.: ‘Unified solution of a non-convex SCUC problem using combination of modified branch-and-bound method with quadratic programming’,Energy Conversion and Management, (2011), Vol.52, No.12, pp. 3425–3432

      [10] Grey, A., Sekar, A.: ‘Unified solution of security-constrained unit commitment problem using a linear programming methodology’, IETGeneration, Transmission and Distribution, (2008), Vol.2, No.6, pp. 856–867

      [11] Hobbs WJ et al. ,â€An enhanced dynamic programming approach for unit commitment,†IEEE Transaction on Power System, Vol.3 No.3, (1988), pp:1201–5

      [12] Lyu, J.K., Kim, M.K., Yoon, Y.T., Park, J.K.: ‘A new approach to security-constrained generation scheduling of large-scale power systems with a piecewise linear ramping model’, International Journal Electrical Power Energy System, (2012), Vol. 34, pp. 121–131

      [13] P.P. Gupta, P. Jain, S. Sharma and R.Bhakar,’’ Reliability-Security Constrained Unit Commitment Based on Benders Decomposition and Mixed Integer NonLinear Programming,†International Conference on Computer,Communication, and Electronics (Comptelix),(2017).

      [14] A. Nasri, S.J. Kazempour, A.J. Conejo and M. Ghandhari, “NetworkConstrained AC unit commitment under uncertainty: A Benders Decomposition Approach,†IEEE Transaction on Power System, Vol. 31, No. 1, (2016), pp. 0085-8950.

      [15] N. Amjady, S. Dehghan, A. Attarha and A.J. Conejo,†Adaptive Robust network-constrained AC unit commitment,†IEEE Transaction on Power System, Vol. 32, No. 1, (2017), pp. 0085-8950.

      [16] IBM Ilog CPLEX. Available at http://www.ilog.com/products/cplex

      [17] K. Lehmann, A. Grastien, and P. V.Hentenryck, “AC-feasibility on tree networks is NP-hard,†IEEE Transaction on Power System, Vol. 31, No. 1, (2016), pp. 1–4.

      [18] L. Wu and M. Shahidehpour, “Accelerating Benders decomposition for network-constrained unit commitment problems,†Energy System, Vol. 1, No. 3, (2010), pp. 339–376.

      [19] M. J. Feizollahi, M. Costley, S. Ahmed, and S. Grijalva, “Large-scale decentralized unit commitment,†Electral Power and Energy System, Vol. 73, (2015), pp. 97–106.

      [20] C. Tseng, “On power system generation unit commitment problems,†Ph.D. dissertation, Dept. Ind. Eng. Oper. Res., Univ. California, Berkeley, CA, USA, (2010)

      [21] H. Ma and M. Shahidehpour, “Unit commitment with transmission security and voltage constraints,†IEEE Transaction on Power System, Vol. 14, No. 2, (1999), pp. 757–764.

      [22] Q. P. Zheng, J. Wang, and A. L. Liu, “Stochastic optimization for unit commitment—A review,†IEEE Transaction on Power System, Vol. 30, No. 4, (2015), pp. 1913–1924.

      [23] M. Carrión and J. Arroyo, “A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem,†IEEE Transaction on Power System, Vol. 2, No. 1, (2011), pp. 69–77.

      [24] J. Ostrowski, M. F. Anjos, and A. Vannelli, “Tight mixed integer linear programming formulations for the unit commitment problem,†IEEE Transaction on Power System, vol. 27, no. 1, (2012), pp. 39–46.

      [25] G. Morales-España, J. M. Latorre, and A. Ramos, “Tight and compact MILP formulation for the thermal unit commitment problem,†IEEE Transaction on Power System, vol. 28, no. 4, pp. (2013), 4897–4908.

      [26] T. Ding, R. Bo, Y. Yang and F. Blaabjerg, "Impact of negative reactance on defectiveness of B-Matrix and feasibility of DC power flow," ,†IEEE Transaction on Power System, Vol.31, No.1, (2017), pp. 1949-3053.

      [27] R. A. Jabr, “Tight polyhedral approximation for mixed-integer linear programming unit commitment formulations,â€IET Generation, Transmission andDistribution, Vol. 6, No. 11, (2012), pp. 1104–1111

      [28] R. F-Blanco, Y. Dvorkin, M A. O-Vazquez,†Probabilistic security constrained unit commitment with generation and transmission contingency,†IEEE Transaction on Power System, Vol.32, No.1, (2017).

      [29] A. Nikoobakht, M. Mardaneh, J. Aghaei, V. Gueerero-Mestre and J. Contreras,â€Flexible power System operation accomdating uncertain wind power generation using transmission toplogy control: an improved lineraised AC SCUC model,†IET Generation, Transmission andDistribution,Vol.11, No.1, (2016), pp.142-153

      [30] Bertsimas, D., Litvinov, E., Sun., X. A., Jinye., Z. andTongxin., Z.,“Adaptive robust optimization for the security constraint unit commitment problem,â€IEEE Transaction on Power System, Vol. 28, (2013), pp. 52-63

      [31] Fu Y, Shahidehpour M, Li Z.,†AC contingency dispatch based on securityconstrained unit commitment.†IEEE Transaction on Power System, Vol.21,No.2, (2006), pp.897-908

      [32] The GAMS Software Website; 2016. [Online]. Available: http://www.gams.com/dd/docs/solvers/cplex.pdf.

  • Downloads

  • How to Cite

    Prasanta Gupta, P., Jain, P., Sharma, S., & Bhakar, R. (2018). Security Constrained Unit Commitment in a Power System based on Benders Decomposition and Mixed Integer Non-linear Programming. International Journal of Engineering & Technology, 7(2.6), 283-289. https://doi.org/10.14419/ijet.v7i1.6.11265