物流运作优化实验课概要1.pptxVIP

有两家面包店（B1, B2)以及四个客户（C1, C2, C3, C4)。面包店B1每天最多生产800个面包，而面包店B2每天最多生产600个面包。客户（C1, C2, C3, C4) 对于面包的需求分别为150, 250, 350 and 450 个/天，面包店至客户的单位运输成本如下图所示，请问最便宜的运输计划是怎样的？;运输问题数学模型;Transportation ProblemMathematical model;练习;运输问题—计算机解法;FICO Xpress-IVE ;FICO Xpress-IVE ;FICO Xpress-IVE ;FICO Xpress-IVE ;FICO Xpress-IVE ;Mosel Xpress-IVE ;;;Writing a model in Mosel Output results;How to write a model in Mosel Xpress-IVE;How to write a model (1) Name of the model;How to write a model (2) Declarations (variables, arrays, etc.);How to write a model (3) Data input – optional section;How to write a model (4) Objective function;How to write a model (5) Constraints;How to write a model (6) Output results;What should be answered in this lesson?;Distribution System;Distribution System Structure;What does the system structure design contribute? ;What does the system structure design contribute? ;What does the system structure design contribute?;What does the system structure design contribute?;What does the system structure design contribute?;What does the system structure design contribute?;What does the system structure design contribute?;What does the system structure design contribute?;33;Relevant Costs of Distribution;35;Let us demonstrate the procedure on the toy example ;Cost of Customer’s Demand Satisfaction;Let us demonstrate the cost calculation on the toy example ;39;40;41;42;43;44;45;46;47;48;49;50;51;Customer j=2;53;54;练习：;declarations m, n: integer end-declarations initializations from “ToyData.txt” m n end-initializations ;declarations I = 1..m J = 1..n y : array (I) of mpvar z : array (I,J) of mpvar f : array (I) of integer c : array (I,J) of integer end-declarations;initializations from “ToyData.txt” f c end-initializations Structure of the input file “ToyData.txt”: m:[3] n:[4] f:[0,6,6] c:[8, 8,10,10, 5, 5, 7, 7, 8, 8, 6, 6];