Illustration of Model Calculations

3 Hybrid Intelligent Algorithm Design 5.3.1 Illustration of Model Calculations 

As the number of node enterprises which constitute the supply chain can be infinitely expanded, to solve the stochastic chance-constrained programming model, a computational layer is to be divided from the stmcture of supply chain in planning period T. Then the layered computation is adopted on demand. Firstly the overall strncmre of the supply chain should be determined in planning period T before computation. Secondly, the upstream and the downstream enterprises of the supply 

The optimal solution is obtained in the possible range of random variables paj and Vfiij by using stochastic simulation approach. maxF can be achieved when the equal-sign of Eq. (5.22) is tenable, i.e. 

5 Optimization of Decentralized Control Supply Chain Logistics. .. 

Step 1 According to the probability distribution function of random variables p j and Vmj, samples coi and (02i are generated from their own sample spaces fli and Q2 respectively, i= 1,2. N  

---