The propose of this paper is building the flow shop model with full-loaded constraints and maximum wagons within the stage. Based on sequence theory, technical operations of marshalling station are described as process of flow shop. By definition of key trains, the adjustment of the classification schedule of inbound trains is attributed to the adjustment of key trains for reducing invalid solution. Based on the LS rules to construct an initial solution, tabu search algorithm (TS) dynamically adjusts taboo step, and build a network model of static wagon-flow allocation for the objective function, to ensure the feasibility of solutions. Finally, the example demonstrates the effectiveness of the algorithm, and differences between full-loaded and full-cars constrains.
C.-G.Wang, Study on wagon-flow allocating problem in a marshalling station by using calculating method on-table[J], Journal of the China Railway Society24(4) (2002), 1–5.
2.
C.-G.Wang, Research on the model and algorithm of dynamic wagon-flow allocating in a marshalling station[J], Journal of the China Railway Society26(1) (2004), 1–7.
3.
J.Zhao, Q.-Y.Peng, C.Wen, et al., Local neighborhood search algorithm for generalized dynamic wagon-flow allocation of railway technical stations[J], Journal of Southwest Jiaotong University45(3) (2010), 486–492.
4.
J.Zhao, X.-S.Han and Q.-Y.Peng, Lagrangian relaxation algorithm for integrated wagon-flow allocation and shunting locomotive scheduling at technical railway station [J], Journal of the China Railway Society33(11) (2011), 1–7.
5.
Y.Jing and C.-G.Wang, Model and algorithm of dynamic wagon-flow allocating in a marshalling yard under uncertaint conditions [J], Journal of the China Railway Society32(4) (2010), 8–12.
6.
F.Xue, C.Wang and Z.Zhang, Optimization algorithm for wagon-flow allocation in marshalling station [J], Journal of Southwest Jiaotong University45(6) (2010), 1–6.
7.
S.-W.He, R.Song and A.-Z.Hu, Study on coordination of hard and soft optimization of marshalling station stage plan[J], Journal of the China Railway Society21(4) (1999), 1–8.
8.
Y.Jing, C.-G.Wang, F.Xue and F.Mu, Estimation method of rolling-cars time on marshalling yard[J], Journal of Southwest Jiaotong University44(6) (2009), 900–905.
9.
S.-W.He, R.Song and S.S.Chaudhry, An integrated dispatching model for rail yards operations[J], Computers & Operations Research30(7) (2003), 939–966.
10.
M.-H.Wang and Q.Zhao, Optimal model and algorithm of stage plan of intelligent dispatching system for marshalling stations[J], Journal of the China Railway Society27(6) (2005), 1–9.
11.
N.Hui-Min and H.An-Zhou, Comprehensive optimization of car flows joining at bidirectional marshalling station[J], Journal of the China Railway Society20(6) (1998), 16–21.
12.
Q.-Y.Peng, J.Zhao and X.-S.Han, Model and algorithm for the generalized wagon-flow allocation problem of railway technical station[J], China Railway Science31(2) (2010), 108–114.
13.
W.-Q.Li and W.Wang, W.Du, et al., The model and algorithm of using shunting engines for railroad technical service station[J], Journal of Systems Engineering15(1) (2000), 38–43.
14.
Z.Huang, G.Shan, J.Cheng and J.Sun, TRec: An efficient recommendation system for hunting passengers with deep neural networks, Neural Computing and Applications (2018).
15.
S.-D.Wang and L.Zheng, Solving the scheduling problem of hump locomotive with ant colony optimization[J], China Railway Science28(3) (2007), 1–7.
16.
C.-G.Wang, Network model of static wagon-flow allocation in a marshalling station[J], Journal of Transportation Engineering and Information1(2) (2003), 1–7.
17.
F.Glover, Future paths for integer programming and links to artificial intelligence[J], Computers and Operations Research13(5) (1986), 533–549.
18.
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem[J], Computers and Operations Research38(6) (2010), 967–983.
19.
G.Tang, Modern Scheduling Theory[M]. Shanghai: Shanghai Science Popularization Press, 2003.
