Research Article

A Double-Layer Combination Algorithm for Real-Time Information-Sharing Network Design Problem

Table 2

The double-layer Bacterial Foraging algorithm.

Algorithm 1 The double-layer bacterial foraging algorithm.

Step1. Initialization: the population is initialized in a discrete binary manner and the variable for supply node is generated randomly. Set the number of operations for chemotaxis, copying, and migrating, respectively, as , , and ; the initial value of , , and is zero;
Step2. The outer circulation cycle: ;
Step3. The outer copy cycle: ;
Step4. The trend cycle for outer layer of particles: ;
Step4.1. The amount for transportation from the production node to the regional supply node and for the regional supply node to the consumer node are randomly generated based on the existent supply node particles;
Step4.2. Set the number of operations for chemotaxis, copy, and migration, respectively, as , , and ;
Step4.3. The initial value of a, b, and c is zero;
Step4.4. The inner-layer migration cycle: ;
Step4.5. The inner-end replication cycle: ;
Step4.6. The appropriate value of the objective function is calculated for each particle, and the individual extremum and population extremum are obtained;
Step4.7. The inner-layer particle group tends to the cycle process and then uses the bacterial extremum and population extremum to calculate the appropriate value for the objective function in the new location and updates the bacteria’s location according to equation (10);
Step4.8. If , turn to step 4.7;
Step4.9. The copy operation;
Step4.10. If , turn to step 4.5;
Step4.11. The migration operation;
Step4.12. If , turn to step 4.4; otherwise, the inner-layer algorithm ends, and the corresponding selection target function of supply node will be calculated and then it returns to the outer-layer algorithm;
Step5. If , turn to step 4;
Step6. The process of copying;
Step7. If , turn to step 3;
Step8. Perform the migration operation;
Step9. If , turn to step 2. Otherwise, the algorithm ends, and then output the optimal location plan of supply node, the corresponding volume of production node to the regional supply node, the volume to the supply node, and the inventory plan.