{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:14:12Z","timestamp":1760242452893,"version":"build-2065373602"},"reference-count":21,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2017,7,14]],"date-time":"2017-07-14T00:00:00Z","timestamp":1499990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>China\u2019s railway network is one of the largest railway networks in the world. By the end of 2016, the total length of railway in operation reached 124,000 km and the annual freight volume exceeded 3.3 billion tons. However, the structure of network does not completely match transportation demand, i.e., there still exist a few bottlenecks in the network, which forces some freight flows to travel along non-shortest paths. At present, due to the expansion of the high-speed railway network, more passengers will travel by electric multiple unit (EMU) trains running on the high-speed railway. Therefore, fewer passenger trains will move along the regular medium-speed lines, resulting in more spare capacity for freight trains. In this context, some shipments flowing on non-shortest paths can shift to shorter paths. And consequently, a combinatorial optimization problem concerning which origin-destination (O-D) pairs should be adjusted to their shortest paths will arise. To solve it, mathematical models are developed to adjust freight flows between their shortest paths and non-shortest paths based on the 0-1 knapsack problem. We also carry out computational experiments using the commercial software Gurobi and a greedy algorithm (GA), respectively. The results indicate that the proposed models are feasible and effective.<\/jats:p>","DOI":"10.3390\/sym9070118","type":"journal-article","created":{"date-parts":[[2017,7,14]],"date-time":"2017-07-14T10:45:02Z","timestamp":1500029102000},"page":"118","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Modeling the 0-1 Knapsack Problem in Cargo Flow Adjustment"],"prefix":"10.3390","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9286-0873","authenticated-orcid":false,"given":"Boliang","family":"Lin","sequence":"first","affiliation":[{"name":"School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China"}]},{"given":"Siqi","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China"}]},{"given":"Ruixi","family":"Lin","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Stanford University, Stanford, CA 94305, USA"}]},{"given":"Jianping","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China"}]},{"given":"Jiaxi","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China"}]},{"given":"Chang","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China"}]}],"member":"1968","published-online":{"date-parts":[[2017,7,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1002\/jccs.197200002","article-title":"The 0-1 integer programming model for optimal car routing problem and algorithm for the available set in rail network","volume":"19","author":"Lin","year":"1997","journal-title":"J. Chin. Railw. Soc."},{"key":"ref_2","first-page":"592","article-title":"Study of transportation structure adjustment between lines Jing-Jiu and Jing-Guang","volume":"36","author":"Du","year":"2002","journal-title":"J. Shanghai Jiaotong Univ."},{"key":"ref_3","first-page":"1198","article-title":"Wagon flow organization optimization after building of Xin-Chang railway","volume":"31","author":"Ye","year":"2003","journal-title":"J. Tongji Univ."},{"key":"ref_4","first-page":"29","article-title":"Studies on models and algorithms of optimizing train flow paths in railway network","volume":"30","author":"Su","year":"2008","journal-title":"J. Chin. Railw. Soc."},{"key":"ref_5","first-page":"7","article-title":"Railway car flow distribution node-arc and arc-path models based on multi-commodity and virtual arc","volume":"33","author":"Tian","year":"2011","journal-title":"J. Chin. Railw. Soc."},{"key":"ref_6","first-page":"1","article-title":"Allocating freight empty cars in railway networks with dynamic demands","volume":"2014","author":"Zhao","year":"2014","journal-title":"Discret. Dyn. Nat. Soc."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.trb.2009.05.004","article-title":"A tabu search algorithm for rerouting trains during rail operations","volume":"44","author":"Corman","year":"2010","journal-title":"Transp. Res. B-Meth."},{"key":"ref_8","unstructured":"Sadykov, R., Lazarev, A.A., Shiryaev, V., and Stratonnikov, A. (2013, January 5). Solving a freight railcar flow problem arising in Russia. Proceedings of the 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, Sophia Antipolis, France."},{"key":"ref_9","unstructured":"Bornd\u00f6rfer, R., F\u00fcgenschuh, A., Klug, T., Schang, T., Schlechte, T., and Sch\u00fclldorf, H. (2014). The Freight Train Routing Problem, Angewandte Mathematik und Optimierung Schriftenreihe."},{"key":"ref_10","first-page":"1","article-title":"Estimation method of path-selecting proportion for urban rail transit based on AFC data","volume":"2015","author":"Zhou","year":"2015","journal-title":"Math. Prob. Eng."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2015\/940815","article-title":"Dynamic schedule-based assignment model for urban rail transit network with capacity constraints","volume":"2015","author":"Han","year":"2015","journal-title":"Sci. World J."},{"key":"ref_12","first-page":"1","article-title":"Operational impacts of using restricted passenger flow assignment in high-speed train stop scheduling problem","volume":"2013","author":"Fu","year":"2013","journal-title":"Math. Prob. Eng."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1287\/trsc.35.3.238.10152","article-title":"A modeling framework for passenger assignment on a transport network with timetables","volume":"35","author":"Nguyen","year":"2001","journal-title":"Transp. Sci."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/trsc.35.3.250.10154","article-title":"Common-lines and passenger assignment in congested transit networks","volume":"35","author":"Cominetti","year":"2001","journal-title":"Transp. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","article-title":"Where are the hard knapsack problems?","volume":"32","author":"Pisinger","year":"2005","journal-title":"Comput. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.disopt.2008.09.004","article-title":"A hybrid algorithm for the unbounded knapsack problem","volume":"6","author":"Poirriez","year":"2009","journal-title":"Discret. Optim."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.jsc.2015.05.006","article-title":"Knapsack problems in products of groups","volume":"74","author":"Frenkel","year":"2016","journal-title":"J. Symb. Comput."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1016\/j.ejor.2015.10.014","article-title":"Robust optimization of the 0-1 knapsack problem: Balancing risk and return in assortment optimization","volume":"250","author":"Rooderkerk","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"5798","DOI":"10.1109\/TSP.2015.2461515","article-title":"Forward-backward greedy algorithms for atomic norm regularization","volume":"63","author":"Rao","year":"2015","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s00453-007-9124-4","article-title":"Models of greedy algorithms for graph problems","volume":"54","author":"Davis","year":"2009","journal-title":"Algorithmica"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.cor.2017.03.016","article-title":"Carousel greedy: A generalized greedy algorithm with applications in optimization","volume":"85","author":"Cerrone","year":"2017","journal-title":"Comput. Oper. Res."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/9\/7\/118\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:42:46Z","timestamp":1760208166000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/9\/7\/118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,14]]},"references-count":21,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2017,7]]}},"alternative-id":["sym9070118"],"URL":"https:\/\/doi.org\/10.3390\/sym9070118","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2017,7,14]]}}}