node33.rar_IEEE33yalmip_YALMIP优化_ieee33优化_yalmip建模_yalmip程序_IEEE33关于CPLEX的经济调度程序资源-CSDN文库

共1个文件

m：1个

版权申诉

5星 · 超过95%的资源 36 浏览量 2022-07-14 11:20:03 上传评论 3 收藏 2KB RAR 举报

标题中的“node33.rar”指的是一个针对IEEE 33节点电力系统的压缩文件，而“IEEE33 yalmip”表明这份程序是使用YALMIP工具箱在MATLAB环境中解决与IEEE 33节点系统相关的优化问题。YALMIP（Yet Another Linear Modeler in MATLAB）是一个强大的建模环境，常用于线性和非线性优化问题的建模。YALMIP能够将复杂的数学表达式转换为适合各种优化求解器的形式。 “YALMIP优化”指的是使用YALMIP进行的优化过程。YALMIP允许用户定义变量、约束和目标函数，然后通过接口调用各种优化求解器，如CPLEX、GUROBI、MOSEK等，来寻找问题的最优解。在电力系统中，优化问题可能涉及到功率分配、网络重构、经济调度等方面。 “ieee33优化”是指针对IEEE 33节点标准测试系统的特定优化问题。IEEE 33节点系统常被用作中型配电网的研究对象，因为它包含了足够的复杂性来模拟真实世界的挑战，同时又不至于过于庞大，使得计算和分析变得困难。 “yalmip建模”意味着使用YALMIP构建了这个优化问题的数学模型。在电力系统中，这可能包括设定发电机的输出、线路的功率流限制、电压稳定性约束等。YALMIP的建模语言简洁明了，使得模型的建立和修改相对容易。 “yalmip程序”则暗示了压缩包中包含的是一个使用YALMIP编写的MATLAB程序，可能是为了实现特定的电力系统优化算法。这个程序名为“node33.m”，很可能是一个主脚本，它导入必要的数据，定义系统模型，设置优化问题，并调用YALMIP进行求解。在实际应用中，这样的程序可能会解决如下问题：最小化发电成本，同时满足负荷需求、保持电压稳定、确保线路不超过其热容量限制等。YALMIP的灵活性使得它可以处理混合整数线性规划（MILP）、二次规划（QP）、非线性规划（NLP）等多种类型的优化问题。这个压缩文件提供了一个基于IEEE 33节点系统的优化问题的示例，对于学习如何使用YALMIP解决电力系统优化问题的学者或工程师来说，这是一个宝贵的资源。用户可以研究“node33.m”脚本来理解如何建模和求解这类问题，同时也可扩展或调整代码以适应其他类似系统或优化目标。

资源详情

资源评论

资源推荐

收起资源包目录

node33.rar （1个子文件）

node33.m 9KB

clc clear format short BranchData = [ 1 2 0.0922 0.0470; 2 3 0.4930 0.2511; 3 4 0.3660 0.1864; 4 5 0.3811 0.1941; 5 6 0.8190 0.7070; 6 7 0.1872 0.6188; 7 8 0.7114 0.2351; 8 9 1.0300 0.7400; 9 10 1.0440 0.7400; 10 11 0.1966 0.0650; 11 12 0.3744 0.1238; 12 13 1.4680 1.1550; 13 14 0.5416 0.7129; 14 15 0.5910 0.5260; 15 16 0.7463 0.5450; 16 17 1.2890 1.7210; 17 18 0.7320 0.5740; 2 19 0.1640 0.1565; 19 20 1.5042 1.3554; 20 21 0.4095 0.4784; 21 22 0.7089 0.9373; 3 23 0.4512 0.3083; 23 24 0.8980 0.7091; 24 25 0.8960 0.7011; 6 26 0.2030 0.1034; 26 27 0.2842 0.1447; 27 28 1.0590 0.9337; 28 29 0.8042 0.7006; 29 30 0.5075 0.2585; 30 31 0.9744 0.9630; 31 32 0.3105 0.3619; 32 33 0.3410 0.5302; ]; % 支路，阻抗 NodeData = [ NodeData1,NodeData2,NodeData3,NodeData4,NodeData5,NodeData6,... NodeData7,NodeData8,NodeData9,NodeData10,NodeData11,NodeData12,... NodeData13,NodeData14,NodeData15,NodeData16,NodeData17,NodeData18,... NodeData19,NodeData20,NodeData21,NodeData22,NodeData23,NodeData24 ]; % 节点，负荷 ESSrange = [ %本程序以储能充电作为正方向 1 17 200 80 2 33 200 80 3 30 150 50 4 14 150 50 ]; %储能位置与充放电有功无功边界 UB = 12.66; % 电压基准 kV SB = 10; % 功率基准 MVA ZB = UB^2/SB; % 阻抗基准 ohm BranchData(:,[3,4]) = BranchData(:,[3,4]) / ZB; % 阻抗标幺化 NodeData(:,[2,3]) = NodeData(:,[2,3]) / SB / 1000;% 功率标幺化 ESSrange(:,[3,4]) = ESSrange(:,[3,4]) / SB / 1000;% 储能功率标幺化 NodeData=NodeData(1,n); NN=33;%节点数 Nzhilu=NN-1;%支路数 Ness=length(ESSrange(:,1));%储能数量 Pij=sdpvar(1,Nzhilu); Qij=sdpvar(1,Nzhilu); I2ij=sdpvar(1,Nzhilu); V2ij=sdpvar(1,Nzhilu); Pess=sdpvar(1,Ness); Qess=sdpvar(1,Ness); % l=sdpvar(1,1); %目标函数 Objective=0; for k=1:Nzhilu Objective=Objective+I2ij(k)*BranchData(k,3); end %约束条件 Constraints=[]; %功率平衡约束 %分支节点编号2、3、6 %末端节点编号18、22、25、33 %有功约束 k=1; Constraints=[Constraints,Pij(k)-BranchData(k,3)*I2ij(k)==Pij(k+1)+Pij(18)+NodeData(k,2)]; k=2; Constraints=[Constraints,Pij(k)-BranchData(k,3)*I2ij(k)==Pij(k+1)+Pij(22)+NodeData(k,2)]; for k=3:4 Constraints=[Constraints,Pij(k)-BranchData(k,3)*I2ij(k)==Pij(k+1)+NodeData(k,2)]; end k=5; Constraints=[Constraints,Pij(k)-BranchData(k,3)*I2ij(k)==Pij(k+1)+Pij(25)+NodeData(k,2)]; for k=6:12 Constraints=[Constraints,Pij(k)-BranchData(k,3)*I2ij(k)==Pij(k+1)+NodeData(k,2)]; end k=13; Constraints=[Constraints,Pij(k)-BranchData(k,3)*I2ij(k)==Pij(k+1)+Pess(4)+NodeData(k,2)]; for k=14:15 Constraints=[Constraints,Pij(k)-BranchData(k,3)*I2ij(k)==Pij(k+1)+NodeData(k,2)]; end k=16; Constraints=[Constraints,Pij(k)-BranchData(k,3)*I2ij(k)==Pij(k+1)+Pess(1)+NodeData(k,2)]; % for k=6:16 % Constraints=[Constraints,Pij(k)-BranchData(k,3)*I2ij(k)==Pij(k+1)+NodeData(k,2)]; % end k=17; Constraints=[Constraints,Pij(k)-BranchData(k,3)*I2ij(k)==NodeData(k,2)]; for k=18:20 Constraints=[Constraints,Pij(k)-BranchData(k,3)*I2ij(k)==Pij(k+1)+NodeData(k,2)]; end k=21; Constraints=[Constraints,Pij(k)-BranchData(k,3)*I2ij(k)==NodeData(k,2)]; for k=22:23 Constraints=[Constraints,Pij(k)-BranchData(k,3)*I2ij(k)==Pij(k+1)+NodeData(k,2)]; end k=24; Constraints=[Constraints,Pij(k)-BranchData(k,3)*I2ij(k)==NodeData(k,2)]; for k=25:28 Constraints=[Constraints,Pij(k)-BranchData(k,3)*I2ij(k)==Pij(k+1)+NodeData(k,2)]; end k=29; Constraints=[Constraints,Pij(k)-BranchData(k,3)*I2ij(k)==Pij(k+1)+Pess(3)+NodeData(k,2)]; for k=30:31 Constraints=[Constraints,Pij(k)-BranchData(k,3)*I2ij(k)==Pij(k+1)+NodeData(k,2)]; end % for k=25:31 % Constraints=[Constraints,Pij(k)-BranchData(k,3)*I2ij(k)==Pij(k+1)+NodeData(k,2)]; % end k=32; Constraints=[Constraints,Pij(k)-BranchData(k,3)*I2ij(k)==NodeData(k,2)+Pess(2)]; %无功约束 k=1; Constraints=[Constraints,Qij(k)-BranchData(k,4)*I2ij(k)==Qij(k+1)+Qij(18)+NodeData(k,3)]; k=2; Constraints=[Constraints,Qij(k)-BranchData(k,4)*I2ij(k)==Qij(k+1)+Qij(22)+NodeData(k,3)]; for k=3:4 Constraints=[Constraints,Qij(k)-BranchData(k,4)*I2ij(k)==Qij(k+1)+NodeData(k,3)]; end k=5; Constraints=[Constraints,Qij(k)-BranchData(k,4)*I2ij(k)==Qij(k+1)+Qij(25)+NodeData(k,3)]; for k=6:12 Constraints=[Constraints,Qij(k)-BranchData(k,4)*I2ij(k)==Qij(k+1)+NodeData(k,3)]; end k=13; Constraints=[Constraints,Qij(k)-BranchData(k,4)*I2ij(k)==Qij(k+1)+Qess(4)+NodeData(k,3)]; for k=14:15 Constraints=[Constraints,Qij(k)-BranchData(k,4)*I2ij(k)==Qij(k+1)+NodeData(k,3)]; end k=16; Constraints=[Constraints,Qij(k)-BranchData(k,4)*I2ij(k)==Qij(k+1)+Qess(1)+NodeData(k,3)]; % for k=6:16 % Constraints=[Constraints,Qij(k)-BranchData(k,4)*I2ij(k)==Qij(k+1)+NodeData(k,3)]; % end k=17; Constraints=[Constraints,Qij(k)-BranchData(k,4)*I2ij(k)==NodeData(k,3)]; for k=18:20 Constraints=[Constraints,Qij(k)-BranchData(k,4)*I2ij(k)==Qij(k+1)+NodeData(k,3)]; end k=21; Constraints=[Constraints,Qij(k)-BranchData(k,4)*I2ij(k)==NodeData(k,3)]; for k=22:23 Constraints=[Constraints,Qij(k)-BranchData(k,4)*I2ij(k)==Qij(k+1)+NodeData(k,3)]; end k=24; Constraints=[Constraints,Qij(k)-BranchData(k,4)*I2ij(k)==NodeData(k,3)]; for k=25:28 Constraints=[Constraints,Qij(k)-BranchData(k,4)*I2ij(k)==Qij(k+1)+NodeData(k,3)]; end k=29; Constraints=[Constraints,Qij(k)-BranchData(k,4)*I2ij(k)==Qij(k+1)+Qess(3)+NodeData(k,3)]; for k=30:31 Constraints=[Constraints,Qij(k)-BranchData(k,4)*I2ij(k)==Qij(k+1)+NodeData(k,3)]; end % for k=25:31 % Constraints=[Constraints,Qij(k)-BranchData(k,4)*I2ij(k)==Qij(k+1)+NodeData(k,3)]; % end k=32; Constraints=[Constraints,Qij(k)-BranchData(k,4)*I2ij(k)==NodeData(k,3)+Qess(2)]; %二阶锥约束 %不等式约束 for k=1:Nzhilu Constraints=[Constraints,1.05>=V2ij(k)>=0.95]; end for k=1:Nzhilu Constraints=[Constraints,I2ij(k)<=1]; end for k=1:Ness Constraints=[Constraints,ESSrange(k,3)>=Pess(k)>=-ESSrange(k,3),ESSrange(k,4)>=Qess(k)>=-ESSrange(k,4)]; end %等式约束 k=1; Constraints=[Constraints,V2ij(k)==1-2*(BranchData(k,3)*Pij(k)+BranchData(k,4)*Qij(k))+((BranchData(k,3))^2+(BranchData(k,4))^2)*I2ij(k)]; for k=2:17 Constraints=[Constraints,V2ij(k)==V2ij(k-1)-2*(BranchData(k,3)*Pij(k)+BranchData(k,4)*Qij(k))+((BranchData(k,3))^2+(BranchData(k,4))^2)*I2ij(k)]; end k=18; Constraints=[Constraints,V2ij(k)==V2ij(1)-2*(BranchData(k,3)*Pij(k)+BranchData(k,4)*Qij(k))+((BranchData(k,3))^2+(BranchData(k,4))^2)*I2ij(k)]; for k=19:21 Constraints=[Constraints,V2ij(k)==V2ij(k-1)-2*(BranchData(k,3)*Pij(k)+BranchData(k,4)*Qij(k))+((BranchData(k,3))^2+(BranchData(k,4))^2)*I2ij(k)]; end k=22; Constraints=[Constraints,V2ij(k)==V2ij(2)-2*(BranchData(k,3)*Pij(k)+BranchData(k,4)*Qij(k))+((BranchData(k,3))^2+(BranchData(k,4))^2)*I2ij(k)]; for k=23:24 Constraints=[Constraints,V2ij(k)==V2ij(k-1)-2*(BranchData(k,3)*Pij(k)+BranchData(k,4)*Qij(k))+((BranchData(k,3))^2+(BranchData(k,4))^2)*I2ij(k)]; end k=25; Constraints=[Constraints,V2ij(k)==V2