Distribution I (will19)

Problem : A company has two factories with a limited capacity and four depots with
a maximum throughtput capacity. It sells its products to six customers with minimum
requirements. The customers have some preferences to be supplied from a depot or a
factory. What would the distribution pattern from factories to depots and customer be,
if the overall cost are to be minimized? Is it possible to meet the customers preferences?
Model : The problem is from [2]. For a problem description see Chapter 13.19.

The complete model code in LPL for this model is as follows (see [1]):

Listing 1: The Model

 
model Will19 "Distribution I";
set f := [Liverpool,Brighton];
d := [Newcastle, Birmingham, London, Exeter];
c := [c1, c2, c3, c4, c5, c6];
parameter
FactoryCap{f}:= /Liverpool 150000, Brighton 200000/;
DepotCap{d}:= /Newcastle 70000, Birmingham 50000, London 100000,
Exeter 40000/;
CustomerReq{c} := /c1 50000, c2 10000, c3 40000,
c4 35000, c5 60000, c6 20000/;
FactoryDepotCost{f,d} :=
/Liverpool Newcastle 0.5,
Liverpool Birmingham 0.5,
Liverpool London 1.0,
Liverpool Exeter 0.2,
Brighton Birmingham 0.3,
Brighton London 0.5,
Brighton Exeter 0.2/;
FactoryCustCost{f,c} :=
/Liverpool c1 1.0,
Liverpool c3 1.5,
Liverpool c4 2.0,
Liverpool c6 1.0,
Brighton c1 2.0/;
DepotCustCost{d,c} :=
/Newcastle c2 1.5,
Newcastle c3 0.5,
Newcastle c4 1.5,
Newcastle c6 1.0,
Birmingham c1 1.0,
Birmingham c2 0.5,
Birmingham c3 0.5,
Birmingham c4 1.0,
Birmingham c5 0.5,
London c2 1.5,
London c3 2.0,
London c5 0.5,
London c6 1.5,
Exeter c3 0.2,
Exeter c4 1.5,
Exeter c5 0.5,
Exeter c6 1.5/;
--client preferences to be delivered from
PrefFtoC{f,c} := [0,1,1,1,1,1,

1
 1,1,1,1,1,1];
--preferred depot of a customer
PrefDtoC{d,c} := [1,0,1,1,1,1,
1,1,1,1,0,1,
1,1,1,1,1,0,
1,1,1,1,1,0];
variable
FactoryDepotQty,FD{f,d|FactoryDepotCost};
FactoryCustQty,FC{f,c|FactoryCustCost};
DepotCustQty,DC{d,c|DepotCustCost};
constraint
FactoryCapa{f}: sum{d} FD + sum{c} FC <= FactoryCap;
DepotCapa{d}: sum{f} FD <= DepotCap;
DepotBalance{d}: sum{c} DC = sum{f} FD;
CustRequirement{c}: sum{f} FC + sum{d} DC = CustomerReq;
minimize cost: sum{f,d} FactoryDepotCost*FD
+ sum{f,c}FactoryCustCost*FC + sum{d,c}DepotCustCost*DC;
Writep(cost,FD,FC,DC);
minimize Pref: sum{f,c}PrefFtoC*FC + sum{d,c}PrefDtoC*DC;
Writep(cost,FD,FC,DC);
end
 

Solution : Transportation optimum is: 198500.

References
[1] T. Hrlimann. Reference Manual for the LPL Modelling Language, most recent ver-
sion. www.virtual-optima.com.

[2] H.P. Williams. Model Building in Mathematical Programming. John Wiley, Fifth
Edition, 2013.