A Time-Dependent Fuzzy Programming Approach for the Green Multimodal Routing Problem with Rail Service Capacity Uncertainty and Road Traffic Congestion

Table 6

Best routes in the empirical case.

Number	Best multimodal routes	Arrival time
1	Lanzhou {28} — (14) — Xinzhu — (4) — Jiaozhou	130.4
2	Lanzhou {37} — (14) — Xinzhu — (4) — Jiaozhou	130.4
3	Lanzhou {111} — (14) — Xinzhu — (5) — Huangdaogang	214.6
4	Lanzhou {15} — (17) — Putian — (10) — Lianyungang	79
5	Lanzhou {90} — (17) — Putian — (10)— Lianyungang	175
6	Hohhot — (7) — Xingang {96} — (23) — Jiaozhou	106.9
7	Hohhot — (7) — Xingang {101.5} — (23) — Jiaozhou	106.9
8	Hohhot — (7) — Xingang {148} — (23) — Jiaozhou	72
9	Hohhot — (7) — Xingang {192} — (23) — Jiaozhou	72
10	Hohhot {72} — (19) — Baotou — (6) — Xingang {171.5} — (25) — Lianyungang	186

Early delivery; delayed delivery; numbers in {}: planned departure time.