Abstract
A bi-objective optimization approach is presented for solving a generation company short-term thermal schedule problem with a few units, considering the goodness of being schedule, but with emission concern. The startup and shutdown for each unit throughout the time horizon is derived from Pareto-optimal solutions, using a method merging dynamic programming and nonlinear programming to provide schedule of the units. A case study is presented to prove the effectiveness of the approach.
Chapter PDF
Similar content being viewed by others
References
Yamashita, D., Niimura, T., Yokoyama, R., Marmiroli, M.: Pareto-optimal solutions for trade-off analysis of CO2 vs. cost based on DP unit commitment. In: Proc. 2010 Int. Conf. on Power System Technology, Zhejiang, Hangzhou, China, pp. 1–6 (2010)
Catalão, J.P.S., Mendes, V.M.F.: Influence of environmental constraints on profit-based short-term thermal scheduling. IEEE Trans. Sustainable Energy 2, 131–138 (2011)
Eurostat, Archive agriculture, environment, energy and transport statistics. Eurostat – Statistics Explained 4, 1–1042 (2012)
Xie, J., Zhong, J., Li, Z., Gan, D.: Environmental-economic unit commitment using mixed-integer linear programming. Euro. Trans. Electr. Power 21, 772–786 (2011)
Heredia, F.J., Rider, M.J., Corchero, C.: A stochastic programming model for the optimal electricity market bid problem with bilateral contracts for thermal and combined cycle units. Annals of Oper. Res. 193, 107–127 (2012)
Burns, R.M., Gibson, C.A.: Optimization of priority lists for a unit commitment program. In: Proc. Conf. of IEEE/Power Engineering Society Summer Meeting, pp. 453–456 (1975)
Mantawy, A.H., Abdel-Magid, Y.L., Seliin, S.Z.: A simulated annealing algorithm for unit commitment. IEEE Trans. Power Syst. 13, 197–204 (1998)
Senjyu, T., Shimabukuro, K., Uezato, K., Funabashi, T.: A fast technique for unit commitment problem by extended priority list. IEEE Trans. Power Syst. 18, 882–888 (2003)
Chandrasekaran, K., Hemamalini, S., Simon, S.P., Padhy, N.P.: Thermal unit commitment using binary/real coded artificial bee colony algorithm. Electr. Power Syst. Res. 84, 109–119 (2012)
Zhuang, F., Galiana, F.D.: Towards a more rigorous and practical unit commitment by Lagrangian relaxation. IEEE Trans. Power Apparatus Syst. 102, 1218–1225 (1983)
Ouyang, Z., Shahidehpour, M.: A hybrid artificial neural network-dynamic programming approach to unit commitment. IEEE Trans. Power Syst. 7, 236–242 (1992)
Kazarlis, S.A., Bakirtzis, A.G., Petridis, V.: A genetic algorithm solution to the unit commitment problem. IEEE Trans. Power Syst. 11, 83–92 (1996)
Dhillon, J.S., Kothari, D.P.: Economic-emission load dispatch using binary successive approximation-based evolutionary search. IET Gener. Trans. Distrib. 3, 1–16 (2009)
Wong, S.Y.W.: An enhanced simulated annealing approach to unit commitment. Int. J. Electr. Power Energy Syst. 20, 359–368 (1998)
Abido, M.A.: Multiobjective particle swarm optimization for environmental/economic dispatch problem. Elect. Power Syst. Res. 79, 1105–1113 (2009)
Wood, A.J., Wollenberg, B.F.: Power Generation, Operation and Control. Wiley, New York (1996)
Gjengedal, T.: Emission constrained unit-commitment (ECUC). IEEE Trans. Energy Convers. 11, 132–138 (1996)
Sistema Electrónico de Negociação de Direitos de Emissão de CO2, http://www.sendeco2.com
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 IFIP International Federation for Information Processing
About this paper
Cite this paper
Laia, R., Pousinho, H.M.I., Melício, R., Mendes, V.M.F., Reis, A.H. (2013). Schedule of Thermal Units with Emissions in a Spot Electricity Market. In: Camarinha-Matos, L.M., Tomic, S., Graça, P. (eds) Technological Innovation for the Internet of Things. DoCEIS 2013. IFIP Advances in Information and Communication Technology, vol 394. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37291-9_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-37291-9_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37290-2
Online ISBN: 978-3-642-37291-9
eBook Packages: Computer ScienceComputer Science (R0)