In the above modal, the formula (1) is objective function; formula (2)-(11) are the constraint conditions. The
objective function takes the least transportation costs and the conversion costs throughout the transport process as
a target. Formula (2) refers to the transport time the commodity car shipped from the starting point to the
destination by various modes of transportation. Equation (3)-(4) for the transportation time limit, i.e. the arrival
time of first arrive batch must be greater than the time window lower bound, while the slowest arrival time must
be less than the time window upper bound. Equation (5) for the capacity constraints, i.e., the number of
commodity car in transit between two nodes must not be greater than the transport capacity between the two
nodes. (6)- (7) mean that all commodity cars between two nodes can shipped with a variety of transportation
mjodes, and the ratio of various modes of transport accounted for 1. Formula (8) said that the mode shift from to k in node i . (9) said that there is at least one mode of transportation to transport all goods cars between two
nodes.
LINGO verified the model as an Integer Nonlinear Programming model (INLP), and can find out a global
optimal solution, thus the accuracy of the model is proved.