An improved cost estimation for unit commitment using back propagation algorithm
DOI:
https://doi.org/10.11113/mjfas.v15n2.1146Keywords:
Load, power plant, algorithm, commitmentAbstract
The daily load is the main issue for many power plant industries that are affected by the varying maximum and minimum peak hours. Due to electricity being used less during the weekends, compared to weekdays, where the spending is higher. The same logic applies to day and night spending, which requires balancing among the units so that it can operate during high demand hours. The main problem is to determine the units that will be affected according to the operation schedule which means which unit, and for how long, will it stay on or off. In this context, the main objective for unit commitment, in general, minimizes the total cost of operating a unit, and at the same time maintain the constraints met. Several approaches and techniques used in existing studied, each have a solution for the optimal unit commitment problem. Some of the approaches presented, use complex methods in order to address the issues, while others use simple forms to do the same task. The problem of operation scheduling for unit commitment will be different depending on the type of industry, and according to the plan of mixing unit and operating constraints.
References
Lin, C. E., Chen, S. T., & Huang, C. L. (1992). A direct Newton-Raphson economic dispatch. IEEE Transactions on Power Systems, 7(3), 1149-1154.
Guan, X., Luh, P. B., & Zhang, L. (1995). Nonlinear approximation method in Lagrangian relaxation-based algorithms for hydrothermal scheduling. IEEE Transactions on Power Systems, 10(2), 772-778.
Hindi, K. S., & Ab Ghani, M. R. (1991). Dynamic economic dispatch for large scale power systems: A Lagrangian relaxation approach. International Journal of Electrical Power & Energy Systems, 13(1), 51-56.
Granelli, G. P., Marannino, P., Montagna, M., & Silvestri, A. (1989, September). Fast and efficient gradient projection algorithm for dynamic generation dispatching. IEE Proceedings C (Generation, Transmission and Distribution), 136(5), 295-302.
Wang, K. P., & Yuryevich, J. (1998). Evolutionary-programming-based algorithm for environmentally-constrained economic dispatch. IEEE Transactions on Power Systems, 13(2), 301-306.
Zhuang, F. & Galiana, F.D. (1990).Unit Commitment by Simulated Annealing,” IEEE Transactions. on Power Systems, 5 (1), 311-318
Khamsawang, S., Booseng, C. & Pothiya, S., (2002). Solving the economic dispatch problem with Tabu search algorithm. IEEE International Conference on Industrial Technology, 1, 108-112.
Roa-Sepulveda C. A., Herrera M., Pavez-Lazo B., Knight U. G., & Coonick A.H. (2003). Economic dispatch using fuzzy decision trees. Electric Power Systems Research, 66 (2), 115-122.
Tung, N. S., Kaur, G., Kaur, G., & Bhardwaj, A. (2012). Optimization techniques in unit commitment. A review. International Journal of Engineering Science and Technology (IJEST), 4(4), 1623-1627.
Nemati, M., Braun, M., &Tenbohlen, S. (2018). Optimization of unit commitment and economic dispatch in microgrids based on genetic algorithm and mixed integer linear programming. Applied Energy, 210, 944-963.
Li, W., Peng, H. Y., Zhu, W. H., Sheng, D. R., & Chen, J. H. (2009). An immune-tabu hybrid algorithm for thermal unit commitment of electric
power systems. Journal of Zhejiang University-SCIENCE A, 10(6), 877-889.
Bello, S. A., Akorede, M. F., Pouresmaeil, E., & Ibrahim, O. (2016). Unit commitment optimisation of hydro-thermal power systems in the day-ahead electricity market. Cogent Engineering, 3(1), 1251009.
Morales-España, G., Latorre, J. M., & Ramos, A. (2013). Tight and compact MILP formulation for the thermal unit commitment problem. IEEE Transactions on Power Systems, 28(4), 4897-4908.
M. Tuffaha, and J. T. Gravdahl. (2013). Mixed-Integer Formulation of Unit Commitment problem for power systems: Focus on start-up cost. To be published in Proceedings of the 39th Annual Conference of the IEEE Industrial Electronics (IECON’13), Nov. 2013.
Shao, C., Wang, X., Shahidehpour, M., Wang, X., & Wang, B. (2017). Security-constrained unit commitment with flexible uncertainty set for variable wind power. IEEE Transactions on Sustainable Energy, 8(3), 1237-1246.
Luh, P. B., Wang, Y., & Zhao, X. (1999). Lagrangian relaxation neural network for unit commitment. In Power Engineering Society 1999 Winter Meeting, IEEE, 1, 490-495.
Alzaidi, A. I., Turki, B., Mlkt, S. M., Martin, A., Hashim, O., & Gupta, N. Neuron-MOSFET Junction with Sodium Potassium Voltage Gate Channel. equilibrium. 2014 IEEE Long Island Systems, Applications and Technology Conference (LISAT 2014), 7, 1.
al-Mutoki, S. M. M., Basha, A. D., Mnaathr, S. H., Atiyha, B. T. (2014). Integrating Wireless Communication and Broadband Powerline Communication: Applications of Networking of Depreciation Data Acquiring System. International Journal of Scientific & Engineering Research, 5(3), 825-828.
Kumar, S. S., & Palanisamy, V. (2007). A dynamic programming based fast computation Hopfield neural network for unit commitment and economic dispatch. Electric power systems research, 77(8), 917-925.
Ouyang, Z., & Shahidehpour, S. M. (1992). A hybrid artificial neural network-dynamic programming approach to unit commitment. IEEE Transactions on Power Systems, 7(1), 236-242.
Ronne-Hansen, P., & Ronne-Hansen, J. (1991, July). Neural networks as a tool for unit commitment. In Neural Networks to Power Systems, 1991., Proceedings of the First International Forum on Applications of Neural Networks to Power System (pp. 266-270). Seattle, USA: IEEE.
Jahromi, M. Z., Bioki, M. M. H., Nejad, M. R., & Fadaeinedjad, R. (2013). Solution to the unit commitment problem using an artificial neural network. Turkish Journal of Electrical Engineering & Computer Sciences, 21(1), 198-212.
Nayak, R., & Sharma, J. D. (2000). A hybrid neural network and simulated annealing approach to the unit commitment problem. Computers & Electrical Engineering, 26(6), 461-477.
