{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:29:04Z","timestamp":1777703344572,"version":"3.51.4"},"reference-count":19,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T00:00:00Z","timestamp":1557619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2019,7,9]]},"abstract":"<jats:p>\u00a0The 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.<\/jats:p>","DOI":"10.3233\/jifs-179106","type":"journal-article","created":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T11:35:26Z","timestamp":1558092926000},"page":"527-536","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":2,"title":["Model and algorithm of wagon-flow allocating in marshalling station based on sequence theory"],"prefix":"10.1177","volume":"37","author":[{"given":"Yun","family":"Jing","sequence":"first","affiliation":[{"name":"School of Traffic and Transportation, Beijing Jiaotong University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siye","family":"Guo","sequence":"additional","affiliation":[{"name":"School of Traffic and Transportation, Beijing Jiaotong University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenhua","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Traffic and Transportation, Beijing Jiaotong University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Embrima","family":"Jeng","sequence":"additional","affiliation":[{"name":"School of Traffic and Transportation, Beijing Jiaotong University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2019,5,12]]},"reference":[{"issue":"4","key":"e_1_3_2_2_2","first-page":"1","article-title":"Study on wagon-flow allocating problem in a marshalling station by using calculating method on-table[J]","volume":"24","author":"Wang C.-G.","year":"2002","unstructured":"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\u20135.","journal-title":"Journal of the China Railway Society"},{"issue":"1","key":"e_1_3_2_3_2","first-page":"1","article-title":"Research on the model and algorithm of dynamic wagon-flow allocating in a marshalling station[J]","volume":"26","author":"Wang C.-G.","year":"2004","unstructured":"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\u20137.","journal-title":"Journal of the China Railway Society"},{"issue":"3","key":"e_1_3_2_4_2","first-page":"486","article-title":"Local neighborhood search algorithm for generalized dynamic wagon-flow allocation of railway technical stations[J]","volume":"45","author":"Zhao J.","year":"2010","unstructured":"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\u2013492.","journal-title":"Journal of Southwest Jiaotong University"},{"issue":"11","key":"e_1_3_2_5_2","first-page":"1","article-title":"Lagrangian relaxation algorithm for integrated wagon-flow allocation and shunting locomotive scheduling at technical railway station [J]","volume":"33","author":"Zhao J.","year":"2011","unstructured":"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\u20137.","journal-title":"Journal of the China Railway Society"},{"issue":"4","key":"e_1_3_2_6_2","first-page":"8","article-title":"Model and algorithm of dynamic wagon-flow allocating in a marshalling yard under uncertaint conditions [J]","volume":"32","author":"Jing Y.","year":"2010","unstructured":"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\u201312.","journal-title":"Journal of the China Railway Society"},{"issue":"6","key":"e_1_3_2_7_2","first-page":"1","article-title":"Optimization algorithm for wagon-flow allocation in marshalling station [J]","volume":"45","author":"Xue F.","year":"2010","unstructured":"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\u20136.","journal-title":"Journal of Southwest Jiaotong University"},{"issue":"4","key":"e_1_3_2_8_2","first-page":"1","article-title":"Study on coordination of hard and soft optimization of marshalling station stage plan[J]","volume":"21","author":"He S.-W.","year":"1999","unstructured":"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\u20138.","journal-title":"Journal of the China Railway Society"},{"issue":"6","key":"e_1_3_2_9_2","first-page":"900","article-title":"Estimation method of rolling-cars time on marshalling yard[J]","volume":"44","author":"Jing Y.","year":"2009","unstructured":"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\u2013905.","journal-title":"Journal of Southwest Jiaotong University"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(02)00064-3"},{"issue":"6","key":"e_1_3_2_11_2","first-page":"1","article-title":"Optimal model and algorithm of stage plan of intelligent dispatching system for marshalling stations[J]","volume":"27","author":"Wang M.-H.","year":"2005","unstructured":"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\u20139.","journal-title":"Journal of the China Railway Society"},{"issue":"6","key":"e_1_3_2_12_2","first-page":"16","article-title":"Comprehensive optimization of car flows joining at bidirectional marshalling station[J]","volume":"20","author":"Hui-Min N.","year":"1998","unstructured":"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\u201321.","journal-title":"Journal of the China Railway Society"},{"issue":"2","key":"e_1_3_2_13_2","first-page":"108","article-title":"Model and algorithm for the generalized wagon-flow allocation problem of railway technical station[J]","volume":"31","author":"Peng Q.-Y.","year":"2010","unstructured":"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\u2013114.","journal-title":"China Railway Science"},{"issue":"1","key":"e_1_3_2_14_2","first-page":"38","article-title":"The model and algorithm of using shunting engines for railroad technical service station[J]","volume":"15","author":"Li W.-Q.","year":"2000","unstructured":"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\u201343.","journal-title":"Journal of Systems Engineering"},{"key":"e_1_3_2_15_2","article-title":"TRec: An efficient recommendation system for hunting passengers with deep neural networks","author":"Huang Z.","year":"2018","unstructured":"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).","journal-title":"Neural Computing and Applications"},{"issue":"3","key":"e_1_3_2_16_2","first-page":"1","article-title":"Solving the scheduling problem of hump locomotive with ant colony optimization[J]","volume":"28","author":"Wang S.-D.","year":"2007","unstructured":"S.-D.Wang and L.Zheng, Solving the scheduling problem of hump locomotive with ant colony optimization[J], China Railway Science28(3) (2007), 1\u20137.","journal-title":"China Railway Science"},{"issue":"2","key":"e_1_3_2_17_2","first-page":"1","article-title":"Network model of static wagon-flow allocation in a marshalling station[J]","volume":"1","author":"Wang C.-G.","year":"2003","unstructured":"C.-G.Wang, Network model of static wagon-flow allocation in a marshalling station[J], Journal of Transportation Engineering and Information1(2) (2003), 1\u20137.","journal-title":"Journal of Transportation Engineering and Information"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(86)90048-1"},{"issue":"6","key":"e_1_3_2_19_2","first-page":"967","article-title":"A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem[J]","volume":"38","year":"2010","unstructured":"A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem[J], Computers and Operations Research38(6) (2010), 967\u2013983.","journal-title":"Computers and Operations Research"},{"key":"e_1_3_2_20_2","unstructured":"G.Tang Modern Scheduling Theory[M]. Shanghai: Shanghai Science Popularization Press 2003."}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-179106","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-179106","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-179106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:38:30Z","timestamp":1777455510000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-179106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,12]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,7,9]]}},"alternative-id":["10.3233\/JIFS-179106"],"URL":"https:\/\/doi.org\/10.3233\/jifs-179106","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,12]]}}}