代码搜索：Demand
找到约 1,286 项符合「Demand」的源代码
代码结果 1,286
www.eeworm.com/read/136989/5829488
bor makefile.bor
#
# Makefile.bor,v 1.9 2003/12/20 14:05:46 jwillemsen Exp
#
# Makefile for building the TAO POA examples
DIRS = \
Default_Servant \
DSI \
FindPOA \
Forwarding
www.eeworm.com/read/346012/11774604
java modify_ok.java
/*
*this file is part of nseer erp
*Copyright (C)2006-2010 Nseer(Beijing) Technology co.LTD/http://www.nseer.com
*
*This program is free software; you can redistribute it and/or
*modify it
www.eeworm.com/read/409797/11311463
pdf dc-opf formulation with price-sensitive demand bids.pdf
www.eeworm.com/read/431224/8695489
m dmclass.m
function a = DMclass(varargin)
% constructor of the class Demand
% == Demand load ==
global Settings
switch nargin
case 0
a.con = [];
a.n = 0;
a.bus = [];
a.vbus = [];
a.u = [];
a.store
www.eeworm.com/read/431224/8698005
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/386978/8714790
asv main.asv
timebegin=cputime;
%初始化定义全局变量
global customer;
global depot;
global demand;
global bestx;
global bestl;
global bestSC;
global best_iter;
global UD;
global c;
global cm;
global h;
global A
www.eeworm.com/read/386978/8714791
asv qsolve.asv
function [inventorycost]=Qsolve(v,l)
%v,l分别是路线的集合，数组及顾客的个数
%计算路线总长度
%所有参数部分
demand=[155 98 474
178 191 365
50 65 200];
depot=[38 133
22 76
174 193];
www.eeworm.com/read/386978/8714792
m sc.m
function cost=SC(v,l)
global customer;
global depot;
global demand;
global FC;
global W;
J=depot;
z=zeros(1,J);
%解码z(j)
vk=length(l);
Dk=zeros(1,J);
for k=1:vk
z(v(k,1))=1;
D
www.eeworm.com/read/386978/8714795
m sc_test.m
function cost=SC(v,l)
global customer;
global depot;
global demand;
global FC;
global W;
v=[ 3 6 0
3 14 5
3 12 10
1 15 8
1 7 1
www.eeworm.com/read/386978/8714855
m main.m
timebegin=cputime;
%初始化定义全局变量
global customer;
global depot;
global demand;
global bestx;
global bestl;
global bestSC;
global best_iter;
global UD;
global c;
global cm;
global h;
global A