Routes Choice in the International Intermodal Networks under the Soft Time Window

Table 5

Comparison of algorithm results.

	Optimal path	Transportation cost (unit: yuan)	Transportation time (unit: hours)
Dijkstra heuristic algorithm	1 → highway →2 → highway → 5 → highway → 7 → waterway → 8 → waterway → 10 → highway → 11	1622	38
Greedy algorithm	1 → highway → 2 → railway→ 4 → railway → 5 → railway → 6 → railway → 9 → highway → 10 → highway → 11	1896	38.5
Genetic algorithm	1 → highway → 2 → railway → 5 → railway → 6 → railway → 8 → railway → 10 → highway → 11	1372	37