Self-Scheduling of a Generation Company with Carbon Emission Trading

  • Sidong Liu Wuyi University
  • Handong Cao
  • Xijian Wang
DOI: https://doi.org/10.19139/soic-2310-5070-1763

Abstract

A carbon emission trading self-scheduling (CETSS) model was proposed. The proposed model considered not only carbon emission allowance constraints but also carbon emission trading. A new method was presented for solving CETSS problems based on piece-wise linearisation and second-order cone linearisation. The effectiveness and validity of the proposed model and method were illustrated by 10-100 unit systems over 24 hours.

References

Reddy, K Srikanth and Panwar, Lokesh Kumar and Kumar, Rajesh and Panigrahi, BK, Binary fireworks algorithm for profit based unit commitment (PBUC) problem, International Journal of Electrical Power & Energy Systems, vol. 83, pp. 270–282, 2016.

Ghadi, M Jabbari and Baghramian, Alfred and Imani, M Hosseini, An ICA based approach for solving profit based unit commitment problem market, Applied Soft Computing, vol. 38, pp. 487–500, 2016.

Sudhakar, AVV and Karri, Chandram and Laxmi, A Jaya, Profit based unit commitment for GENCOs using Lagrange relaxation–differential evolution, Engineering Science and Technology, an International Journal, vol. 20, no. 2, pp. 738–747, 2017.

Anand, Himanshu and Narang, Nitin and Dhillon, JS, Profit based unit commitment using hybrid optimization technique, Energy, vol. 148, pp. 701–715, 2018.

Dhaliwal, Jatinder Singh and Dhillon, JS, Profit based unit commitment using memetic binary differential evolution algorithm, Applied soft computing, vol. 81, pp. 105502, 2019.

Kumar, Vineet and Naresh, R and Singh, Amita, Scheduling of Energy on Deregulated Environment of Profit based Unit Commitment Problem, 2020 IEEE 9th Power India International Conference (PIICON). 1–6, 2020.

Elkamel, Marwen and Ahmadian, Ali and Diabat, Ali and Zheng, Qipeng P, Stochastic optimization for price-based unit commitment in renewable energy-based personal rapid transit systems in sustainable smart cities, Sustainable Cities and Society, vol. 65, pp. 102618, 2021.

Jabari, Farkhondeh and Mohammadi-ivatloo, Behnam and Mohammadpourfard, Mousa, Robust optimal self-scheduling of potable water and power producers under uncertain electricity prices, Applied Thermal Engineering, vol. 162, pp. 114258, 2019.

Liu, Sidong and Chevallier, Julien and Zhu, Bangzhu, Self-scheduling of a power generating company: Carbon tax considerations, Computers & Operations Research, vol. 66, pp. 384–392, 2016.

Pousinho, Hugo Miguel In´acio and Silva, H and Mendes, VMF and Collares-Pereira, Manuel and Cabrita, C Pereira, Self-scheduling for energy and spinning reserve of wind/CSP plants by a MILP approach, Energy, vol. 78, pp. 524–534, 2014.

Yang, Linfeng and Li, Wei and Chen, Guo and Fang, Beihua and Tang, Chunming, A quick center-point algorithm for unit commitment with carbon emission trading, International Journal of Electrical Power & Energy Systems, vol. 120, pp. 105996, 2020.

Reddy, Srikanth and Panwar, Lokesh and Panigrahi, Bijaya Ketan and Kumar, Rajesh and Goel, Lalit and Al-Sumaiti, Ameena Saad, A profit-based self-scheduling framework for generation company energy and ancillary service participation in multi-constrained environment with renewable energy penetration, Energy & environment, vol. 31, no. 4, pp. 549–569, 2020.

Carri´on, Miguel and Arroyo, Jos´e M, A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem, IEEE Transactions on power systems, vol. 21, no. 3, pp. 1371–1378, 2006.

Zheng, Haiyan and Jian, Jinbao and Yang, Linfeng and Quan, Ran, A deterministic method for the unit commitment problem in power systems, Computers & Operations Research, vol. 66, pp. 241–247, 2016.

Quan, Ran and Jian, Jin-bao and Mu, Yun-dong, Tighter relaxation method for unit commitment based on second-order cone programming and valid inequalities, International Journal of Electrical Power & Energy Systems, vol. 55, pp. 82–90, 2014.

Ben-Tal, Aharon and Nemirovski, Arkadi, On polyhedral approximations of the second-order cone, Mathematics of Operations Research, vol. 26, no. 2, pp. 193–205, 2001.

Pang, Xiali and Zheng, Haiyan and Huang, Liying and Liang, Yumei, Outer Approximation Method for the Unit Commitment Problem with Wind Curtailment and Pollutant Emission, Mathematics, vol. 9, no. 21, pp. 2686, 2021.

Ostrowski, James and Anjos, Miguel F and Vannelli, Anthony, Tight mixed integer linear programming formulations for the unit commitment problem, IEEE Transactions on Power Systems, vol. 27, no. 1, pp. 39–46, 2011.

Yuan, Xiaohui and Tian, Hao and Zhang, Shuangquan and Ji, Bin and Hou, Yanhong, Second-order cone programming for solving unit commitment strategy of thermal generators, Energy conversion and management, vol. 76, pp. 20–25, 2013.

Published
2023-05-11
How to Cite
Liu, S., Cao, H., & Wang, X. (2023). Self-Scheduling of a Generation Company with Carbon Emission Trading. Statistics, Optimization & Information Computing, 11(3), 785-797. https://doi.org/10.19139/soic-2310-5070-1763
Issue
Vol 11 No 3 (2023)
Section
Research Articles
Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
    2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
    3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).