{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T18:06:07Z","timestamp":1765649167029,"version":"3.48.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T00:00:00Z","timestamp":1757462400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T00:00:00Z","timestamp":1757462400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100008349","name":"Universit\u00e4t Duisburg-Essen","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100008349","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Auto-trains serve as the favored transportation mode for distributing passenger vehicles, offering cost-effective and environmental benefits over transportation by trucks. This paper addresses the auto-train loading problem (ATLP) with the objective to improve the capacity utilization of auto-trains. We propose five different problem cases of the ATLP with varying levels of available information on the availability and accessibility of the vehicles and develop suitable strategies to solve them. This paper proposes the first contribution to the ATLP in the domain of finished vehicle logistics. The ATLP differs from similar problems, such as the motorail transportation problem, as it involves various precedence constraints. We consider the method and order in which the vehicles are parked as well as the order in which they are loaded on the auto-train. For the first two cases, we approach the problem as a multiple knapsack problem and solve it heuristically using a best-fit algorithm. For the other three cases, we formulate the ATLP as a generalized assignment problem and solve it with a commercial solver. We also develop a rolling-horizon heuristic to address the problem\u2019s size for two of these cases. This research contributes by formally defining the ATLP, offering a spectrum of strategies tailored to varying levels of information, and conducting simulations based on real-world data to quantify potential improvements. The findings indicate that, on average, the objective value of strategies for cases with less available information aligns with historical data, while our strategies for cases with higher information could increase capacity utilization by up to 9.73% compared to historical data.<\/jats:p>","DOI":"10.1007\/s10288-025-00598-8","type":"journal-article","created":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T07:13:54Z","timestamp":1757488434000},"page":"393-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Comparing loading strategies for auto-trains: balancing efficiency with information requirements"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2552-2123","authenticated-orcid":false,"given":"Christian","family":"J\u00e4ck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,10]]},"reference":[{"issue":"2","key":"598_CR1","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1287\/trsc.32.2.174","volume":"32","author":"GY Agbegha","year":"1998","unstructured":"Agbegha GY, Ballou RH, Mathur K (1998) Optimizing auto-carrier loading. Transp Sci 32(2):174\u2013188. https:\/\/doi.org\/10.1287\/trsc.32.2.174","journal-title":"Transp Sci"},{"key":"598_CR2","unstructured":"BMW Group (2022) Pilot project: Cars manoeuvre in production without drivers. https:\/\/www.press.bmwgroup.com\/global\/article\/detail\/T0402335EN\/pilot-project:-cars-manoeuvre-in-production-without-drivers?language=en. Accessed 11 June 2023"},{"key":"598_CR3","doi-asserted-by":"publisher","unstructured":"Bosman T, Frascaria D, Olver N, Sitters R, Stougie L (2019) Fixed-order scheduling on parallel machines. In: Integer Programming and Combinatorial Optimization. Springer International Publishing, Cham, pp 88\u2013100, https:\/\/doi.org\/10.1007\/978-3-030-17953-3_7","DOI":"10.1007\/978-3-030-17953-3_7"},{"key":"598_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105692","volume":"143","author":"V Cacchiani","year":"2022","unstructured":"Cacchiani V, Iori M, Locatelli A, Martello S (2022) Knapsack problems - an overview of recent advances. part i: Single knapsack problems. Computers & Operations Research 143:105692. https:\/\/doi.org\/10.1016\/j.cor.2021.105692","journal-title":"Computers & Operations Research"},{"key":"598_CR5","doi-asserted-by":"publisher","unstructured":"Cacchiani V, Iori M, Locatelli A, Martello S (2022b) Knapsack problems - an overview of recent advances. part i: Single knapsack problems. Computers & Operations Research 143:105692. https:\/\/doi.org\/10.1016\/j.cor.2021.105692","DOI":"10.1016\/j.cor.2021.105692"},{"key":"598_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.cosrev.2016.12.001","volume":"24","author":"HI Christensen","year":"2017","unstructured":"Christensen HI, Khan A, Pokutta S, Tetali P (2017) Approximation and online algorithms for multidimensional bin packing: A survey. Computer Science Review 24:63\u201379. https:\/\/doi.org\/10.1016\/j.cosrev.2016.12.001","journal-title":"Computer Science Review"},{"issue":"3","key":"598_CR7","doi-asserted-by":"publisher","first-page":"2027","DOI":"10.1016\/j.ifacol.2015.06.386","volume":"48","author":"W Ciscal-Terry","year":"2015","unstructured":"Ciscal-Terry W, Amico MD, Iori M (2015) Bin packing problem with general precedence constraints. IFAC-PapersOnLine 48(3):2027\u20132029. https:\/\/doi.org\/10.1016\/j.ifacol.2015.06.386","journal-title":"IFAC-PapersOnLine"},{"key":"598_CR8","doi-asserted-by":"publisher","unstructured":"Coffman EG, Galambos G, Martello S, Vigo D (1999) Bin Packing Approximation Algorithms: Combinatorial Analysis, Springer US, Boston, MA, pp 151\u2013207. https:\/\/doi.org\/10.1007\/978-1-4757-3023-4_3","DOI":"10.1007\/978-1-4757-3023-4_3"},{"key":"598_CR9","doi-asserted-by":"publisher","first-page":"1491","DOI":"10.2307\/23323714","volume":"60","author":"M Dell\u2019Amico","year":"2012","unstructured":"Dell\u2019Amico M, D\u00edaz D\u00edaz JC, Iori M (2012) Bin packing problem with general precedence constraints. Oper Res 60:1491\u20131504. https:\/\/doi.org\/10.2307\/23323714","journal-title":"Oper Res"},{"issue":"2","key":"598_CR10","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1287\/trsc.2013.0492","volume":"49","author":"M Dell\u2019Amico","year":"2014","unstructured":"Dell\u2019Amico M, Falavigna S, Iori M (2014) Optimization of a real-world auto-carrier transportation problem. Transp Sci 49(2):402\u2013419. https:\/\/doi.org\/10.1287\/trsc.2013.0492","journal-title":"Transp Sci"},{"issue":"11","key":"598_CR11","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.ipl.2009.02.003","volume":"109","author":"P Detti","year":"2009","unstructured":"Detti P (2009) A polynomial algorithm for the multiple knapsack problem with divisible item sizes. Inf Process Lett 109(11):582\u2013584. https:\/\/doi.org\/10.1016\/j.ipl.2009.02.003","journal-title":"Inf Process Lett"},{"issue":"1","key":"598_CR12","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.peva.2005.07.031","volume":"62","author":"H Feng","year":"2005","unstructured":"Feng H, Misra V, Rubenstein D (2005) Optimal state-free, size-aware dispatching for heterogeneous m\/g\/-type systems. Perform Eval 62(1):475\u2013492. https:\/\/doi.org\/10.1016\/j.peva.2005.07.031","journal-title":"Perform Eval"},{"issue":"4","key":"598_CR13","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/trsc.29.4.330","volume":"29","author":"TA Feo","year":"1995","unstructured":"Feo TA, Gonz\u00e1lez-Velarde JL (1995) The intermodal trailer assignment problem. Transp Sci 29(4):330\u2013341. https:\/\/doi.org\/10.1287\/trsc.29.4.330","journal-title":"Transp Sci"},{"key":"598_CR14","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). W. H. Freeman & Co., New York, NY, USA"},{"key":"598_CR15","doi-asserted-by":"publisher","unstructured":"Gharehgozli A, Roy D, Saini S, Ommeren JK (2022) loading and unloading trains at the landside of container terminals. Maritime Economics & Logistics 25. https:\/\/doi.org\/10.1057\/s41278-022-00219-9","DOI":"10.1057\/s41278-022-00219-9"},{"key":"598_CR16","doi-asserted-by":"publisher","unstructured":"Graham R, Lawler E, Lenstra J, Kan A (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Hammer P, Johnson E, Korte B (eds) Discrete Optimization II, Annals of Discrete Mathematics, vol\u00a05. Elsevier, p 287\u2013326, https:\/\/doi.org\/10.1016\/S0167-5060(08)70356-X","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"598_CR17","doi-asserted-by":"publisher","unstructured":"Heggen H, Braekers K, Caris A (2016) Optimizing train load planning: Review and decision support for train planners. pp 193\u2013208, https:\/\/doi.org\/10.1007\/978-3-319-44896-1_13","DOI":"10.1007\/978-3-319-44896-1_13"},{"key":"598_CR18","doi-asserted-by":"publisher","first-page":"232","DOI":"10.3846\/transport.2022.17066","volume":"37","author":"W Huang","year":"2022","unstructured":"Huang W, Shuai B (2022) An approach to solve motorail transportation loading layout optimization problem: the china case. Transport 37:232\u2013240. https:\/\/doi.org\/10.3846\/transport.2022.17066","journal-title":"Transport"},{"issue":"6","key":"598_CR19","doi-asserted-by":"publisher","first-page":"1696","DOI":"10.1287\/trsc.2022.0373","volume":"57","author":"C J\u00e4ck","year":"2023","unstructured":"J\u00e4ck C, G\u00f6nsch J, D\u00f6rmann Osuna H (2023) Load factor optimization for the auto carrier loading problem. Transp Sci 57(6):1696\u20131719. https:\/\/doi.org\/10.1287\/trsc.2022.0373","journal-title":"Transp Sci"},{"key":"598_CR20","doi-asserted-by":"publisher","unstructured":"J\u00e4ck C, G\u00f6nsch J, D\u00f6rmann\u00a0Osuna H (2023) Load factor optimization for the auto carrier loading problem. Transportation Science 57(6):1696\u20131719. https:\/\/doi.org\/10.1287\/trsc.2022.0373","DOI":"10.1287\/trsc.2022.0373"},{"key":"598_CR21","volume-title":"Integrated Optimization Models for Automobile Shipping","author":"SK Kirtonia","year":"2023","unstructured":"Kirtonia SK (2023) Integrated Optimization Models for Automobile Shipping. Florida State University, Tallahassee, Florida, USA"},{"key":"598_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/24725854.2023.2291469","volume":"57","author":"S Kirtonia","year":"2023","unstructured":"Kirtonia S, Sun Y, Chen ZL (2023) Selection of auto-carrier loading policy in automobile shipping. IISE Transactions 57:1\u201323. https:\/\/doi.org\/10.1080\/24725854.2023.2291469","journal-title":"IISE Transactions"},{"key":"598_CR23","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.cor.2016.04.006","volume":"73","author":"WY Ku","year":"2016","unstructured":"Ku WY, Beck J (2016) Mixed integer programming models for job shop scheduling: A computational analysis. Computers & Operations Research 73:165\u2013173. https:\/\/doi.org\/10.1016\/j.cor.2016.04.006","journal-title":"Computers & Operations Research"},{"key":"598_CR24","doi-asserted-by":"publisher","unstructured":"Lawler EL, Lenstra JK, Rinnooy Kan AH, Shmoys DB (1993) Chapter 9 sequencing and scheduling: Algorithms and complexity. In: Logistics of Production and Inventory, Handbooks in Operations Research and Management Science, vol\u00a04. Elsevier, p 445\u2013522, https:\/\/doi.org\/10.1016\/S0927-0507(05)80189-6","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"598_CR25","doi-asserted-by":"publisher","unstructured":"Lenstra J, Rinnooy Kan A (1980) Complexity results for scheduling chains on a single machine. Eur J Oper Res 4(4):270\u2013275. https:\/\/doi.org\/10.1016\/0377-2217(80)90111-3 combinational Optimization","DOI":"10.1016\/0377-2217(80)90111-3"},{"key":"598_CR26","doi-asserted-by":"publisher","unstructured":"Lutter P (2015) Optimized load planning for motorail transportation. Computers & Operations Research 68:63\u201374. https:\/\/doi.org\/10.1016\/j.cor.2015.10.003","DOI":"10.1016\/j.cor.2015.10.003"},{"key":"598_CR27","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.cor.2015.10.003","volume":"68","author":"P Lutter","year":"2015","unstructured":"Lutter P (2015) Optimized load planning for motorail transportation. Computers & Operations Research 68:63\u201374. https:\/\/doi.org\/10.1016\/j.cor.2015.10.003","journal-title":"Computers & Operations Research"},{"key":"598_CR28","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00291-014-0382-7","volume":"37","author":"P Lutter","year":"2014","unstructured":"Lutter P, Werners B (2014) Order acceptance for motorail transportation with uncertain parameters. OR Spectrum 37:431\u2013456. https:\/\/doi.org\/10.1007\/s00291-014-0382-7","journal-title":"OR Spectrum"},{"key":"598_CR29","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. John Wiley & Sons Inc, New York, NY, USA"},{"key":"598_CR30","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.trb.2022.05.012","volume":"162","author":"D Roy","year":"2022","unstructured":"Roy D, Ommeren JK, De Koster R, Gharehgozli A (2022) modeling landside container terminal queues: Exact analysis and approximations. Transportation Research Part B Methodological 162:73\u2013102. https:\/\/doi.org\/10.1016\/j.trb.2022.05.012","journal-title":"Transportation Research Part B Methodological"},{"key":"598_CR31","doi-asserted-by":"crossref","unstructured":"Samavati M, Essam D, Nehring M, Sarker R (2017) A methodology for the large-scale multi-period precedence-constrained knapsack problem: an application in the mining industry. International Journal of Production Economics 193:12\u201320. j.ijpe.2017.06.025","DOI":"10.1016\/j.ijpe.2017.06.025"},{"issue":"2","key":"598_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2021.102302","volume":"149","author":"Y Sun","year":"2021","unstructured":"Sun Y, Kirtonia S, Chen ZL (2021) A survey of finished vehicle distribution and related problems from an optimization perspective. Transportation Research Part E Logistics and Transportation Review 149(2):102302. https:\/\/doi.org\/10.1016\/j.tre.2021.102302","journal-title":"Transportation Research Part E Logistics and Transportation Review"},{"key":"598_CR33","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1287\/trsc.36.1.55.567","volume":"36","author":"R Tadei","year":"2002","unstructured":"Tadei R, Perboli G, Della Croce F (2002) A heuristic algorithm for the auto-carrier transportation problem. Transp Sci 36:55\u201362. https:\/\/doi.org\/10.1287\/trsc.36.1.55.567","journal-title":"Transp Sci"},{"key":"598_CR34","doi-asserted-by":"publisher","unstructured":"Upadhyay A (2020) improving intermodal train operations in indian railways. INFORMS Journal on Applied Analytics 50. https:\/\/doi.org\/10.1287\/inte.2020.1035","DOI":"10.1287\/inte.2020.1035"},{"key":"598_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tre.2017.08.010","volume":"107","author":"A Upadhyay","year":"2017","unstructured":"Upadhyay A, Gu W, Bolia N (2017) Optimal loading of double-stack container trains. Transportation Research Part E Logistics and Transportation Review 107:1\u201322. https:\/\/doi.org\/10.1016\/j.tre.2017.08.010","journal-title":"Transportation Research Part E Logistics and Transportation Review"},{"issue":"2","key":"598_CR36","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1016\/j.ejor.2006.10.031","volume":"183","author":"B You","year":"2007","unstructured":"You B, Yamada T (2007) A pegging approach to the precedence-constrained knapsack problem. Eur J Oper Res 183(2):618\u2013632. https:\/\/doi.org\/10.1016\/j.ejor.2006.10.031","journal-title":"Eur J Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-025-00598-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-025-00598-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-025-00598-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T18:03:35Z","timestamp":1765649015000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-025-00598-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,10]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["598"],"URL":"https:\/\/doi.org\/10.1007\/s10288-025-00598-8","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2025,9,10]]},"assertion":[{"value":"13 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author has no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}]}}