代码搜索：Demand
找到约 1,286 项符合「Demand」的源代码
代码结果 1,286
www.eeworm.com/read/212602/15152053
m fm_atc.m
function fm_atc
%FM_ATC determine the Available Transfer Capability (ATC)
% by means of an iterative OPF/CPF method or a power
% flow sensitivity analysis
%
%FM_ATC
%
%see OPF and CPF stru
www.eeworm.com/read/212602/15152361
m fm_snb.m
function fm_snb
% FM_SNB compute Saddle-node Bifurcation
% by means of a Direct Method
%
% FM_SNB
%
%System Equations:
% g(y,kg,lambda) = 0 -> operating point
% dg/dy'*ro = 0
www.eeworm.com/read/431224/8695407
m fm_limit.m
function fm_limit
% FM_LIMIT compute Limit-Induced Bifurcation (LIB)
% by means of a Newton-Raphson routine.
%
% FM_LIMIT
%
% LIB.type: 1 = 'Vmax' for maximum voltage limit
%
www.eeworm.com/read/431224/8697320
m setup.m
function a = setup(a)
global Demand
if isempty(a.con), return, end
a.n = length(a.con(:,1));
a.dem = round(a.con(:,1));
a.bus = Demand.bus(a.dem);
if length(a.con(1,:)) < a.ncol
a.con(:,a.ncol) =
www.eeworm.com/read/386978/8714798
m drop.m
function [x1,changex,l1]=drop(x0,l0)
global customer;
global depot;
global demand;
NumberRoute=length(l0);
a=ceil(NumberRoute*rand);
%先计算DD数组
%nowdepot为选择的配送中心
nowdepot=x0(a,1)
www.eeworm.com/read/386978/8714821
m swap_routing.m
function [x1,changex,l1]=swap_routing(x0,l0)
global customer;
global depot;
global demand;
NumberRoute=length(l0);
a=ceil(NumberRoute*rand);
b=ceil(NumberRoute*rand);
while a==b
a=ceil(Nu
www.eeworm.com/read/386978/8714826
m qsolve.m
%function [inventorycost]=Qsolve(v,l)
%v,l分别是路线的集合，数组及顾客的个数
%计算路线总长度
%所有参数部分
v=[3 2 1];
l=2;
customer=4;
demand=[155 98 474
178 191 365
78 88 365
50 65 200
www.eeworm.com/read/386978/8714846
m untitled.m
global customer;
global depot;
global demand;
global bestx;
global bestl;
global bestSC;
customer=10;
depot=3;
demand=[142 85 385
163 175 430
87 96 540
63 57 324
www.eeworm.com/read/386978/8714851
m time.m
function cost_time=time(v,l)
global demand;
global depot;
global customer;
global ET;
global LT;
global S;
global La;
global Ea;
global sudu;
T=zeros(1,customer+depot);
cost_time=0;
T(v
www.eeworm.com/read/386978/8714862
m swap_location.m
function [x1,changex,l1]=swap_location(x0,l0)
global customer;
global depot;
global demand;
NumberRoute=length(l0);
a=ceil(NumberRoute*rand);
b=0;
for j=1:NumberRoute
if x0(a,1)~=x0(j,1)