Journal of Applied Mathematics / 2014 / Article / Tab 1

Research Article

Flow Merging and Hub Route Optimization in Collaborative Transportation

Table 1

Problem parameters of AP data package and computational result of Branch & Cut algorithm.

Problem parameters Branch & Cut algorithm
Problem Number of transportation tasksOptimal solution Time (s)

AP10-6 0.610 902515242.55
AP15-60.61521033765562.59
AP20-60.6203801214739255.85
AP25-60.625600
AP30-60.630870
AP10-7 0.7 10 90 2813482.43
AP15-70.715 210 379664 24.82
AP20-70.7 203801384638 86.78
AP25-7 0.725600
AP30-7 0.730870
AP10-8 0.8 10903111341.05
AP15-8 0.8152104215375.27
AP20-80.820380155325121.62
AP25-8 0.8 25600
AP30-80.8 30 870

Article of the Year Award: Outstanding research contributions of 2020, as selected by our Chief Editors. Read the winning articles.