简介
文章简介
为满足共享储能中储能用户的互补性和替代性需求、解决常规单向拍卖中可能存在的垄断竞争问题，提出了基于组合双向拍卖的共享储能机制。在该机制中，储能运营商和储能用户在拍卖商的组织下进行组合双向拍卖。拍卖包含四个阶段：投标、竞胜标决定问题、资源匹配与定价、资金结算。相较于现有拍卖机制，该机制支持“与”投标，使得买家的互补性需求得以准确而简洁地表达。在竞胜标决定问题方面，建立了以社会福利最大化为目标的混合整数非线性规划模型。进一步，将该模型等价转化为混合整数线性规划模型，大幅降低了计算时间复杂度。在定价方面，提出了在买卖双方之间均分社会福利的定价机制，打破了传统单向拍卖的垄断弊端。最后，通过算例验证了所提机制的有效性。
文章框架：
文章结果：
程序结果
部分程序：
%% 假设决策变量%买家1-7b1 = binvar(1,6); b2 = binvar(1,6); b3 = binvar(1,6); b4 = binvar(1,6);b55=binvar(1,4); b5 = [0,0,b55]; b66=binvar(1,3);b6 = [b66(1),0,0,b66(2),0,b66(3)]; b7 = binvar(1,6);%卖家1-6s11=sdpvar(1,3);s1 = [s11,0,0,0;]; s22=sdpvar(1,4); s2 = [0,0,s22];s33=sdpvar(1,3); s3 = [s33(1),0,0,0,s33(2),s33(3)]; s44=sdpvar(1,2);s4 = [s44,0,0,0,0;]; s55=sdpvar(1,4); s5 = [0,s55(1:3),0,s55(4)];s66=sdpvar(1,4); s6 = [s66(1),0,0,s66(2:4)];%辅助变量,买家1和4u1 = sdpvar(1,1); u4 = sdpvar(1,1); v1 = sdpvar(1,1); v4 = sdpvar(1,1);z1 = binvar(1,1); z4 = binvar(1,1);%% 约束%% 买家约束constraint=[];%买家1constraint = [constraint, u1 == sum(b1)-2 ]; constraint = [constraint, v1 == sum(b1) ];constraint = [constraint, -2*z1 <= u1 <=0 ]; constraint = [constraint,0<= v1 <= 2*(1-z1) ];%买家2constraint = [constraint,0<= sum(b2) <= 1 ];%买家3constraint = [constraint,0<= sum(b3) <= 2];%买家4constraint = [constraint, u4 == sum(b4)-3 ];constraint = [constraint, v4 == sum(b4) ];constraint = [constraint, -3*z4 <= u4 <=0 ];constraint = [constraint,0<= v4 <= 3*(1-z4) ];%买家5constraint = [constraint,0<= sum(b5) <= 4];%买家6constraint = [constraint,0<= sum(b6) <= 1];%买家7constraint = [constraint,0<= sum(b7) <= 1];
部分内容源自网络，侵权联系删除！
欢迎感兴趣的小伙伴点击文末阅读原文获取完整版代码，小编会不定期更新高质量的学习资料、文章和程序代码，为您的科研加油助力！
更多创新性预测及优化程序请点击公众号首页：《预测优化》|《综合能源》链接！
