Study on Cargo Products’ Layout Optimization of Truck Railway Line

Cargo products’ layout is one of the problems that needs an important decision in freight railroads.*e purpose of optimization of the cargo products’ layout on railway lines is to make a rational cargo products’ plan to satisfy customers’ diversified transport demands. In this paper, a service network is designed using the method of node splitting.*en, an optimized model is built for the products’ layout problem on busy main railway lines. *e immune clone-variable neighborhood algorithm is used to solve the model. Finally, a numerical example is given to verify the model and algorithm.*e result shows that the model and algorithm are of good practical applicability.


Introduction
Busy main railway lines (BMRL) in China connect the important cities with the main economic development regions.
ere are great demands for both passenger and freight transportations in China. However, the contradiction between supply and demand of some busy main railway lines has been an imbalance for a long time. Some BMRL in China will release their capacity gradually with the large-scale construction of high-speed railways. e tense situation of transport capacity on BMRL will be relieved, which is beneficial for constructing a rational transportation products' plan to meet diversified transport demand. erefore, it has both theoretical and practical significance to study on cargo products' layout optimization on BMRL.
Cargo products' layout is one of the problems that needs an important decision in freight railroads. Optimization of cargo products' layout on railway lines is to make a rational cargo products' plan to satisfy customers' diversified transport demands, which should consider the railway resources (stations, lines, and vehicles) and maximization of the profits for carriers. In short, the essence of optimization of cargo products' layout is to acquire optimal utilization of railway resources under the premise that the transport demand has been satisfied. Recently, lots of researchers study on this field or similar fields. Cargo products' layout is similar to the service network design. e interested reader of the network design problem should consult the surveys by Magnanti and Wong [1], Farvolden et al. [2][3][4][5], and Barnhart et al. [2,6,7]. Meantime, lots of researchers applied service network design to railway. Lulli et al. [8] presented a case study on freight railway transportation in Italy and highlighted the main features of the Italian situation and proposed a customized mathematical model to design the service network; Zhu et al. [9] combined blocking, makeup, and empty car distribution in an integrated dynamic model, and they built a 2-layer service network: one for block flows and the other for car flows. Crainic [10] provided the first example of a tactical planning model which was applied to rail freight transportation. Holmberg and Hellstrand [11] proposed a Lagrangean heuristic within a branch-andbound (B&B) framework to solve the uncapacitated network design problem with single origin and destination for each commodity, which can be used to model the rail freight transportation. Jeong et al. [12] focused on (part of) the European freight railway system modeled as a hub-and-spoke network. e scope of their model, an integer linear program, is to find the transport routes, the frequency of services, the number of cars composing each train, and the transportation volumes. Recently, Andersen and Christiansen [13] and Pedersen et al. [14] developed a strategically model to design the transportation services; their model included fleet-sizing considerations. Pedersen's constraints require the same number of assets entering and exiting each terminal, which are called design-balanced constraints. Yaghini and Akhavan [15] presented a review of MCND problem modeling, their applications in rail freight transportation planning, and solution methods which have been developed to solve them. In the field of cargo products, there are also lots of research achievements. Akhavan [16] used graph theory to construct a railway express transportation network and constructed a mathematical model by applying network flow theory; Qiang [17] proposed an integrated method of product design and train operation plan based on carrying capacity and designed the transport product with the view of passenger flow analysis; Li and Jiang [18] analyzed the connotations, principles, and procedures of the agile development of railway freight products, constructed a railway freight operation flow with the consideration of its characteristics, and proposed a development model based on QFD. Liu et al. [19] studied the optimized transportation products' layout from both tactical and strategic aspects and presented the optimization flow chart, respectively. Milan et al. [20] proposed measures and visions of railway passenger transport development, methodical process, and strategic questions for sustainable railway passenger transport and infrastructure. Merve and Yilmaz [21] introduced a new problem called the time-dependent hierarchical Chinese postman problem that aims to minimize the total travel time and formulated as a mixed integer linear programme. Oleksii et al. [22] developed a decision-making model in the first approximation in the part of the operation and development of the railway transport system. Zhang et al. [23] introduced the HL-RF algorithm in the field of structural engineering and built travel time reliability of the railway container chain evaluation model. Mustafa et al. [24] proposed the Chinese postman problem (CPP) to solve the inspection machine routing problem. Aldona et al. [25] evaluated the complexity of the railway transport activity and linkages with other activities by properly selecting the type of management and its specific theories of management application. Muhammed et al. [26,27] proposed a new mathematical formulation to represent the postman problem with variable service costs and proposed two heuristics for the solution of the windy postman problem with variable service cost problem.
To summarize, most papers focused on the design of network, and its variables denote whether a train service should be open, and they do not consider all kinds of activities during the station, such as makeup, breakup, and drop-and-pull operations in the classification yard. In addition, cargo products' layout problem should obtain the cargo product plan based on the diversified transport demand and transport resources, for it is different from the service network design problem. Meantime, the research on cargo products mainly focused on the train operation plan design without considering cargo demand characteristics and capacity of marshalingbreaking-up of the classification station. In addition, since the transport demands affect the result of the cargo products' layout, demand with different features will need different services. However, the demand feature is ignored in the current research studies. So, this paper solves the cargo products' layout problem considering the transport demand feature and transport resources and uses the way of node splitting to describe the service operation procedures clearly on the classification station. Meantime, the optimized products' layout model on BMRL is built, and the immune clone-variable neighborhood algorithm is applied to solve the model.
We have organized the paper as follows: Section 2 presents a brief description of construction of the cargo product network. Section 3 introduces a mathematical model for the cargo products' layout problem. Section 4 proposes an algorithm for blocking the problem. In Section 5, we summarize the experimental results of the proposed algorithm to solve the cargo products' layout problem in China Railways. Finally, the conclusion and future research directions are presented in Section 6.

Cargo Product Network Construction
As we know, it will increase difficulty to consider both the optimization of the cargo product service path and its start and end nodes. us, to reduce the problem size, the cargo products' alternative set is constructed based on OD demand characteristics, attributes of cargo products, development trend of regional economic, and some special limited factors. en, the cargo product network is constructed, which is a network expression of operating plan. In the network, nodes are marshaling stations, loading and unloading stations, and freight stations, while an arc in the network denotes a service. Busy main railway lines in China are mostly operated in a double-line way but with different passing capacities on each direction. Hence, the cargo network should construct, respectively, for each direction. As is shown in Figure 1, it is the initial cargo product network of up direction. Figure 1(a) denotes the physical line, while Figure 1(b) represents the cargo products' network. Traditional cargo product in China can be divided into express product and regular product by traveling speed. With the change of freight market, Scheduled Trains Product can better meet the development of freight market for its highquality service. In this paper, Scheduled Trains Product (STP for short) is the product which is organized as passenger trains. at is to say, the Scheduled Trains Product is freight trains with scheduled station, scheduled train number, scheduled route, scheduled time, and scheduled price. So, in this paper, Scheduled Trains Product is considered as one kind of product. To describe the operation process of different products on the classification yard clearly, we used the way of split nodes to analyze different operation processes. As we know, lots of research studies applied the way of split nodes, such as Jacques (1990). However, in Jacques's research, the way of split nodes is used to deal with the transfer between different modes which cannot describe the operation process of different products on the station, so the new rules of split nodes are as follows.
If some cargo products do not need to be reclassified on the classification yard, nodes can be split according to the connected service number. In Figure 2, s1 and s2 are the service indices. e arcs between the split nodes denote transfer operations of service of cargo products.
Some kinds of cargo products need to be reclassified on the classification yard, nodes can be split into breakup and makeup operation nodes, and the passing time of arcs between these two nodes represents the average reclassifying time, as shown in Figure 3.
When reclassifying and transfer are both needed to be operated on some products, stations should be split using the two methods comprehensively, as shown in Figure 4.
In addition, to reduce the network size, freight demand in each region is represented by one virtual node. Otherwise, capacity constraints are also considered when building the model, so it is necessary to construct super-routes which can be built by adding supernodes that connect virtual nodes. Capacity and runtime on the super-route are set with a bigger value to ensure the super-route to be selected only when capacity on other routes is limited so that the demand quantity which is not satisfied in each OD can be obtained; both A′-S and C′-S in Figure 5 represent super-routes. Despite, the network size may be expanded using the way of splitting nodes, but nodes, which are split, are mostly marshaling stations that occupy limited quantity. Hence, the network size can be accepted.
rough splitting nodes, transfer and reclassifying operations can be described clearly.

The Mathematical Formulation
e purpose of optimizing the layout of transportation products on BMRL is to acquire optimal utilization of the transport resources in order to form a rational freight product structure on the premise that diversified transportation demands of railway have been met. In addition, because of the railway's public welfare, it is vital to fully consider the transport demand attributes. erefore, the paper classifies the demand into three layers by its characteristics: Priority Layer, Foundation Layer, and High Added-value Layer. Priority Layer mainly comprises materials related to people's livelihood, military supplies, emergency rescue, and disaster relief supplies. Foundation Layer includes some transportation of bulk materials which mainly serve region economy and do not belong to Priority Layer. In addition, Foundation Layer also includes some agriculture products' transportation demand such as cotton and grain. High Added-value Layer refers to transport demand of goods with high value that require high-quality services, and this layer mainly includes some electronic products, precision instruments, and food.

Assumption
(1) e freight demand is assumed to be steady without much fluctuation, and the transport deadline is determined by the customer's demand, also known as conditions (2) No big changes happen on the stations' layout (3) Constraints of mobile resources such as locomotives are enough to be used (4) Cargo products' alternative set is given as the known condition

Notations
(1) Sets: K: alternative set of cargo products where the product is k. Γ s k : set of service section with service s of cargo product k, and ϑ ∈ Γ s k denotes one of the service sections. P w : alternative route set of w where one of the routes is p. S k : service set of cargo products where s denotes one kind of services.

P2-S2
P1-S1 P3-S1 P3-S1 P1-S1 P3-S1 P2-S2 P3-S1 Scheduled trains product P1 Express product P2 Station Regular product P3 Arriving node Leaving node π w : 0-1 variables that indicate the relation between OD pair w and the super-route. If OD pair w can use the super-route, π w � 1 and 0, otherwise. g w : profit of OD pair w (unit: RMB/car). L w : travel distance of OD pair w. τ s a′ : 0-1 variables, indicating whether the service s is passing section a. φ s k : fixed cost of services of product k. c a : per unit cost of flow on arc a. m k : transport capacity of product k for one service (unit: cars). l w : freight transit period of OD pair w. θ p,n w : 0-1 variables; if node n is included in the route p of OD pair w, then θ p,n w � 1 and 0, otherwise. β p,k w : 0-1 variables; if product k is in the route p of OD pair w, β p,k w � 1 and 0, otherwise.
ξ p,a w : 0-1 variables; if arc a is included in the service route p (p ∈ P w ) of OD pair w, ξ p,a w � 1 and 0, otherwise. c k w : 0-1 variables; if transport demand of OD pair w can be satisfied by cargo product k, c k w � 1 and 0, otherwise. ] s k : indicating the deducting coefficient of services of cargo product k relative to the common product. p w u : super-routes of OD pair w. Ψ k : the maximum number of cargo products k.
(3) Decision variables: x p w : integer decision variables, represents flow on the service route p of OD pair w, and x u w is the flow on the superpath for OD pair w. μ p w : 0-1 variables. If route p is selected for OD pair w, μ p w � 1 and 0, otherwise, and μ u w if superpath is selected, μ u w � 1 and 0, otherwise. f s k : operation frequency of service s of cargo product k. δ s k : 0-1 variables. If service s of product k is operated during the decision-making period, δ s k � 1 and 0, otherwise.

Formulation.
Cargo product layout optimization model on the BMRL is to optimal utilizing transport resources and make cargo products' plan reasonably under the premise Mathematical Problems in Engineering that the transport demand has been satisfied. It is essential to make products plan according to diversified transport demand with its level and attributes. e optimized model may be formulated as follows: (1) Objective function: e model takes maximizing the total transport profit as its objective: (2) Route-selected constraints: Constraint (2) ensures that every OD pair can only be delivered by one route. (3) Total transport demand amount: For each OD pair, constraints (3) are balance equations; in addition, we set π w � 0 to ensure that the demand of Priority Layer must be met and 1, otherwise.
For each technical station, constraint (6) prevents flow on the node be greater than the node capacity. (6) Total amount of cargo products: Constraint (6) is the total quantity constraint of cargo product k and enforces the upper bound Ψ k for cargo product k.
(7) Physical capacity of the section constraint: Constraint (7) ensures that, for each physical section, the number of services for physical section should be less than physical carrying capacity. (8) Freight delivery period constraint: a ζ p,a w t a ≤ l w .
For each OD pair, constraint (9) ensures the travel time on route p must be less than the freight transit period. (9) Matching constraint between cargo products and demand: Constraint (10) represents that the product transported must match the transport demand. (10) Logic constraint of variables:

Solution of the Cargo Product Layout Optimization Model
is section introduces the proposed algorithm for solving the model. Cargo product layout optimization model is a mixed integer programming model, and because the formula of transfer time is a nonlinear expression, it has been shown as a NP-hard problem. It is hard to solve the problem by using traditional exact algorithms. Meantime, the problem also needs to be solved in a very short time. When the scale of the problem becomes larger, it is hard to obtain a feasible solution if using commercial software. Heuristic algorithm can obtain a feasible solution, even an optimal solution in a short time. erefore, heuristic algorithm is used to solve the problem. And many research papers show that the immune clone algorithm is very useful to solve the integer programming problem.
According to analysis of the structure of the decision variable, the proposed solution method is based on immune clone algorithm (ICA). But, in the standard immune clone algorithm, the mutation probability will be reduced with the increase of iterative steps, making it possible to fall into local optimal solution. So, we use the combination of the immune clone algorithm and a variable neighborhood search algorithm to solve the problem. A variable neighborhood search algorithm can increase the diversity of solutions to jump out of local optimal. As the cargo product layout problem is chosen as integer decision variance, the combination of immune clone algorithm and variable neighborhood search algorithm is used; this is called ICA-VNS algorithm. e solution steps of ICA-VNS algorithms are shown as follows: Step 1: the maximum number of iterations MaxNum is set, and Num is defined as the number of iterations. Creating the initial population and letting Num = 0. en, initial population of N antibodies is generated randomly, which contains memory cell M and remaining cells P r . Integer encoding is adopted to solve this problem. e length of the antibody is the sum of the total number of services in the cargo product alternative set. Each antibody's range is from 0 to the maximum frequency of service, and 0 represents not open the service.
Step 2: transfer waiting time is calculated based on the frequency of service. en, the kth shortest path between OD pairs is calculated by A * algorithm. At last, we can get k service paths between each OD pair. If constraints (8) and (9) are not satisfied, then new antibodies are needed to be generated randomly.
Step 3: distributing the OD flow based on software CPLEX and letting Num = 0. e objective function is defined as the antibody affinity function. It is in sequence carried out according to the degree of affinity. When Num = 0 happens, antibodies with the first n high-affinity values should be put into the memory cells M. When Num > 0 happens, N a antibody affinity values are calculated and sequenced. If antibody affinity values are better than the ones in M, they are replaced. en, antibodies that have lower affinity values in P r are replaced with antibodies that have higher affinity values in N a . en, the antibody population is cloned according to certain rules. N i � round((β × N)/i). Let N i be the number of antibody clones and β be the clone factor. Round(·) is defined as the integer function and population size after cloning N a � i N i . If Num equals to MaxNum, turn to Step 6; otherwise, Step 5.
Step 4: mutation after cloning. Using variable neighborhood search algorithm can avoid falling into local optimal solutions and make it easier to get the global optimal solution.
Step 4-1: the more number of neighborhoods needed in a variable neighborhood search algorithm, the greater the probability of getting optimal solutions. e searching time will be increased dramatically with the increase in the number of neighborhoods. To ensure the speed and efficiency of solving, we always use two or three general methods for generating neighborhood. Considering the solution structure and characteristics, two methods will be adopted.
(1) Update operator: after the distribution operation, the frequency of services should be calculated, and then the updated antibody R ′ will be constituted. e method of updating operators is as follows. Either gene fragment in antibody R is selected randomly and then compared with the antibody R ′ gene fragment, and antibody R will be replaced by the one in antibody R ′ if it is different; otherwise, another gene fragment is selected randomly. As is shown in Figure 6, R is the original antibody, and R ′ is the new antibody. One gene fragment is selected randomly, such as the service decision scheme of product P3. It is clear that the service decision scheme between R and R ′ is different for P3. So, gene fragment 2-1-2 in R is updated to1-1-0 in R ′ . (2) Single-point mutation operator: randomly selected one point in antibody R the singe point mutation is used to generate the new gene. ese frequency values will be updated to any value from 0 to the maximum frequency value.
Step 4-2: a random number r ∈ [1, 2] is generated, and the mutation operation operators are selected according to the value of r. Let Num = Num + 1. After the N a antibody carries out mutation operation, go to Step 6 if Num becomes MaxNum; otherwise, turn to Step 2.
Step 5: the optimal antibody is selected as an output from the memory cell M.
e pseudo-code of ICA-VNS is given in Algorithm 1.

Case Study
To verify the model and algorithm, this paper takes Ha-Da railway of China as a case to study the optimized cargo products' layout problems. Ha-Da railway is located in the north of China. According to the data analysis, because of the influence of transport capacity and cargo product, the railway demand mainly includes bulk material demand, and lots of high add-value demands be transported by motor carriers. With the construction of Ha-Da high-speed railway, lots of passenger trains on the existing railway line of Ha-Da will stop running. erefore, transport capacity on the existing railway line of Ha-Da will be relieved, which is beneficial to make the rational cargo products' plan to attract diversified transport demand, especially for attracting the high add-value demand. Part of transport demands and product attributes of the cargo product alternative set are shown in Tables 1 and 2. rough the survey, it is found that the makeup and breakup capacity of HEB is bottleneck. erefore, in this case, we only consider the makeup and breakup capacity of HEB. According to the corresponding literature, we set the makeup capacity of HEB as 4,546 cars per day, and the breakup capacity of HEB is 5,200 cars per day. Meantime, as shown in the formulation, the carrying capacity of the SP  DSQ  70  24  30  SP  JZ  87  72  31  SP  JZ  25  36  32  SP  LY  2  48  33  SP  LS  4  48  34  SP  NGL  19  72  35  SP  NGL  1  72  36  SP  SYX  221  24  37  SP  SYX  16  12  38  SP  SJT  12  24  39  SP  TL  1  24  40  SJT  DSQ  10  24  41  SJT  JZ  45  48  42  SJT  JZ  9  24  43  SJT  LY  1  24  44  SJT  LS  14  24  45  SJT  NGL  12  48  46  SJT  NGL  1  24  47  TLZ  DSQ  2  72  48  TLZ  JZ  14  96  49  TLZ  LY  1  48  50  TLZ  NGL  1  96  51  TLZ  SYX  15  48  52  TLZ  SP  1  24  53  TL  DSQ  5  24  54  TL  JZ  9  48  55  TL  LY  20  24  56  TL  LS  5  24  57  TL  NGL  1  48  58  TL  SYX  11  24  59  TL  SJT  29  24  60 CCB DSQ 97 48 Mathematical Problems in Engineering section will affect the result of cargo products' layout plan. According to data analysis, the section from SP to SYX is also the bottleneck. e carrying capacity of this section is 74 trains per day. Other cost data needed in the example are summarized in Table 3. Otherwise, we assume decisionmaking period T � 24 h, and assume the maximum number of products P1, P2, and P3 is 10, 10, and 60, respectively. rough lookup correlation literature, we find that the reduction coefficient for the express product is between 2 and 3. erefore, we use 2.5 and 1.8 as the reduction coefficients for express product and Scheduled Trains Product, respectively. Using the data above, immune clone-variable neighborhood algorithm is used to solve the problem, and the maximum iteration steps MaxNum � 100, the mutation probability β � 30%, and the population N � 40. e final result shows that the cost of the product layout plan for Ha-Da railway is 1319686.69 RMB, and the iterative process of ICA-VNS algorithm and IC (immune clone) algorithm is shown in Figure 7; the ICA-VNS algorithm has better convergence speed than the IC algorithm. Otherwise, we can obtain the cargo products' layout plan. e result of the cargo products' layout plan is shown in Table 4.
e results show that it should operate 48 trains for regular products, 4 trains for express products, and 1 train for Scheduled Trains Product. It is demonstrated that the main advantage of railway is still mass freight transport. At the same time, some trains for rapid products and train products are also operated when the capacity is relatively abundant according to the customers' demands. In addition, through the flow distribution result, it shows that the lines' capacity is no longer the bottleneck which restricts the railway freight transportation, but the nodes' capacity has been new restrictive factors. It is also illustrated that it is necessary to reconstruct and expand the hubs to further optimize the transportation products to improve hubs' breakup and marshaling capacity so that the transport market demand will be satisfied and the transportation efficiency will be improved.

Conclusion and Future Research
Optimized transportation products' layout on railway lines refers to making a rational organization and operation of transportation products considering the current railway resources and the customers' transport demands at all levels to get reasonable product mix, operation ratio, and to maximize the profits of the operation department. e paper first constructs a service network of main busy lines which can effectively show the hub's transfer, sorting, and classifying operations. en, an optimized model is suggested for the products' layout on BMRL, and the immune clonal-variable neighborhood algorithm is used to solve the model. Finally, an example is given to prove the effectiveness of the model and algorithm. However, the model put forward in the paper is built based on the assumption that the station layout is given, so it needs to study the problem on how to optimize the products' layout on BMRL further combined with the stations' layout.
Data Availability e data in this paper are enough to verify the model and algorithm.

Conflicts of Interest
e authors declare that they have no conflicts of interest.