下载此文档

物流系统规划.doc


文档分类:行业资料 | 页数:约5页 举报非法文档有奖
1/5
下载提示
  • 1.该资料是网友上传的,本站提供全文预览,预览什么样,下载就什么样。
  • 2.下载该文档所得收入归上传者、原创者。
  • 3.下载的文档,不会出现我们的网址水印。
1/5 下载此文档
文档列表 文档介绍
Logistics Systems Analysis
You are working for ABC Shipping Company. Suppose the short-term demand rate is known in the4);
dingdian=[0,firstbatch];
matrixdd=[]; % matrixdd records the sequence %
qiedian=[D,*D*D];
waitingcost=0;
N=0;
cost=0;
while dingdian(2)<2500
a=*qiedian(1);
b=qiedian(2)-a*qiedian(1);
x=(qiedian(1)-12)::(qiedian(1)+12);
y=a*x+b;
plot(x,y);
waitingcost=waitingcost+huatu(dingdian(1),qiedian(1));
N=N+1;
matrixdd=[matrixdd;dingdian]
nextdd=[qiedian(1),a*qiedian(1)+dingdian(2)-a*dingdian(1)];
x=(dingdian(1)-10)::(qiedian(1)+10);
y=a*x+dingdian(2)-a*dingdian(1);
plot(x,y);
qiedian=[sqrt(4*nextdd(2)),nextdd(2)];
dingdian=nextdd;
end
waitingcost=waitingcost+huatu(dingdian(1),100);
N=N+1;
matrixdd=[matrixdd;[dingdian(1),2500]]
fixedcost=2400*N;
cost=fixedcost+waitingcost;
%the following commandsare to schedule the problem with different initial point. The interval is 5. %
flagbatch=0;
flagcost=10000000;
for i=5:5:2500
if simu(i)<flagcost
flagbatch=i;
flagcost=simu(i);
end
end
flagbatch
flagcost
The result of running:
flagbatch=135
flagcost=34243
Run again with the batch 135,the result is shown in Figure 1:
Figure 1
To make the result more precise, the interval of 1item is used:
flagbatch=0;
flagcost=10000000;
for i=1:1:2500
if simu(i)<flagcost
flagba

物流系统规划 来自淘豆网m.daumloan.com转载请标明出处.

相关文档 更多>>
非法内容举报中心
文档信息
  • 页数5
  • 收藏数0 收藏
  • 顶次数0
  • 上传人taoapp
  • 文件大小56 KB
  • 时间2022-02-25