Open Access Open Access  Restricted Access Subscription or Fee Access

Using Benders Decomposition for Solving MINLP Unit Commitment Problem


(*) Corresponding author


Authors' affiliations


DOI's assignment:
the author of the article can submit here a request for assignment of a DOI number to this resource!
Cost of the service: euros 10,00 (for a DOI)

Abstract


This paper presents a new formulation based on generalized benders decomposition approach to solve thermal unit commitment problem. This new approach decomposes the problem into a master problem and a sub-problem. The master problem is an integer program and sub-problem is a nonlinear program. The master problem applies the integer programming method to solve (Unit Commitment) UC and finds proper on/off states of the units. In the proposed approach, the sub-problem is modeled as a nonlinear problem and it uses the outputs of master problem to form appropriate cuts and adds them to the master problem for solving the next iteration of UC. Appropriate formulations of constraints for both parts of problem are presented. The results obtained, considering a commonly used system, show the efficiency of this approach in comparison with other methods.
Copyright © 2016 Praise Worthy Prize - All rights reserved.

Keywords


Benders Decomposition; Mixed Integer Programming; Unit Commitment

Full Text:

PDF


References


F. N. Lee, Short-term thermal unit commitment—A new method, IEEE Trans. Power Syst., vol. 3, no. 2, May 1988, pp. 421–428.
http://dx.doi.org/10.1109/59.192892

C. Li, R. B. Johnson, and A. J. Svoboda, A new unit commitment method, IEEE Trans. Power Syst., vol. 12, no. 1, Feb. 1997, pp. 113–119.
http://dx.doi.org/10.1109/59.574930

T. Senjyu, K. Shimabukuro, K. Uezato, and T. Funabashi, A fast technique for unit commitment problem by extended priority list, IEEE Trans. Power Syst., vol. 18, no. 2, May 2003, pp. 882–888.
http://dx.doi.org/10.1109/tpwrs.2003.811000

W. L. Snyder, H. D. Powell, and J. C. Rayburn, Dynamic-programming approach to unit commitment, IEEE Trans. Power Syst., vol. 2, no. 2, May 1987, pp. 339–350.
http://dx.doi.org/10.1109/tpwrs.1987.4335130

W. J. Hobbs, G. Hermon, S. Warner, and G. B. Sheblé, An enhanced dynamic programming approach for unit commitment, IEEE Trans. Power Syst., vol. 3, no. 3, Aug. 1988, pp. 1201–1205.
http://dx.doi.org/10.1109/59.14582

Z. Ouyang and S. M. Shahidehpour, An intelligent dynamic-programming for unit commitment application, IEEE Trans. Power Syst., vol. 6, no. 3, Aug. 1991, pp. 1203–1209.
http://dx.doi.org/10.1109/59.119267

T. S. Dillon, K. W. Edwin, H. D. Kochs, and R. J. Tand, Integer programming approach to the problem of optimal unit commitment with probabilistic reserve determination, IEEE Trans. Power App. Syst., vol. PAS-97, no. 6, Nov./Dec. 1978, pp. 2154–2166.
http://dx.doi.org/10.1109/tpas.1978.354719

J. Medina, V. H. Quintana, and A. J. Conejo, A clipping-off interior point technique for medium-term hydro-thermal coordination, IEEE Trans. Power Syst., vol. 14, no. 1, Feb. 1999, pp. 266–273.
http://dx.doi.org/10.1109/59.744542

A. Merlin and P. Sandrin, A new method for unit commitment at Electricité de France, IEEE Trans. Power App. Syst., vol. PAS-102, no. 5, May 1983, pp. 1218–1225.
http://dx.doi.org/10.1109/tpas.1983.318063

F. Zhuang and F. D. Galiana, Towards a more rigorous and practical unit commitment by Lagrange relaxation, IEEE Trans. Power Syst., vol. 3, no. 2, May 1988, pp. 763–773.
http://dx.doi.org/10.1109/59.192933

C. Wang and S. M. Shahidehpour, Ramp-rate limits in unit commitment and economic dispatch incorporating rotor fatigue effect, IEEE Trans. Power Syst., vol. 9, no. 3, Aug. 1994, pp. 1539–1545.
http://dx.doi.org/10.1109/59.336106

C.Wang and S. M. Shahidehpour, Optimal generation scheduling with ramping costs, IEEE Trans. Power Syst., vol. 10, no. 1, Feb. 1995, pp. 60–67.
http://dx.doi.org/10.1109/59.373928

A. J. Svoboda, C.-L. Tseng, C.-A. Li, and R. B. Johnson, Short-term resource scheduling with ramp constraints, IEEE Trans. Power Syst., vol. 12, no. 1, Feb. 1997, pp. 77–83.
http://dx.doi.org/10.1109/59.574926

S.-Y. Lai and R. Baldick, Unit commitment with ramp multipliers, IEEE Trans. Power Syst., vol. 14, no. 1, Feb. 1999, pp. 58–64.
http://dx.doi.org/10.1109/59.744484

W. Ongsakul and N. Petcharaks, Unit commitment by enhanced adaptive Lagrangian relaxation, IEEE Trans. Power Syst., vol. 19, no. 1, pp, Feb. 2004. 620–628.
http://dx.doi.org/10.1109/tpwrs.2003.820707

F. Zhuang and F. D. Galiana, Unit commitment by simulated annealing, IEEE Trans. Power Syst., vol. 5, no. 1, Feb. 1990, pp. 311–318.
http://dx.doi.org/10.1109/59.49122

A. H. Mantawy, Y. L. Abdel-Magid, and S. Z. Selim, A simulated annealing algorithm for unit commitment, IEEE Trans. Power Syst., vol. 13, no. 1, Feb. 1998, pp. 197–204.
http://dx.doi.org/10.1109/59.651636

G. K. Purushothama and L. Jenkins, Simulated annealing with local search—A hybrid algorithm for unit commitment, IEEE Trans. Power Syst., vol. 18, no. 1, Feb. 2003, pp. 273–278.
http://dx.doi.org/10.1109/tpwrs.2002.807069

S. A. Kazarlis, A. G. Bakirtzis, and V. Petridis, A genetic algorithm solution to the unit commitment problem, IEEE Trans. Power Syst., vol. 11, no. 1, Feb. 1996, pp. 83–92.
http://dx.doi.org/10.1109/59.485989

K. A. Juste, H. Kita, E. Tanaka, and J. Hasegawa, An evolutionary programming solution to the unit commitment problem, IEEE Trans. Power Syst., vol. 14, no. 4, Nov. 1999, pp. 1452–1459.
http://dx.doi.org/10.1109/59.801925

J. M. Arroyo and A. J. Conejo, A parallel repair genetic algorithm to solve the unit commitment problem, IEEE Trans. Power Syst., vol. 17, no. 4, Nov. 2002, pp. 1216–1224.
http://dx.doi.org/10.1109/tpwrs.2002.804953

C. C. A. Rajan and M. R. Mohan, An evolutionary programming based tabu search method for solving the unit commitment problem, IEEE Trans. Power Syst., vol. 19, no. 1, Feb. 2004, pp. 577–585.
http://dx.doi.org/10.1109/tpwrs.2003.821472

I. G. Damousis, A. G. Bakirtzis, and P. S. Dokopoulos, A solution to the unit commitment problem using integer-coded genetic algorithm, IEEE Trans. Power Syst., vol. 19, no. 2, May 2004, pp. 1165–1172.
http://dx.doi.org/10.1109/tpwrs.2003.821625

N. P. Padhy, Unit commitment—A bibliographical saurvey, IEEE Trans. Power Syst., vol. 19, no. 2, May 2004, pp. 1196–1205.
http://dx.doi.org/10.1109/tpwrs.2003.821611

G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization. New York: Wiley-Interscience, 1999.
http://dx.doi.org/10.1002/acs.4480040410

R. E. Bixby, M. Fenelon, Z. Gu, E. Rothberg, and R. Wunderling, MIP: Theory and practice closing the gap, in System Modeling and Optimization: Methods, Theory and Applications, M. J. D. Powell and S. Scholtes, Eds. Norwell, MA: Kluwer, 2000, pp. 19–50.
http://dx.doi.org/10.1007/978-0-387-35514-6_2

The ILOG CPLEX Website, 2006. [Online]. Available: http://www.ilog.com/products/cplex/.

Ervin Kalvelagen, some MINLP solution Algorithms, http://www.gams.com/~erwin /minlp.pdf

M. P. Nowak and W. Römisch, Stochastic Lagrangian relaxation applied to power scheduling in a hydro-thermal system under uncertainty,” Ann. Oper. Res., vol. 100, 2000, pp. 251–272.

A.M. Geoffrion, Generalized Benders decomposition, Journal of optimization Theory and Applications 10, 1972, No.4,237-260.
http://dx.doi.org/10.1007/bf00934810

M.Shahidehpour, Y.Fu Benders decomposition in restructuring power systems, Tutorial.

M.Carrion, M.Arroyo, A computationally efficient mixed integer linear formulation for the thermal unit commitment problem, IEEE Trans actions on power system, vol.21,no.3,2006,pp. 1371 – 1378.
http://dx.doi.org/10.1109/tpwrs.2006.876672

D.N.Simopoulos, S.D.Kavatza, C.D.Vournas, Unit commitment by an enhanced simulated annealing algorithm, Power Systems Conference and Exposition, 2006, pp.193 - 201.
http://dx.doi.org/10.1109/psce.2006.296296

W. Ongsakul, and N. Petcharaks, Unit Commitment by enhanced adaptive Lagrangian relaxation, IEEE Trans. Power Syst., vol. 19, pp. 620–8, Feb. 2004.
http://dx.doi.org/10.1109/tpwrs.2003.820707

C. P. Cheng, C.W. Liu, and G. C. Liu, Unit commitment by Lagrangian relaxation and genetic algorithms, IEEE Trans. Power Syst., vol. 15, pp. 707–714, May 2000
http://dx.doi.org/10.1109/59.867163

J. Valenzuela and A. E. Smith, A seeded memetic algorithm for large unit commitment problems, J. Heuristics, vol. 8, pp. 173–195, March 2002.


Refbacks

  • There are currently no refbacks.


Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2024 Praise Worthy Prize