Table 1.
Comparison of relevant solution methods and objective functions for CMCVRP-RS.
Fig 1.
Illustration of the CMLDN-RS problem.
Table 2.
Comparison before and after the CMCLDN-RS optimization.
Table 3.
Symbols and description.
Fig 2.
AGPSO flowchart.
Table 4.
AGPSO algorithm procedure.
Fig 3.
Illustration of the archive truncation operation.
Table 5.
Procedure of the mutation operator.
Table 6.
Description of instances.
Table 7.
Comparison of the results of algorithm optimization.
Table 8.
Characteristics of logistics facilities.
Table 9.
Initial assignment of customers served by each DC.
Table 10.
Assignment of customers served via internal vehicle sharing within each DC in the grand alliance.
Table 11.
Routes of customers served among DCs.
Fig 4.
Result comparison before and after CMCLDN-RS optimization in three periods.
Table 12.
Result comparison before and after CMCLDN-RS optimization in three periods.
Fig 5.
Comparison of initial and optimized costs and number of vehicles.
Table 13.
Comparison between initial and optimized networks within one working period.
Table 14.
Profit distribution of DCs for global sharing.
Table 15.
Feasible alliance based on global sharing in CMCLDN-RS.
Table 16.
Optimal collaboration sequences based on the SMP principle.
Fig 6.
Profit allocation by using MCRS, Shapley, nucleolus, and CGA.
Table 17.
Comparison of cases A, B, and C.
Fig 7.
Illustration of cost and number of vehicles in cases A, B, and C.
Table 18.
Profits for each DC in cases A, B, and C.
Fig 8.
Comparison of profits for each DC in cases A, B, and C.