Advanced Dynamic Programming for Unit Commitment of Thermal Units when Constraints in Short-term are Unsatisfied

  • Mehdi Amini Kazemi
  • Alireza Sedaghati shahabdanesh university
Keywords: Keywords: Unit Commitment, Economic Dispatch, Dynamic Programming

Abstract

Abstract – This paper presents an advanced dynamic programming approach for solving the unit commitment problem. The proposed method prove unit commitment is economical in terms of cost and CPU time. the propsed method  yielded the optimal value of the schedule after many stages of refining and checking procedures. The problem also considers the unit ramping constraint. The proposed algorithm refined the divergence in the case of the 10-unit system and it was observed that final UC passed through all stages without any divergence. The basic advantage of the proposed algorithm is the high speed of convergence. Results reveal that the proposed alghorithm is very effective in reaching the optimal schedule for the short-term unit commitment problem.

References

[1] Baldick R. The generalized unit commitment problem. IEEE T Power Syst 1995; 10: 465-475.
[2] Baldwin CJ, Dale KM, Dittrich RF. A study of the economic shutdown of generating units in daily dispatch. AIEE Transactions on Power Apparatus and Systems 1960; 78: 1272-1284.
[3] Merlin A, Sandrin P. A new method for unit commitment at Electricite de France. IEEE T Power Ap Syst 1983; 102: 1218-1225.
[4] Muckstadt JA, Wilson RC. An application of mixed-integer programming duality to scheduling thermal generating systems. IEEE T Power Syst 1968; 87: 1968-1978.
[5] Lowery PG. Generating unit commitment by dynamic programming. IEEE T Power Ap Syst 1966; 5: 422-426.
[6] Snyder WL, Powel HD, Rayburn JC. Dynamic programming approach to unit commitment. IEEE T Power Syst 1987; 2: 339-350.
[7] Juste KA, Kita H, Tanaka E, Hasegawa J. An evolutionary programming solution to the unit commitment problem. IEEE T Power Syst 1999; 14: 1452-1459.
[8] Senthil Kumar S, Palanisamy V. A hybrid fuzzy dynamic programming approach to unit commitment. Journal of the Institution of Engineers (India) 2008; 88: 3-9.
[9] Senthil Kumar S, Palanisamy V. A dynamic programming based fast computation Hop?eld neural network for unit commitment and economic dispatch. Electr Pow Syst Res 2006; 77: 917-925.
[10] Kazarlis SA, Bakirtzis AG, Petridis V. A genetic algorithm solution to the unit commitment problem. IEEE T Power Syst 1996; 11: 83-92.
[11] Sheble GB, Fahd GN. Unit commitment literature synopsis. IEEE T Power Syst 1994; 9:128-135.
[12] Padhy NP. Unit commitment-a bibliographical survey. IEEE T Power Syst 2004; 19: 1196-1205.
[13] Ayoub AK, Patton AD. Optimal thermal generating unit commitment. IEEE T Power Ap Syst 1971; 90: 1752-1756.
[14] Van den Bosch PPJ, Honderd G. A solution of the unit commitment problem via decomposition and dynamic programming. IEEE T Power Ap Syst 1985; 104: 1684-1690.
[15] Swarup KS, Yamashiro S. Unit commitment solution methodology using genetic algorithm. IEEE T Power Syst 2002; 17: 87-91.
[16] Ganguly D, Sarkar V, Pai J. A new genetic approach for solving the unit commitment problem. In: International Conference on Power System Technology-POWERCON 2004; 21–24 November 2004; Singapore.
[17] Marifield TT, Sheble GB. Genetic based unit commitment algorithm. IEEE T Power Syst 1996; 11: 1359-1370.
Published
2019-04-30
Section
Articles