第Python解決非線性規(guī)劃中經(jīng)濟(jì)調(diào)度問題輸出結(jié)果

best_x:[1.1.1.]

best_y:[14.]

Processfinishedwithexitcode0

4、電力系統(tǒng)中應(yīng)用經(jīng)濟(jì)調(diào)度

(1)案例

(2)Scipy.optimize實(shí)現(xiàn)

importnumpyasnp

fromscipy.optimizeimportminimize

#目標(biāo)函數(shù)（FG1+FG2+FG3）

deffun(args1):

a0,a1,a2,b0,b1,b2,c0,c1,c2=args1

v=lambdax:(a0+a1*x[0]+a2*x[0]*x[0]

+b0+b1*x[1]+b2*x[1]*x[1]

+c0+c1*x[2]+c2*x[2]*x[2])

returnv

defcon(args2):

D,x0min,x0max,x1min,x1max,x2min,x2max=args2

cons=({'type':'eq','fun':lambdax:D-x[0]-x[1]-x[2]},

{'type':'ineq','fun':lambdax:x[0]-x0min},

{'type':'ineq','fun':lambdax:-x[0]+x0max},

{'type':'ineq','fun':lambdax:x[1]-x1min},

{'type':'ineq','fun':lambdax:-x[1]+x1max},

{'type':'ineq','fun':lambdax:x[2]-x2min},

{'type':'ineq','fun':lambdax:-x[2]+x2max})

returncons

defmain():

args1=(4,0.3,0.0007,3,0.32,0.0004,3.5,0.3,0.00045)

args2=(700,100,200,120,250,150,300)

cons=con(args2)

x0=np.array((150,250,200))#初值

res=minimize(fun(args1),x0,method='SLSQP',constraints=cons)

print('FGi-代價(jià):',res.fun)

print(res.success)

print('PGi—解：',[np.around(i)foriinres.x])

print('PG1:',res.x[0])

print('PG2:',res.x[1])

print('PG3:',res.x[2])

if__name__=="__main__":

main()

輸出結(jié)果

FGi-代價(jià):305.9673913046252

True

PGi解：[176.0,250.0,274.0]

PG1:176.0874477123534

PG2:250.0

PG3:273.9125522876465

Processfinishedwithexitcode0

(3)粒子群包實(shí)現(xiàn)（pyswarm)

pyswarm是一個(gè)支持帶約束的粒子群優(yōu)化包，sko.PSO中的pso僅支持帶上下限的約束，不支持等式和不等式約束，所以不太喜歡。

frompyswarmimportpso

defobject_func(x):

return(4+0.3*x[0]+0.0007*x[0]*x[0]+3+0.32*x[1]+0.0004*x[1]*x[1]+3.5+0.3*x[2]+0.00045*x[2]*x[2])

#不等式約束

defcons1(x):

return[x[0]+x[1]+x[2]-700]

lb=[100,120,150]#

ub=[200,250,300]

xopt,fopt=pso(object_func,lb,ub,ieqcons=[cons1],maxiter=100,swarmsize=1000)

print(xopt)

print(fopt)

輸出結(jié)果

Stoppingsearch:Swarmbestobjectivechangelessthan1e-08

[179.34039956250.270.65960045]

305.97956393103044