here is log. let me see how to share data. 174 /* OPTMIZATION CODE*/ 175 proc optmodel; 176 177 set <str> Ports; 178 set <str> DC; 179 set <str> LSP; 180 set <str> Transit; 181 182 read data STDOPT.PN3158_Ports into Ports=[PortSource]; NOTE: There were 41 observations read from the data set STDOPT.PN3158_PORTS. 183 read data STDOPT.PN3158_DC into DC=[RateMatchDest]; NOTE: There were 18 observations read from the data set STDOPT.PN3158_DC. 184 read data STDOPT.PN3158_LSP into LSP=[LSP]; NOTE: There were 9 observations read from the data set STDOPT.PN3158_LSP. 185 read data STDOPT.PN3158_TRANSIT into Transit=[Transit]; NOTE: There were 28 observations read from the data set STDOPT.PN3158_TRANSIT. 186 187 num Containers {Ports,DC}; 188 read data STDOPT.PN3158_data into [PortSource RateMatchDest] Containers=FEU; NOTE: There were 738 observations read from the data set STDOPT.PN3158_DATA. 189 print containers; 190 191 /*END OF GETTING FEU DATA*/ 192 193 var Is_LSP {LSP} binary; 194 var IsLSPDC {LSP,DC} binary; 195 var IsPortsLSPDC {Ports,LSP,DC} binary; 196 197 /*Close/Open Entities */ 198 fix Is_LSP ['EGLV']=0; 198 ! fix Is_LSP ['CMDU']=0; 198 ! fix Is_LSP ['APLU']=1; 199 fix Is_LSP ['COSU']=1; 199 ! fix Is_LSP ['ONEY']=1; 199 ! fix Is_LSP ['MAEU']=1; 200 fix Is_LSP ['ZIMU']=1; 200 ! fix Is_LSP ['WHLC']=1; 200 ! fix Is_LSP ['HLCU']=1; 201 202 /* declare Constants*/ 203 num Min_Qty_LSP=0; 204 /*NUM BigM=STDOPT.PN3158_BigM.FEU;*/ 205 206 /*RATES*/ 207 num InboundLinehaul {Ports,Transit,LSP,DC}; 208 read data STDOPT.PN3158_RATES into [PortSource Transit LSP RateMatchDest] InboundLinehaul=Rate; NOTE: There were 185976 observations read from the data set STDOPT.PN3158_RATES. 209 210 211 /* DECISON VARIABLE */ 212 var ContainersfromPortstoLSPtoDC {Ports,Transit,LSP,DC}>=0; 213 214 /* IMPLIED VARIABLE */ 215 impvar Inbound_Linehaul_Costs= sum {p in Ports, t in Transit,c in LSP, d in DC} InboundLinehaul [p,t,c,d] 215 ! *ContainersfromPortstoLSPtoDC [p,t,c,d]; 216 impvar ContainersatLSP{c in LSP}=sum{p in Ports,t in Transit,d in DC} ContainersfromPortstoLSPtoDC [p,t,c,d]; 217 impvar ContainersatTransitLSP{t in Transit, c in LSP}=sum{p in Ports,d in DC} ContainersfromPortstoLSPtoDC [p,t,c,d]; 218 219 /* declare Objective Function*/ 220 Min TotalCost = Inbound_Linehaul_Costs; 221 222 /* GENERAL CONSTRAINTS */ 223 con Min_Qty_at_LSP_is_Respected {c in LSP} : 224 sum{p in Ports,t in Transit,d in DC} ContainersfromPortstoLSPtoDC [p,t,c,d]>=Min_Qty_LSP*Is_LSP[c]; 225 226 con ModelOutput_Same_As_ModelInput {p in Ports, d in DC}: 227 sum {t in Transit,c in LSP} ContainersfromPortstoLSPtoDC[p,t,c, d] = Containers [p,d]; 228 229 con CheckLSP {c in LSP}: ContainersatLSP[c] <= 40000*Is_LSP[c]; 230 231 232 expand; NOTE: Problem generation will use 4 threads. NOTE: The problem has 192789 variables (0 free, 9 fixed). NOTE: The problem uses 10 implicit variables. NOTE: The problem has 6813 binary and 0 integer variables. NOTE: The problem has 756 linear constraints (9 LE, 738 EQ, 9 GE, 0 range). NOTE: The problem has 557937 linear constraint coefficients. NOTE: The problem has 0 nonlinear constraints (0 LE, 0 EQ, 0 GE, 0 range).
... View more