{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T17:54:32Z","timestamp":1773683672472,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,3,25]],"date-time":"2010-03-25T00:00:00Z","timestamp":1269475200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10489-010-0223-6","type":"journal-article","created":{"date-parts":[[2010,3,24]],"date-time":"2010-03-24T15:27:15Z","timestamp":1269444435000},"page":"529-541","source":"Crossref","is-referenced-by-count":70,"title":["An intermodal transport network planning algorithm using\u00a0dynamic programming\u2014A\u00a0case study: from\u00a0Busan\u00a0to\u00a0Rotterdam\u00a0in\u00a0intermodal freight routing"],"prefix":"10.1007","volume":"36","author":[{"given":"Jae Hyung","family":"Cho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyun Soo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyung Rim","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,3,25]]},"reference":[{"issue":"1","key":"223_CR1","first-page":"205","volume":"14","author":"C Barnhart","year":"1993","unstructured":"Barnhart C, Donald HR (1993) Modeling intermodal routing. J\u00a0Bus Logist 14(1):205\u2013223","journal-title":"J\u00a0Bus Logist"},{"issue":"6","key":"223_CR2","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0191-2607(91)90013-G","volume":"25","author":"H Min","year":"1991","unstructured":"Min H (1991) International intermodal choices via chance-constrained goal programming. Transp Res Part\u00a0A: Gen 25(6):351\u2013362","journal-title":"Transp Res Part\u00a0A: Gen"},{"issue":"1","key":"223_CR3","first-page":"579","volume":"8","author":"I Yu","year":"2004","unstructured":"Yu I, Kim J, Cho G, So S, Park Y (2004) Study on the evaluation standards to select third party logistics firms. J\u00a0Korea Inform Strategy Soc 8(1):579\u2013584","journal-title":"J\u00a0Korea Inform Strategy Soc"},{"issue":"1\u20132","key":"223_CR4","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0360-8352(97)00100-9","volume":"33","author":"BS Boardman","year":"1997","unstructured":"Boardman BS, Malstrom EM, Butler DP, Cole MH (1997) Computer-assisted routing of intermodal shipments. Comput Ind Eng 33(1\u20132):311\u2013314","journal-title":"Comput Ind Eng"},{"key":"223_CR5","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1016\/S0377-2217(03)00161-9","volume":"153","author":"C Macharis","year":"2004","unstructured":"Macharis C, Bontekoning YM (2004) Opportunities for OR in intermodal freight transport research: a review. Eur J Oper Res 153:400\u2013416","journal-title":"Eur J Oper Res"},{"key":"223_CR6","first-page":"75","volume":"45","author":"Y Jang","year":"2005","unstructured":"Jang Y, Kim E (2005) Study on the optimized model of intermodal transport using genetic algorithm. Shipping Logist Res 45:75\u201398","journal-title":"Shipping Logist Res"},{"key":"223_CR7","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"1","author":"EQV Martins","year":"1984","unstructured":"Martins EQV (1984) On a multicriteria shortest path problem. Eur J Oper Res 1:236\u2013245","journal-title":"Eur J Oper Res"},{"key":"223_CR8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0377-2217(02)00262-X","volume":"142","author":"A Pasquale","year":"2002","unstructured":"Pasquale A, Maurizio B, Antonio S (2002) A penalty function heuristic for the resource constrained shortest path problem. Eur J Oper Res 142:221\u2013230","journal-title":"Eur J Oper Res"},{"issue":"2","key":"223_CR9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0305-0548(90)90039-A","volume":"17","author":"YL Chen","year":"1990","unstructured":"Chen YL, Chin YH (1990) The quickest path problem. Comput Oper Res 17(2):153\u2013161","journal-title":"Comput Oper Res"},{"key":"223_CR10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/trsc.10.2.113","volume":"10","author":"MH Moore","year":"1976","unstructured":"Moore MH (1976) On the fastest route for convey-type traffic in flowrate-contrained networks. Transp Sci 10:113\u2013124","journal-title":"Transp Sci"},{"issue":"6","key":"223_CR11","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/0305-0548(91)90063-W","volume":"18","author":"JB Rosen","year":"1991","unstructured":"Rosen JB, Sun SZ, Xue GL (1991) Algorithm for the quickest path problem and the enumeration of quickest paths. Comput Oper Res 18(6):579\u2013584","journal-title":"Comput Oper Res"},{"key":"223_CR12","first-page":"191","volume":"26","author":"M Descrochers","year":"1988","unstructured":"Descrochers M, Soumis F (1988) A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR 26:191\u2013212","journal-title":"INFOR"},{"key":"223_CR13","series-title":"Lecture notes in economics and mathematical systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48318-9","volume-title":"Multiple attribute decision making: methods and applications","author":"CL Hwang","year":"1981","unstructured":"Hwang CL, Yoon KS (1981) Multiple attribute decision making: methods and applications. Lecture notes in economics and mathematical systems. Springer, Berlin"},{"key":"223_CR14","doi-asserted-by":"crossref","first-page":"2877","DOI":"10.1016\/j.cor.2006.12.025","volume":"35","author":"TS Chang","year":"2008","unstructured":"Chang TS (2008) Best routes selection in international intermodal networks. Comput Oper Res 35:2877\u20132891","journal-title":"Comput Oper Res"},{"key":"223_CR15","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.ejor.2007.10.057","volume":"193","author":"J Andersen","year":"2009","unstructured":"Andersen J, Crainic TG, Christiansen M (2009) Service network design with management and coordination of multiple fleets. Eur J Oper Res 193:377\u2013389","journal-title":"Eur J Oper Res"},{"key":"223_CR16","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/j.omega.2008.02.001","volume":"37","author":"M Caramia","year":"2009","unstructured":"Caramia M, Guerriero F (2009) A heuristic approach to long-haul freight transportation with multiple objective functions. Omega 37:600\u2013614","journal-title":"Omega"},{"key":"223_CR17","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1016\/S0377-2217(03)00161-9","volume":"153","author":"C Macharis","year":"2004","unstructured":"Macharis C, Bontekoning YM (2004) Opportunities for OR in intermodal freight transport research: a review. J\u00a0Oper Res 153:400\u2013416","journal-title":"J\u00a0Oper Res"},{"key":"223_CR18","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0968-090X(00)00004-8","volume":"8","author":"F Southworth","year":"2000","unstructured":"Southworth F, Peterson BE (2000) Intermodal and international freight network modeling. Transp Res Part\u00a0C 8:147\u2013166","journal-title":"Transp Res Part\u00a0C"},{"key":"223_CR19","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.ejor.2007.09.004","volume":"192","author":"KN Androutsopoulos","year":"2009","unstructured":"Androutsopoulos KN, Zografos KG (2009) Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network. J\u00a0Oper Res 192:18\u201328","journal-title":"J\u00a0Oper Res"},{"issue":"1","key":"223_CR20","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1111\/1475-3995.00003","volume":"8","author":"I Dumitrescu","year":"2001","unstructured":"Dumitrescu I, Boland N (2001) Algorithms for the weight constrained shortest path problem. Int Trans Oper Res 8(1):15\u201329","journal-title":"Int Trans Oper Res"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-010-0223-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-010-0223-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-010-0223-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:25:44Z","timestamp":1559139944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-010-0223-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,25]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["223"],"URL":"https:\/\/doi.org\/10.1007\/s10489-010-0223-6","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,25]]}}}