_{1}

Based on “One Belt and One Road”, this paper studies the path selection of multimodal transport by using the method of multi-objective mixed integer programming. Therefore, this paper studies the factors of transportation time, transportation cost and transportation safety performance, and establishes a mathematical model. In addition, the method of multi-objective mixed integer programming is used to comprehensively consider the different emphasis and differences of customers on cargo transportation. Then we use planning tools of Microsoft Excel to solve path selection and to determine whether the chosen path is economical and reliable. Finally, a relatively complex road network is built as an example to verify the accuracy of this planning method.

Even since the initiative of “One Belt and One Road” was put forward in 2013, the international trade between China and other countries in the world has been increasing day by day. Because One Belt and One Road involves economic exchanges between 65 countries and regions along the route, it is particularly significant for goods trading between countries. A single traditional mode of transport cannot achieve its goals and requirements, so multimodal transport in the field of transport plays an extremely important role.

Since multimodal transport involves multiple modes of transport and multiple routes, it has become a trend to transport goods to their destinations quickly, efficiently and safely, thus the selection of multimodal transport routes has become the focus and difficulty in this field. Hence the route selection of multi-objective multi-modal transport becomes the core problem of transportation research.

With the rapid development of economy, many scholars at home and abroad have studied the optimization of multi-objective multimodal transport path.

Based on some domestic and overseas research results, Seo J and Chen F [

Through the above literature analysis, it is found that most studies on multimodal transport route selection aimed at transportation time and cost to establish a model and obtain the optimal solution. Few literatures considered the safety performance of route selection during transportation. Hence this paper aims to build a mathematical model based on the three factors of transportation time, transportation cost and transportation safety, and uses the method of mixed integer programming to choose the optimal path.

The multi-objective factors selected in this paper include: transportation time, transportation cost, and transportation safety, among which:

1) Transport time includes:

From city node I to j, the time of transportation mode k;

In city node I, the time of converting transportation mode k to h;

Cargo stay time at city node I.

2) Transportation cost includes:

From city node I to j, the cost of using k transportation mode;

In city node I, the cost of changing the mode of transportation k to h (if there is a change of loading, that is, multiplying by coefficient 1; otherwise, it is 0);

The actual arrival time exceeds the expected time of arrival cost.

3) The safety of transportation includes:

There are many safety coefficients affecting the transport of goods, including goods themselves, people, transport mode, road conditions, environment and management factors [

Among them, the theory of fuzzy logic algorithm uses fuzzy logic variables and fuzzy logic functions to solve the problem of fuzziness, and points out the direction for the research target from the logic idea.

In this paper, we intend to regard container transport as the research object, among which the modes of multimodal transport of container include highway, railway and waterway transport. Based on the comparison of the technical and economic characteristics of various transportation modes studied by Zhao wenjuan [

According to the city node on the transportation network, we choose the route of goods from the starting point to the destination, and select the corresponding city node, so as to minimize the time and cost of goods transportation, which constitutes the transportation path of goods. Suppose a batch of goods is transported from the starting point A to the destination C, along the way, it can pass through N urban nodes called B, each node has M city route selection mode of transportation. Furthermore, the goods can only transfer and transform the mode of transportation in the urban nodes, then the transport path of goods is

The mode of transportation | Safety coefficient |
---|---|

railway | 0.4 |

waterway | 0.39 |

highway | 0.21 |

Note: the size of safety performance shows that the safety performance of the goods is greater when the transport transit is the smallest.

constructed in this way. Among them, there are four modes of transportation between urban nodes, namely highway, railway, airway and waterway. And there is an expected value for the time that takes to transport the goods. When the expected value is exceeded, a certain cost (called time loss cost) is charged. Therefore, this paper takes the time, cost and safety of transportation as the main factors to select the optimal city node in the combined transport network to form an optimal path. This is shown in

1) Fixed rules

a) In the process of transportation, goods can only choose one mode of transportation between two adjacent nodes.

b) In the process of transportation, if the goods need to be transferred, this process can only happen at the city node, and only once.

c) Considering the transportation of containers, any node city can only provide three modes of transportation, namely, railway, highway and waterway.

d) In transportation, the object is a whole and cannot be divided into multiple parts.

2) Establish mathematical model

Select the corresponding city node as the decision variable x i , j k (The transport mode between nodes is 1 at the same time; otherwise, it is 0); Variable y i k , h is 1 if the means of transport changes at the node, otherwise 0.

a) Transit time

i) The goods are transported from i to j, and the time of using means of transportation k is T 1 :

T 1 = ∑ i , j ∈ N ∑ k ∈ Y t i , j k x i , j k (1)

ii) When the goods are at city node i, the time of switching means from transport k to transport h is T 2 :

T 2 = ∑ i ∈ N ∑ k , h ∈ Y Q t i k , h y i k , h (2)

iii) The residence time of a single cargo at city node is T 3 :

T 3 = t i p (3)

Therefore, the total time in the transportation process should be the minimum, that is:

T total = min ( T 1 + T 2 + T 3 ) = min { ∑ i , j ∈ N ∑ k ∈ Y t i , j k x i , j k + ∑ i ∈ N ∑ k , h ∈ Y Q t i k , h y i k , h + t i p } (4)

where:

i, j—represents the urban node set N = { 1 , 2 , 3 , ⋯ } ;

k, h—represents a collection of different modes of transport Y = { 1 , 2 , 3 , ⋯ } ;

t i , j k —represents the transportation time from the city node i to the city node j using the transportation mode k;

Q—represents the quantity of goods;

t i k , h —represents the time taken to convert transportation mode k to h at city node i;

t i p —duration of cargo stay at city node i.

b) Cost of transportation

i) The cost of transporting single goods from city node i to city j using k mode is C 1 :

C 1 = ∑ i , j ∈ N ∑ k ∈ Y Q c i , j k l i , j k x i , j k (5)

ii) The cost of changing the mode of transportation k to h is C 2 :

C 2 = ∑ i ∈ N ∑ k , h ∈ Y Q c i k , h y i k , h (6)

iii) The expected time of arrival and the cost of actual time of arrival are C 3 :

Suppose the expected arrival time interval is [u, v], actual arrival time is T.

C 3 = { α ( u − T ) Q T < u 0 T ∈ [ u , v ] β ( T − v ) Q T > v (7)

Therefore, the total cost of completing a transport should be the minimum:

C total = min ( C 1 + C 2 + C 3 ) = min ( ∑ i , j ∈ N ∑ k ∈ Y Q c i , j k l i , j k x i , j k + ∑ i ∈ N ∑ k , h ∈ Y Q c i k , h y i k , h + C 3 ) (8)

where:

c i , j k —represents the cost of transportation mode k for single goods from city node i to city node j;

l i , j k —represents the transportation distance from city node i to city node j;

c i k , h —represents the cost of switching from transportation mode k to transportation mode h at city node i;

α —represents the cost per unit of wait;

β —represents the cost of punishment over expected time.

c) Safety of transportation

S = max { ∑ i , j ∈ N δ i , j k x i , j k − ∂ i k , h y i k , h } (9)

where:

δ i , j k —represents the safety coefficient of traffic mode k from city node i to city node j.

∂ i k , h —represents the reduction coefficient of turning traffic mode k into h at city node i, which is usually 0.50.

In conclusion, the constraint conditions of this problem are:

∑ k ∈ Y x i , j k = 1 , ∀ i , j ∈ N (10)

∑ k , h ∈ Y y i k , h = 1 , ∀ i ∈ N (11)

x i , j k , y i k , h ∈ { 0 , 1 } (12)

A relatively simple method can be used to solve multi-objective programming, namely Excel, which evolved through linear programming. The programming and solving tool of Mircrosoft Excel came from the nonlinear optimization code jointly developed by Leon and Allan from the university of Texas and Cleveland state university. By loading the program solver, the optimal solution can be achieved.

Because the multi-objective problem needs to be solved in this paper, the multi-objective model can be expressed in the form of matrix through the knowledge of operations research. The multi-objective model is described below:

min Z = P ( d i + , d i − )

s.t. A x − d i + + d i − = b

x ≥ 0 , d i + ≥ 0 , d i − ≥ 0

where, d i + , d i − represent the positive and negative deviation values respectively, and P represents the priority of targets at all levels.

Using excel to solve multi-objective integer programming, the weight of each target should be determined first, and then the optimal solution of each target can be obtained according to the weight. The specific steps are shown in

Since transportation time, transportation cost and transportation safety are mutually exclusive, in order to verify the reliability of the model and get closer to the authenticity, it is assumed that the following figure shows the virtual complex road network of transportation. Then choose the route based on the different requirements of different users. The data of unit cost, transportation speed, transfer fee and time of the following transportation modes are obtained through the railway transportation website of ministry of railways, China highway network and shipping website.

Combined with different transportation objectives of different goods, there are seven forms as follows:

1) Minimum transport time;

2) Minimum transportation cost;

3) High safety coefficient;

4) Minimum transportation time and cost;

5) Minimum transportation cost and high safety coefficient;

6) Shortest transportation time and high safety coefficient;

7) Low transportation cost, short transportation time and high safety coefficient.

Solution steps:

1) Set the parameters:

Suppose the transportation quantity Q = 6 Teu, where the weight of the container is 20 t/Teu. The corresponding penalty coefficient is: α = 60, β = 90; (Among them, Numbers 1 - 11 are domestic city nodes and Numbers 11 - 15 are foreign city nodes). Due to different transportation modes of each node, the distance is also different. In order to simplify operation, the transportation distance of each transportation mode between nodes is generated by random Numbers (

The mode of transportation between cities is shown in

Lines | The mode of transportation | Lines | The mode of transportation | Lines | The mode of transportation |
---|---|---|---|---|---|

1 - 2 | H/R/W | 5 - 9 | R | 10 - 14 | W |

1 - 3 | H/R | 5 - 10 | H/R/W | 11 - 12 | R |

1 - 4 | H/R | 6 - 8 | H/R/W | 11 - 13 | R |

1 - 5 | H/R/W | 6 - 11 | H/R | 12 - 15 | H/R |

1 - 7 | H/R | 7 - 9 | H/R | 13 - 15 | H/R |

2 - 6 | H/R/W | 7 - 11 | H/R | 14 - 13 | W |

3 - 7 | H/R | 8 - 9 | H/R | 14 - 15 | H/R |

4 - 7 | R | 9 - 11 | H/R | ||

4 - 10 | W | 10 - 13 | W |

Note: H stands for road transport; R for rail transport; W for water transport.

2) Input data:

(data source: railway transport website, China highway network, shipping website, international container transport charging rules)

a) The cost of transportation: (

b) Transportation speed: (

c) Transfer charge: (

d) Transit time: (

e) Safety factor: (

3) Get the result:

According to the model algorithm, the route where the user’s requirements for cargo transportation are obtained is:

a) minimum transportation time;

b) Optimal path: 1→7→11→13→15 (

c) minimum transportation cost;

d) Optimal path: 1→5→10→13→15 (

4) Good safety coefficient:

Optimal path: 1→7→11→13→15 (

5) minimum transportation time and cost (

Optimal path: 1→2→6→11→12→15;

6) minimum transportation cost and high safety coefficient (

Optimal path: 1→2→6→11→12→15;

7) The shortest transportation time and high safety coefficient (

Optimal path: 1→7→11→13→15;

8) low transportation cost, short transportation time and high safety coefficient (

Optimal path: 1→2→6→11→12→15.

The mode of transportation | Domestic-Domestic ($/(t∙km)) | Domestic-Foreign ($/(t∙km)) |
---|---|---|

Highway | 0.05 | 0.05 |

Railway | 0.04 | 0.04 |

Waterway | 0.045 | 0.022 |

The mode of transportation | Average transport speed (km/h) |
---|---|

Railway | 35 |

Waterway | 12.5 (Domestic-Domestic)/27.5 (Domestic-Foreign) |

Highway | 47.5 |

The mode of transportation | Highway | Railway | Waterway |
---|---|---|---|

Highway | 0 | 2.5 | 2.6 |

Railway | 2.5 | 0 | 3.5 |

Waterway | 2.6 | 3.5 | 0 |

The mode of transportation | Highway | Railway | Waterway |
---|---|---|---|

Highway | 0 | 0.2 | 0.34 |

Railway | 0.2 | 0 | 0.45 |

Waterway | 0.34 | 0.45 | 0 |

The mode of transportation | Safety coefficient |
---|---|

Railway | 0.40 |

Waterway | 0.39 |

Highway | 0.21 |

The mode of transportation | 1 - 7 (Highway), 7 - 11 (Railway), 11 - 13 (Railway) 13 - 15 (Highway) |
---|---|

Transportation costs ($) | 42782.415 |

Transportation time (h) | 357.71 |

Safety performance | 0.54 |

The mode of transportation | 1 - 5 (Waterway), 5 - 10 (Waterway), 10 - 13 (Waterway), 13 - 15 (Railway) |
---|---|

Transportation costs ($) | 22735.725 |

Transportation time (h) | 1232.985 |

Safety performance | 1.07 |

The mode of transportation | 1 - 7 (Railway), 7 - 11 (Railway), 11 - 13 (Railway) 13 - 15 (Railway) |
---|---|

Transportation costs ($) | 39254.4 |

Transportation time (h) | 599.31 |

Safety performance | 1.6 |

The mode of transportation | 1 - 2 (Railway) 2 - 6 (Railway) 6 - 11 (Railway) 11 - 12 (Railway) 12 - 15 (Highway) |
---|---|

Transportation costs ($) | 36204.795 |

Transportation time (h) | 688.905 |

Safety performance | 1.31 |

The mode of transportation | 1 - 2 (Waterway) 2 - 6 (Waterway) 6 - 11 (Railway) 11 - 12 (Railway) 12 - 15 (Railway) |
---|---|

Transportation costs ($) | 34796.265 |

Transportation time (h) | 815.52 |

Safety performance | 1.48 |

The mode of transportation | 1 - 7 (Railway) , 7 - 11 (Railway) , 11 - 13 (Railway) 13 - 15 (Railway) |
---|---|

Transportation costs ($) | 39254.4 |

Transportation time (h) | 599.31 |

Safety performance | 1.6 |

The mode of transportation | 1 - 2 (Waterway) 2 - 6 (Waterway ) 6 - 11 (Railway) 11 - 12 (Railway) 12 - 15 (Railway) |
---|---|

Transportation costs ($) | 34796.265 |

Transportation time (h) | 815.52 |

Safety performance | 1.48 |

This paper comprehensively considers the three aspects of transport time, cost and safety performance of multimodal transport to select the optimal route for cargo transport. Using the programming and solving tool of Microsoft Excel, the priority of all levels of targets was determined. Through the method of multi-objective mixed integer programming, we finally get the best route of each target priority. Include:

1) When the transportation time is the least, the route and mode of transportation are 1 - 7 (highway) 7 - 11 (railway) 11 - 13 (railway) 13 - 15 (highway). The transportation cost is $42782.415, the transportation time is 357.71 hours, and the safety is 0.54.

2) When the transportation cost is the lowest, the route and mode of transportation are 1 - 5 (waterway) 5 - 10 (waterway) 10 - 13 (waterway) 13 - 15 (railway). The transportation cost is $22735.725, the transportation time is 1232.985 hours, and the safety is 1.07.

3) When the safety factor is high, the route and mode of transportation are 1 - 7 (railway) 7 - 11 (railway) 11 - 13 (railway) 13 - 15 (railway). The transportation cost is $39254.4, the transportation time is 599.31 hours, and the safety is 1.6.

4) When the transportation time and cost are the least, the route and mode of transportation are 1 - 2 (railway) 2 - 6 (railway) 6 - 11 (railway) 11 - 12 (railway) 12 - 15 (highway). The transportation cost is $36204.975, the transportation time is 688.905 hours, and the safety is 1.31.

5) When the transportation cost is the lowest and the safety factor is high, the route and mode of transportation are 1 - 2 (waterway) 2 - 6 (waterway) 6 - 11 (railway) 11 - 12 (railway) 12 - 15 (railway). The transportation cost is $3476.265, the transportation time is 815.52 hours, and the safety is 1.48.

6) When the transportation time is the shortest and the safety factor is high, the route and mode of transportation are: 1 - 7 (railway) 7 - 11 (railway) 11 - 13 (railway) 13 - 15 (railway). The transportation cost is $39254.4, the transportation time is 599.31 hours, and the safety is 1.6.

7) When the transportation cost is low, the transportation time is short and the safety factor is high, the route and mode of transportation are 1 - 2 (railway) 2 - 6 (railway) 6 - 11 (railway) 11 - 12 (railway) 12 - 15 (highway). The transportation cost is $3476.265, the transportation time is 815.52 hours, and the safety is 1.48.

The method discussed in this paper scientifically and accurately solves the demand of path selection of goods transportation by users.

Since there are many factors affecting the safety of cargo transportation described in this paper, it is difficult to comprehensively consider the overall situation. Therefore, for future studies, some safety coefficients can be further subdivided, the algorithm model for safety description can be optimized and improved, and a better selection scheme can be proposed based on the types of cargo.

The author declares no conflicts of interest regarding the publication of this paper.

Luo, Z.X. (2019) Path Selection of Multimodal Transport Based on Multi-Objective Mixed Integer Programming. Journal of Transportation Technologies, 9, 462-473. https://doi.org/10.4236/jtts.2019.94029