PING Jian, ZHAN Qiang, GAO Yuanhai, et al. A Unit Commitment Algorithm for Trustworthy Clearing in Spot Market[J]. 2026, 46(5): 1755-1764.DOI: 10.13334/j.0258-8013.pcsee.241955.
安全约束机组组合(security constrained unit commitment,SCUC)是现货市场出清的核心环节。传统集中求解方法下,SCUC模型求解过程处于“黑箱状态”,求解结果最优性难以验证,各市场参与方可能对求解结果可信赖性产生质疑。为此,以区块链为支撑技术,提出面向现货市场可信出清的机组组合求解方法。首先,提出“链上分割比对寻优,链下并行容错求解”思想,建立链上-链下协同的SCUC求解架构,解决了传统区块链技术难以支撑SCUC模型求解任务的局限;随后,建立了机组组合解空间容错分割方法,并进行最优性证明,以兼顾区块链环境下SCUC模型求解结果可信赖性和求解过程的效率性;最后,设计了相应的SCUC可信求解智能合约。算例测试结果表明,所提SCUC模型可信求解方法具有最优性可验证、满足拜占庭容错性和求解高效性的优点。
Abstract
Security constrained unit commitment (SCUC) is a core aspect of spot market clearing. Under the traditional centralized solving method
the SCUC model solving process is in a "black box state". This makes it difficult to verify the optimality of the results
and market participants may question the reliability of the solution.. To address the above challenges
this paper proposes a blockchain-based unit commitment algorithm for trustworthy clearing in spot market. First
the concept of "on-chain partitioning for optimization and off-chain parallel fault-tolerant solving" is proposed. A SCUC solving architecture based on on-chain and off-chain collaboration is established to overcome the limitations of traditional blockchain technologies in supporting SCUC tasks. Then
a fault-tolerant partitioning method for the unit commitment solution space is developed
along with an optimality proof
to balance the reliability of SCUC solutions and the efficiency of the solving process within the blockchain environment. Finally
a corresponding trustworthy SCUC solving smart contract is designed. The simulation results of the proposed trustworthy SCUC algorithm demonstrate its advantages in verifiable optimality