Research Article | Open Access
Yingqun Zhang, Rui Song, Shiwei He, Haodong Li, Xiaole Guo, "Optimization of Classification Track Assignment Considering Block Sequence at Train Marshaling Yard", Journal of Advanced Transportation, vol. 2018, Article ID 3802032, 11 pages, 2018. https://doi.org/10.1155/2018/3802032
Optimization of Classification Track Assignment Considering Block Sequence at Train Marshaling Yard
An operational process at train marshaling yard is considered in this study. The inbound trains are decoupled and disassembled into individual railcars, which are then moved to a series of classification tracks, forming outbound trains after being assembled and coupled. We focus on the allocation plan of the classification tracks. Given are the disassembling and assembling sequence, the railcars connection plan, and a number of classification tracks. Output is the assignment of the railcars to the classification tracks. An integer programming model is proposed, aimed at reducing the number of coupling operations, as well as the number of dirty tracks which is related to the rehumping operation, and the order of the railcars on the outbound train must satisfy the block sequence. Tabu algorithm is designed to solve the problem, and the model is also tested by CPLEX in comparison. A numerical experiment based on a real-world case is analyzed, and the result can be reached within a reasonable amount of time. We also discussed a number of factors that may affect the track assignment and gave suggestions for the real-world case.
Railway transportation is known as one of the most significant modes of transport. Due to its advantages of the large capacity for both long-distance and short-distance transport, its full-time service, as well as the adaptation to different weather conditions, it is the most commonly used mode in freight transportation. In 2015, around 17.4% of inland cargo in European countries was transported via rail , while such proportion in China wais 13.3% . With the trend of global multimodal freight transportation, especially the development of marine shipping, more railway connections to the other modes of transport are built . It is obvious that the efficient railway transportation is required, which helps ensure the reliability of the supply chain and decrease the transportation cost.
Train marshaling stations are terminals in the rail freight transportation network, where the inbound trains are disassembled into railcars to form outbound trains. Due to the complexity of the operation process at marshaling yards, railcars spend 10%~50% of their time in the marshaling yard during the whole trip , most railcars are just waiting on the track without any operation. Simplifying the operations at marshaling yard can increase the efficiency of the rail freight transportation system. This paper concentrates on process at train marshaling station, especially for the optimization of classification track allocation.
The procedures at marshaling yard can be divided into four subproblems: railcar generation problem, train makeup problem, railcar classification problem, and outbound track assignment problem . The assignment of railcars to classification tracks is one of the most important tasks at train marshaling yard. It is based on the wagon-flow allocation plan, aimed at arranging the traffic flow from the inbound trains to classification tracks and deciding which track the railcars are assigned to. It closely influences the assembling process and the railcar sequence on the outbound train, because an inapposite railcar order on the track may cause much more repetitive work.
The typical layout of a train marshaling yard is shown in Figure 1. Inbound trains, which are composed of railcars with different destinations, will be stored at the arrival yard first. In order to transfer each railcar to its destination, the inbound trains are uncoupled and disassembled into railcars over a hump hill, which is called a humping operation. After rolling down from the hump, each railcar is assigned to a classification track at the classification bowl. Once the order of the railcars on the classification track cannot fit the connection rules, the railcars will be pushed to the hump and do the humping operation again, which is called rehumping operation. The humping and rehumping operations are also regarded as roll-in and pull-out operations in . After being assembled and coupled, railcars form outbound trains at the departure yard and dispatch to their destinations. More details about the whole process are described by Boysen . Once the railcar sequence on one classification track does not satisfy the assembling sequence, more rehumping operations are required, so that railcars will spend much more time at marshaling yard.
After the outbound train leaves the train marshaling yard, it will reach a number of intermediate train yards successively and unload railcars at their corresponding destination. In order to simplify the operation process both at marshaling yards and other following train yards, a group of railcars with the same origin and destination or belonging to the same train form a block. Each group of railcars will not be separated until they reach their assigned blocks, so that the reclassified operations are reduced during the whole trip. A train carrying more than one block is described as a multiblock train, which is of great advantage over a train with only one block . Along the whole journey, the railcars of the same train reach their destinations (some following train yards) successively, the order of the existing destinations is usually regarded as a block sequence, and the complexity of the operational process at each following train yard is influenced by the railcar sequence on the outbound train, which is already determined at the former classification yard. If the railcar sequence does not fit the block sequence, there will be much more operations when the railcars are unloaded at their destinations.
In order to release the pressure at the marshaling station, this paper mainly concentrates on the process at classification bowl, and two problems are taken into account. Firstly, by deciding the railcar assignment, we try to reduce the rehumping operations and coupling operations. Secondly, the railcars on the same train should be arranged in a proper sequence (e.g., the block numbers of railcars on the same train appear consecutively), so that those railcars will arrive at their destinations successively, thus improving the efficiency of the whole rail freight network.
2. Related Work
The classification track assignment is always regarded as a sorting problem, which is already reviewed by Gatto et al. . Generally, the sorting process can be divided into two types, single-stage sorting and multistage sorting. For single-stage sorting, the railcars are allowed to be pushed to the hump hill only once, and the aim is always to minimize the number of classification tracks [10, 11] or dwell time . Multistage sorting allows rehumping operations, and the aim is always the minimization of rehumping operations .
The general train marshaling problem proved to be NP-complete . Few researchers concentrate on holistic operational research models, and typical studies are made by Bohlin et al. [14, 15], where the mixed integer models are formulated. The column generation approach, as well as several heuristics algorithms, is designed to solve those models. They not only decide the assignment of the classification tracks, but also calculate the assembling time for each outbound train. Jaehn et al. [12, 16] also build mixed integer models, aiming to minimize the weighted tardiness of all outbound trains, and an exact branch and bound procedure is designed to solve the problem. More related works are made by He et al., where genetic algorithms are designed to analyze the fuzzy dispatching model , and an optimal decomposing heuristic solution method is proposed to solve the mixed 0-1 integer model .
A number of scholars propose graph theoretical approaches. Bohlin et al.  focus on the cases in which each outbound train can be built on a separate classification track, and the problem was treated as a special list coloring problem. Elias  defines “chains” as a number of rehumping operations, trying to minimize the number of chains, which can be treated as the color sequence. Finally, a 2-approximate solution is achieved.
Some scholars also analyze the rescheduling problem for the rehumping operation [20, 21], which can be treated as a multiperiod dynamic process. Efficient technics for similar topics are introduced by Giat and Dreyfuss [22, 23]. Other studies consider the robustness or uncertainty while making the track assignment, which are reviewed by Boysen et al. . Considering the delay of some incoming trains, Bühsing and Maue provide new algorithms for a feasible humping schedule of the inbound trains, but the number and the capacity of tracks are not considered . Related works are introduced in , where the restriction of the delay is discussed, and efficient algorithms are developed based on the extended model of spares allocation.
In China, very few scholars studied the classification track utilization, and the existing studies concentrate on the improvement of the track capacity [26, 27]. Due to the fact that the classification track is always too short for one outbound train and the number of available tracks is less than the number of blocks, the railcars of one outbound train are always assigned to different classification tracks, thus increasing the number of coupling operations when forming outbound trains. Besides, one classification track may consist of railcars from different outbound trains; when the railcars are not sorted by block or by outbound train on the track, some rehumping procedures are required. Both rehumping and coupling operations are time consuming and will reduce the capacity of station bottleneck.
Most previous studies only considered reducing the rehumping operations or satisfying the block sequence. Besides, due to the complexity to solve the OR model, the restriction on the order of the railcars in the outbound train is not always considered [12, 14–16], and the track capacity is usually ignored as well .
In this paper, the railcar allocation on the classification track is discussed in detail, especially how different types of railcar sequence influence the rehumping operations and coupling operations. Both the classification process and outbound train forming process are considered. In addition, both the assembling sequence and the block number sequence on the train are analyzed, so that the efficiency at the classification bowl, the departure yard, and the following train yards are improved. Many constraints related to the real-world case are also expressed in the paper, such as the track capacity and how the railcars from the former stage that have already on the classification track influence the classification track utilization. Basic studies have been made by the authors of this paper [29, 30], aimed at minimizing the rehumping operations (or the number of dirty tracks) and coupling operations.
The paper consists of five parts. Section 1 mainly introduces the basic operations at marshaling station and the strategy for classification track utilization. Section 2 presents the reviews of related literature. In Section 3, distinctive types of classification tracks are discussed, a 0-1 linear programming model is built, and Tabu algorithm is designed. In Section 4, a numerical experiment of a real-world case is cited to test the model. The final part is the conclusion.
3. Problem Description
3.1. Types of Classification Track
The common sorting strategies can be divided into three types : sorting-by-train, sorting-by-block, and triangular sorting. In China, the sort-by-train and sort-by-block strategies are commonly used, which are mainly discussed in this paper. To simplify the classification track utilization, classification tracks are divided into three types: the empty track, the clean track, and the mixed track . The empty track has no railcar on it. The clean track is occupied by the railcars with the same destination (e.g., sort-by-block strategy) or belonging to the same outbound train (e.g., sort-by-train strategy). The mixed track is occupied by railcars with different destinations or belonging to different outbound trains. There are two types of mixed tracks, the temporary track and the dirty track. On a temporary track, the order of the railcars is the same with the outbound train’s assembling order. On a dirty track, the order of the railcars is different from the outbound train’s assembling order.
Figure 2 is an example of the clean track and the mixed track. Each railcar has a corresponding destination, and each destination is titled with a block number. A, B, and C are block numbers (using sort-by-block strategy) or outbound train numbers (using sort-by-train strategy). Each railcar on the classification track has a fixed assembling time according to the wagon-flow allocation plan. The railcars to block A (or outbound train A) are the earliest for assembling operation, followed by railcars to block B and C. For the temporary track, the railcars on the classification track satisfy the assembling sequence, while for the dirty track, railcar A is on the left of the track so that it will be the last for the assembling operation, which does not satisfy the assembling sequence.
Operations on the clean track are relatively simple, as the railcars can be directly moved to the departure yard. As for temporary track, more coupling operations are required. When a dirty track appears, rehumping operations are required. The existence of mixed tracks will lead to much more dwell time and greatly increase the difficulty in marshaling operations.
Figure 3 shows an example of the coupling operation. Railcars belong to the same outbound train; are assigned to classification track 1, while are assigned to classification track 2. When the outbound trains are separated on classification tracks, those railcars should be connected while assembling in order to form the outbound trains.
Apart from considering the assembling sequence, we also take the block sequence into account. Assume that the blocks from near to far are ordered from 1 to 5 and each railcar is unloaded at its corresponding destination. In order to simplify the unloading operation, the railcar next to the locomotive is the earliest to drop off at the nearest block. We note that the block number of each railcar on the classification track should be an ascending order, so that the outbound train can directly upload the railcars at their destination.
3.2. Mathematical Model
The core problem is to find a proper railcar sequence on the classification track, trying to make less mixed tracks and satisfying the requirements of the block sequence. To simplify the problem, two assumptions are made:(i)The railcars with the same destination that do not depart at the end of the stage plan can be considered as an outbound train.(ii)The length of the trains and the classification tracks are measured by the number of railcars.
We consider all operations in one stage plan; the set of inbound trains (index ) and the set of outbound train (index ) are given. All the trains are sorted by the dissembling and assembling sequence incrementally, , where is dissembled before and is assembled before . The start time of disassembling and the end time of assembling divide the marshaling process into time segments at most. Each time segment represents a track allocation condition in classification yard, because the railcars may hump to classification yard for disassembling or leave the classification yard for assembling.
The set of railcars contains all railcars of inbound trains and outbound trains. For each railcar , the outbound train that it serves, its length , its start time of disassembling , and the end time of assembling are given. We define a Boolean variable , which describes the relation between railcar and its outbound train. If railcar belongs to outbound train , , otherwise 0.
According to Section 3.1, in order to simplify the operation process, the block number on an outbound train should be an ascending order. denotes the destination of railcar (e.g., the index of the railcar is 3, and the destination is station D, whose index is 4; then ). denotes the outbound train that railcar serves. For arbitrary railcars on the same classification track, and , if is closer to the locomotive than , and , then the rule of track assignment based on block sequence is satisfied (see Figure 4).
There are classification tracks; for any point of time, the total railcar length must be less than the track capacity . In order to describe the condition of the railcars at each time segment, the binary variable is designed, which equals 1 when railcar u is assigned to track w at time point t and 0 otherwise. The connection of the outbound train and its corresponding track is described as variable , which equals 1 when the outbound train j is on track w. The third decision variable is , defining the dirty track; means track is dirty track, otherwise not.
All the parameters and variables are described in Table 1.
Dirty tracks require more rehumping operations, and temporary tracks mean more coupling operations. Our purpose is to minimize the number of mixed tracks, including both dirty tracks and temporary tracks. In the model, the number of temporary tracks is measured by the number of coupling times, while the number of rehumping times equals the number of dirty tracks.
The aim of the model is to minimize the number of dirty tracks and the coupling times for assembling operations, which is expressed in objective function (1); is a weight coefficient to distinguish the importance of the rehumping operation and the coupling operation. At any point of time, a railcar cannot be assigned to more than one track, which is guaranteed by constraint (2). Constraint (3) and (4) describe the relation between railcars and classification tracks. Each railcar is arranged to a track, and the track is not occupied after the assembling time of the railcar. Constraint (5) ensures that the total length of all railcars on the same track cannot exceed its capacity at any time segment. Constraint (6) is the definition of dirty track. It means track is dirty track when railcar sequence does not satisfy the assembling sequence. Constraint (7) describes the relation among tracks, railcars, and outbound trains. It means that once the railcar is on the track, the outbound train it belongs to is on the track too. Constraints (8)-(9) ensure that the minimum number of tracks for each outbound train is 1, while the maximum is . Owing to the length limit of the classification tracks, railcars of the same outbound train may be assigned to two or more tracks. In such condition, a series of coupling processes are required to connect railcars from different tracks; the order of railcars should satisfy the block sequence, which is expressed in constraint (10) and (11).
3.3. Solution Algorithm
The model is a 0-1 integer programming model, so that exact solutions can be reached by ILOG CPLEX. However, when the scale is expanded, there is a sharp increase in the solution time. It has been proved by many scholars that specific single-stage shunting and multistage shunting problem are strongly NP-complete, so a Tabu search is designed for the improvement of efficiency (see Figure 5).
Step 0 (initialization). The initial solution is set by a two-dimensional array , which means each railcar is assigned to a classification track . It is a randomly generated sequence of railcars which are assigned to classification tracks according to the railcars connection plan. The objective function is described as . Set .
Step 1 (neighborhood search). A new solution is generated by randomly changing the corresponding track of a certain railcar based on rules of 2-Opt, and then the objective function value is calculated individually.
Step 2 (Tabu list design). The Tabu search algorithm uses the Tabu list to record the local optimal solution to avoid roundabout searching and find the global optimal solution. There are two main characters, Tabu object and Tabu length. In this paper, Tabu object is denoted by a three-dimensional array , and the information involved is railcar index , track which is arranged by railcar of the previous phase, and track which is occupied by railcar of the new round of neighborhood search.
Step 3 (solution check). If the minimum objective function is less than the best solution, , then the Tabu list is renewed, and set ; else repeat step 1.
The computational experiments prove that the Tabu search algorithm offers a good solution in a very short time. Usually the optimal solution appears in the 50-100th iteration, so the maximum iteration is designed to be 100, and the Tabu length is 30 by a variety of tests.
4. Numerical Experiments and Analysis
4.1. Data Preparation
The numerical experiment integrates with actual scenarios and randomly created data, which was cited in . Input is 12 inbound trains (A1~A12), 17 outbound trains (B1~B17), and railcars connection plan. Table 2 shows the disassembling and assembling sequence of the train, involving 15 time segments. According to the input data in Table 3, outbound trains B13~B17 will not depart by the end of stage. There are at least 7 destinations for the railcars, whose indexes are 1~7 from near to far. Table 4 is the railcar connection plan, in the column “Outbound Train”, B1 (3, 4) means outbound train B1 contains railcars with destination 3 and 4, and the column “Makeup” represents outbound train/railcar index/railcar number.
4.2. Computational Results
The numerical experiments are tested by both CPLEX and the Tabu algorithm. The algorithm is written in , and it runs in Visual studio 2012. Those two pieces of software run on a laptop with an Intel Core i7 CPU and 12G memory.
Assume that there are 10 classification tracks. The capacity of each classification track is 100. The objective function is 27, where there are 0 dirty track and 10 temporary tracks. As it can be seen in Figure 6, outbound trains B1, B2, B3, B4, B5, B6, B7, B12, B13, B14 are all allocated to different tracks, requiring 10 coupling operations.
In comparison, we also make the track assignment without considering the block sequence. By testing the model in  which does not consider constraints (10) and (11), the objective function is 18, with 1 dirty track (track 3) and no temporary track (see Figure 7).
More comparisons can be seen in Table 5. It can be indicated that the number of coupling operations is the most affected factor while considering the block sequence. Because more restrictions for the railcar sequence are required, which may cause more coupling times than before.
As for the algorithm, the optimization solution can be found within 50 interactions. The calculation results show that this algorithm has good convergence (see Figure 8).
In addition, the algorithm can reach the optimal solution in a shorter time compared to CPLEX as the scale expands. As it can be seen in Table 6, when the track number is less than 8, CPLEX cannot find an optimal solution due to the limitation of the machine’s memory, while Tabu algorithm can reach a locally optimal solution.
The facilities and the operation strategies as well the stage plans will influence the track assignments. In order to find out to what extent the facilities influence such process, we vary the number and the length of tracks. Then we discuss how the wagon-flow allocation plan and railcars from the last stage affect the track allocation.
4.3.1. Variation in Track Number
Both the track number and the track length represent the capacity of the classification bowl. Adding the number of classification tracks will decrease the possibility of forming dirty tracks or temporary tracks. Since more options and less restrictions are available for the railcars. However, in China, it is impracticable to build new tracks, and the track number is usually less than the block number. Most of the time, each track is assigned to a fixed block number, which will restrict the classification track assignment too. Due to the intense capacity, it is better to decide a reasonable assembling sequence while making the stage plan.
4.3.2. Variation in Track Length
Usually, in a classification bowl, the tracks’ lengths are different due to the shape of the yard. For the limit of the track length, railcars of the same outbound train may be assigned to more than one classification track. We tested tracks with arbitrary length to see the impact. For the cases with 8~11 tracks (see Table 7), once the lengths of the classification tracks are reduced, more temporary tracks and dirty tracks are formed, which means that more rehumping operations and coupling operations are required. As with the number of tracks, it is also infeasible to change track length at marshaling station, so it is better to make track assignment for the railcars with special needs ahead of time (e.g., outbound trains with more railcars should be allocated to a longer track with a similar length).
4.3.3. The Influence of Wagon-Flow Allocation Plan
According to the wagon-flow allocation plan, railcar 5 and 12 cannot be assembled by the end of this stage, so that those tracks will be occupied throughout the whole stage (see track 6 in Figure 6, track 9 in Figure 7). The railcars connection plan, as well as the disassembling and assembling sequence, is the factor that mainly influences the quality of the track assignment. For example, a reasonable disassembling sequence may lead to a proper railcar sequence on the classification track during a certain time. Coordinating the use of the classification track and the wagon-flow allocation plan can greatly reduce the time at train marshaling yard. Therefore, in the real world case, it is better to make an integrated plan, which is also the aim of our future work.
4.3.4. For Railcars from the Last Stage
Usually, there are some railcars that cannot be assembled by the end of the stage, so that they may stay on the track for the next operational stage. Such railcars may influence the track assignment for the following procedure. As it is shown in Table 3, the first 3 railcars are considered as an inbound train A0, which are not assembled by the end of the last stage. Assuming that those 3 railcars park on 3 tracks, respectively, after calculating by the model, 1 more dirty track appears. Once there are railcars whose assembling time are earlier than those three railcars, they would prefer not be assigned to the same tracks, thus making the other tracks overloaded. In our model, it is better to assign railcars of the same outbound train to one track, more restrictions to those three tracks are required, so that more rehumping and coupling operations are needed.
Due to the uneven traffic flow and the influence of the station layout, the classification track capacity at most marshaling stations is very tight. The optimization of classification tracks has an important influence on improving the efficiency for marshaling operations.
In this paper, the basic application of the classification tracks is analyzed. This paper requests a certain sequence of the railcars, in order to reduce the rehumping operations and the coupling operations at marshaling station, as well as simplify the operations at following train yards. It puts forward a holistic design thinking of the rail freight network, trying to decrease the whole time. Tabu search is designed for the real-world application, which proved to be efficient. A variety of factors such as track length, track number, wagon-flow allocation plan, and railcars from the last stage would influence the results. It illustrates that operations of railway system are continuous processes and should be considered as a whole.
Conflicts of Interest
The authors declare that there are no conflicts of interest regarding the publication of this article.
This paper is supported by the National Natural Science Foundation of China No. U1434207 and No. U1734204.
- Eurostat, EU transport in figures: statistical pocketbook, Office for official publications of the European communities, 2017.
- “China, Macao SAR,” in International trade statistics yearbook 2013, Volume I, International Trade Statistics Yearbook (Ser. G), pp. 130-131, United Nations, 2015.
- Y. Wiseman and Y. Giat, “Red sea and mediterranean sea land bridge via eilat,” World Review of Intermodal Transportation Research, vol. 5, no. 4, pp. 353–368, 2015.
- Y. M. Bontekoning and H. Priemus, “Breakthrough innovations in intermodal freight transport,” Transportation Planning and Technology, vol. 27, no. 5, pp. 335–345, 2004.
- N. Boysen, S. Emde, and M. Fliedner, “The basic train makeup problem in shunting yards,” OR Spectrum, vol. 38, no. 1, pp. 207–233, 2016.
- M. Bohlin, “Track Allocation in Freight-Train Classification with Mixed Tracks,” in Proceedings of the Atmos 2011 - Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, pp. 38–51, Saarbrücken, Germany, 2011.
- N. Boysen, M. Fliedner, F. Jaehn, and E. Pesch, “Shunting yard operations: Theoretical aspects and applications,” European Journal of Operational Research, vol. 220, no. 1, pp. 1–14, 2012.
- J. Xiao, B. Lin, and J. Wang, “Solving the train formation plan network problem of the single-block train and two-block train using a hybrid algorithm of genetic algorithm and tabu search,” Transportation Research Part C: Emerging Technologies, vol. 86, pp. 124–146, 2018.
- M. Gatto, J. Maue, M. Mihalák, and P. Widmayer, “Shunting for Dummies: An Introductory Algorithmic Survey,” in Robust and Online Large-Scale Optimization, vol. 5868 of Lecture Notes in Computer Science, pp. 310–337, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009.
- E. Dahlhaus, P. Horak, M. Miller, and J. F. Ryan, “The train marshalling problem,” Discrete Applied Mathematics, vol. 103, no. 1–3, pp. 41–54, 2000.
- R. S. Hansmann and U. T. Zimmermann, “Optimal sorting of rolling stock at hump yards,” in Mathematics---key technology for the future, pp. 189–203, Springer, Berlin, 2008.
- F. Jaehn, J. Rieder, and A. Wiehl, “Minimizing delays in a shunting yard,” OR Spectrum, vol. 37, no. 2, pp. 407–429, 2015.
- E. Kraft and M. Guignard-Spielberg, “A mixed integer optimization model to improve freight car classification in railroad yards,” TIMS/ORSA, p. 35, 1993.
- M. Bohlin, “Hump yard track allocation with temporary car storage,” in Proceedings of the The 4th International Seminar on Railway Operations Modelling and Analysis, RailRome, 2011.
- M. Bohlin, “Optimal freight train classification using column generation,” Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, pp. 125–10, 2012.
- F. Jaehn, J. Rieder, and A. Wiehl, “Single-stage shunting minimizing weighted departure times,” OMEGA - The International Journal of Management Science, vol. 52, pp. 133–141, 2015.
- S. He, R. Song, and S. S. Chaudhry, “Fuzzy dispatching model and genetic algorithms for railyards operations,” European Journal of Operational Research, vol. 124, no. 2, pp. 307–331, 2000.
- S. He, R. Song, and S. S. Chaudhry, “An integrated dispatching model for rail yards operations,” Computers & Operations Research, vol. 30, no. 7, pp. 939–966, 2003.
- E. Dahlhaus, “Algorithms for combinatorial problems related to train marshalling,” in Proceedings of the AWOCA 2000, In Hunter Valley, pp. 7–16, Citeseer, 2000.
- E. R. Kraft, “Hump sequencing algorithm for real time management of train connection reliability,” Transportation Quarterly, vol. 54, no. 4, pp. 95–115, 2000.
- R. Jacob, P. M\'Arton, J. Maue, and M. Nunkesser, “Multistage methods for freight train classification,” Networks. An International Journal, vol. 57, no. 1, pp. 87–105, 2011.
- Y. Giat, “The Effects of Output Growth on Preventive Investment Policy,” American Journal of Operations Research, vol. 03, no. 06, pp. 474–486, 2013.
- M. Dreyfuss and Y. Giat, “A risk management model for an academic institution’s information system,” Information Resources Management Journal, vol. 31, no. 1, pp. 83–96, 2018.
- C. Büsing and J. Maue, “Robust algorithms for sorting railway cars,” in European Symposium on Algorithms, vol. 6346 of Lecture Notes in Comput. Sci., pp. 350–361, Springer, Berlin, 2010.
- M. Dreyfuss and Y. Giat, “Optimal spares allocation to an exchangeable-item repair system with tolerable wait,” European Journal of Operational Research, vol. 261, no. 2, pp. 584–594, 2017.
- F. Xue, D. j. Zuo, and J. Luo, “Adjustment and application model of shunting yard track group in marshalling station,” Railway Transport and Economy, vol. 33, no. 11, pp. 75–79, 2011.
- Z. t. Zhang, C. Bingmou, and Q. Cheng-jun, “Heightening Efficiency of Break-up Operation in Marshlling Station,” Transport Standardization, vol. 1, pp. 130–133, 2010.
- G. Di Stefano and M. L. Koči, “A graph theoretical approach to the shunting problem,” Electronic Notes in Theoretical Computer Science, vol. 92, pp. 16–33, 2004.
- H.-D. Li, R. Song, and Z.-G. Hu, “Optimization of classification track assignment in railway marshaling yard,” Tiedao Xuebao/Journal of the China Railway Society, vol. 37, no. 12, pp. 8–13, 2015.
- Y.-Q. Zhang, R. Song, and H.-D. Li, “Optimization of classification track assignment based on the railcar connection plan in hump yard,” Jiaotong Yunshu Xitong Gongcheng Yu Xinxi/Journal of Transportation Systems Engineering and Information Technology, vol. 16, no. 3, pp. 120–125, 2016.
- C. F. Daganzo, R. G. Dowling, and R. W. Hall, “Railroad classification yard throughput: the case of multistage triangular sorting,” Transportation Research Part A: General, vol. 17, no. 2, pp. 95–106, 1983.
Copyright © 2018 Yingqun Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.