×

Feasible modified subgradient method for solving the thermal unit commitment problem as a new approach. (English) Zbl 1206.90241

Summary: Lagrangian relaxation-based methods are commonly used to solve the thermal unit commitment (UC) problem which is an important subject in power system engineering. The main drawback of this group of methods is the difference between the dual and the primal solutions which gives some significant problems on the quality of the feasible solutions. In this paper, a new approach, feasible modified subgradient (F-MSG) method, which does not require finding an unconstrained global minimum of the Lagrangian function and knowing an optimal value of the problem under consideration in order to update dual variables at the each iteration, is firstly used for solving the thermal UC problem. The major advantage of the proposed approach is that it guarantees the zero duality gap and convergence independently from the size of the problem. In order to discuss the advantages of this method, the four-unit Tuncbilek thermal plant, which is located in Kutahya region in Turkey, is chosen as a small test system. The numerical results show that F-MSG gives better solutions as compared to the standard Lagrangian relaxation method.

MSC:

90C90 Applications of mathematical programming
90C30 Nonlinear programming

Software:

GAMS
PDF BibTeX XML Cite
Full Text: DOI EuDML

References:

[1] F. N. Lee and Q. Feng, “Multi-area unit commitment,” IEEE Transactions on Power Systems, vol. 7, no. 2, pp. 591-599, 1992.
[2] F. N. Lee, “The application of commitment utilization factor (CUF) to thermal unit commitment,” IEEE Transactions on Power Systems, vol. 6, no. 2, pp. 691-698, 1991.
[3] J. R. M. Burns and C. A. Gibson, “Optimization of priority lists for a unit commitment program,” in Proceedings of IEEE/Power Engineering Society Summer Meeting, vol. 75, p. 453-1, 1975.
[4] C.-L. Chen and N. Chen, “Strategies to improve the dynamic programming for unit commitment application,” Transactions of the Chinese Institute of Engineers, vol. 9, no. 3, pp. 181-189, 2002.
[5] F. Zhuang and F. D. Galiana, “Unit commitment by simulated annealing,” IEEE Transactions on Power Systems, vol. 5, no. 1, pp. 311-318, 1990.
[6] A. H. Mantawy, Y. L. Abdel-Magid, and S. Z. Selim, “A simulated annealing method for unit commitment,” IEEE Transactions on Power Systems, vol. 13, no. 1, pp. 1197-1204, 1998.
[7] A. Viana, J. P. Sousa, and M. Matos, “Simulated annealing for the unit commitment problem,” in Proceedings of IEEE Porto Power Tech Conference, Porto, Portugal, September 2001.
[8] H. Mori and T. Usami, “Unit commitment using tabu search with restricted neighborhood,” in Proceedings of the International Conference on Intelligent Systems Applications to Power Systems, vol. 221, pp. 422-427, February 1996.
[9] B. Xiaomin, S. M. Shahidehpour, and Y. Erkeng, “Constrained unit commitment by using tabu search algorithm,” in Proceedings of the International Conference on Electrical Engineering, vol. 2, pp. 1088-1092, 1996.
[10] C. C. A. Rajan and M. R. Mohan, “An evolutionary programming-based tabu search method for solving the unit commitment problem,” IEEE Transactions on Power Systems, vol. 19, no. 1, pp. 577-585, 2004.
[11] K. A. Juste, H. Kita, E. Tanaka, and J. Hasegawa, “An evolutionary programming solution to the unit commitment problem,” IEEE Transactions on Power Systems, vol. 14, no. 4, pp. 1452-1459, 1999.
[12] K.-Y. Huang, H.-T. Yang, and C.-L. Huang, “A new thermal unit commitment approach using constraint logic programming,” IEEE Transactions on Power Systems, vol. 13, no. 3, pp. 936-945, 1998.
[13] S. Li, S. M. Shahidehpour, and C. Wang, “Promoting the application of expert systems in short-term unit commitment,” IEEE Transactions on Power Systems, vol. 8, no. 1, pp. 286-292, 1993.
[14] S. Saneifard, N. R. Prasad, and H. A. Smolleck, “A fuzzy logic approach to unit commitment,” IEEE Transactions on Power Systems, vol. 12, no. 2, pp. 988-995, 1997.
[15] K. S. Swarup and S. Yamashiro, “Unit commitment solution methodology using genetic algorithm,” IEEE Transactions on Power Systems, vol. 17, no. 1, pp. 87-91, 2002.
[16] N. P. Padhy, “Unit commitment using hybrid models: a comparative study for dynamic programming, expert system, fuzzy system and genetic algorithms,” International Journal of Electrical Power and Energy Systems, vol. 23, no. 8, pp. 827-836, 2001.
[17] T. Senjyu, H. Yamashiro, K. Uezato, and T. Funabashi, “A unit commitment problem by using genetic algorithm based on unit characteristic classification,” in Proceedings of IEEE Power Engineering Society Winter Meeting, vol. 1, pp. 58-63, January 2002.
[18] P.-C. Yang, H.-T. Yang, and C.-L. Huang, “Solving the unit commitment problem with a genetic algorithm through a constraint satisfaction technique,” Electric Power Systems Research, vol. 37, no. 1, pp. 55-65, 1996.
[19] S. A. Kazarlis, A. G. Bakirtzis, and V. Petridis, “A genetic algorithm solution to the unit commitment problem,” IEEE Transactions on Power Systems, vol. 11, no. 1, pp. 83-92, 1996.
[20] N. JimĂ©nez Redondo and A. J. Conejo, “Short-term hydro-thermal coordination by Lagrangian relaxation: solution of the dual problem,” IEEE Transactions on Power Systems, vol. 14, no. 1, pp. 89-95, 1999.
[21] Q. Zhai, X. Guan, and J. Cui, “Unit commitment with identical units: successive subproblem solving method based on Lagrangian relaxation,” IEEE Transactions on Power Systems, vol. 17, no. 4, pp. 1250-1257, 2002.
[22] R. Nieva, A. Inda, and I. Guillen, “Lagrangian reduction of search-range for large-scale unit commitment,” IEEE Transactions on Power Systems, vol. 2, no. 2, pp. 465-473, 1987.
[23] S. Virmani, E. C. Adrian, K. Imhof, and S. Mukherjee, “Implementation of a Lagrangian relaxation based unit commitment problem,” IEEE Transactions on Power Systems, vol. 4, no. 4, pp. 1373-1380, 1989.
[24] W. Ongsakul and N. Petcharaks, “Unit commitment by enhanced adaptive Lagrangian relaxation,” IEEE Transactions on Power Systems, vol. 19, no. 1, pp. 620-628, 2004.
[25] L. M. Kimball, K. A. Clements, P. W. Davis, and I. Nejdawi, “Multiperiod hydrothermal economic dispatch by an interior point method,” Mathematical Problems in Engineering, vol. 8, no. 1, pp. 33-42, 2002. · Zbl 1069.90110
[26] J. Valenzuela and A. E. Smith, “A seeded memetic algorithm for large unit commitment problems,” Journal of Heuristics, vol. 8, no. 2, pp. 173-195, 2002.
[27] J. Valenzuela and A. E. Smith, “A seeded memetic algorithm for large unit commitment problems,” Journal of Heuristics, vol. 8, no. 2, pp. 173-195, 2002.
[28] H. Sasaki, M. Watanabe, J. Kubokawa, N. Yorino, and R. Yokoyama, “A solution method of unit commitment by artificial neural networks,” IEEE Transactions on Power Systems, vol. 7, no. 3, pp. 974-981, 1992.
[29] N. P. Padhy, “Unit commitment using hybrid models: a comparative study for dynamic programming, expert system, fuzzy system and genetic algorithms,” International Journal of Electrical Power and Energy Systems, vol. 23, no. 8, pp. 827-836, 2001.
[30] N. P. Padhy, S. R. Paranjothi, and V. Ramachandran, “A hybrid fuzzy neural network-expert system for a short term unit commitment problem,” Microelectronics Reliability, vol. 37, no. 5, pp. 733-737, 1997.
[31] L. A. F. M. Ferreira, “On the duality gap for thermal unit commitment problems,” in Proceedings of IEEE International Symposium on Circuits and Systems, vol. 4, pp. 2204-2207, May 1993.
[32] M. Kurban and U. B. Filik, “A comparative study of three different mathematical methods for solving the unit commitment problem,” Mathematical Problems in Engineering, vol. 2009, Article ID 368024, 13 pages, 2009. · Zbl 1181.90246
[33] R. N. Gasimov and A. M. Rubinov, “On augmented lagrangians for optimization problems with a single constraint,” Journal of Global Optimization, vol. 28, no. 2, pp. 153-173, 2004. · Zbl 1058.90061
[34] R. N. Gasimov, “Augmented Lagrangian duality and nondifferantiable optimization methods in nonconvex programming,” Journal of Global Optimization, vol. 28, pp. 187-203, 2002. · Zbl 1047.90048
[35] A. Y. Azimov and R. N. Gasimov, “On weak conjugacy, weak subdifferentials and duality with zero gap in nonconvex optimization,” International Journal of Applied Mathematics, vol. 1, pp. 171-192, 1999. · Zbl 1171.90514
[36] R. T. Rockafellar and R. J. B. Wets, Variational Analysis, Springer, Berlin, Germany, 1998. · Zbl 0888.49001
[37] A. M. Rubinov and R. N. Gasimov, “Strictly increasing positively homogeneous functions with application to exact penalization,” Optimization, vol. 52, no. 1, pp. 1-28, 2003. · Zbl 1114.90452
[38] R. N. Gasimov and O. Ustun, “Solving the quadratic assignment problem using F-MSG algorithm,” Journal of Industrial and Management Optimization, vol. 3, no. 2, pp. 173-191, 2007. · Zbl 1171.90445
[39] A. J. Wood and B. F. Wollenberg, Power Generation Operation and Control, John Wiley & Sons, New York, NY, USA, 2nd edition, 1996.
[40] A. Brooke, D. Kendrick, A. Meeraus, and R. Raman, “GAMS: a users guide,” GAMS Development, 1998, http://www.gams.com/.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.