{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:24:01Z","timestamp":1761294241348,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T00:00:00Z","timestamp":1609977600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T00:00:00Z","timestamp":1609977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Nature Science Foundation of China","doi-asserted-by":"crossref","award":["71572022","71971035"],"award-info":[{"award-number":["71572022","71971035"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s00500-020-05456-9","type":"journal-article","created":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T22:17:28Z","timestamp":1610057848000},"page":"4465-4487","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Integrated optimization of feeder routing and stowage planning for containerships"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1549-0359","authenticated-orcid":false,"given":"Mingjun","family":"Ji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingrui","family":"Kong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunxiao","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,7]]},"reference":[{"issue":"1","key":"5456_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"SA Alumur","year":"2008","unstructured":"Alumur SA, Kara BY (2008) Network hub location problems: the state of the art. Eur J Oper Res 190(1):1\u201321","journal-title":"Eur J Oper Res"},{"issue":"2\u20133","key":"5456_CR2","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10696-013-9185-4","volume":"27","author":"D Ambrosino","year":"2015","unstructured":"Ambrosino D, Paolucci M, Sciomachen A (2015) Experimental evaluation of mixed integer programming models for the multi-port master bay plan problem. Flex Serv Manuf J 27(2\u20133):263\u2013284","journal-title":"Flex Serv Manuf J"},{"issue":"7","key":"5456_CR3","doi-asserted-by":"publisher","first-page":"1753","DOI":"10.1007\/s00500-015-1879-y","volume":"21","author":"D Ambrosino","year":"2017","unstructured":"Ambrosino D, Paolucci M, Sciomachen A (2017) Computational evaluation of a mip model for multi-port stowage planning problems. Soft Comput 21(7):1753\u20131763","journal-title":"Soft Comput"},{"key":"5456_CR4","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0166-218X(99)00245-0","volume":"103","author":"M Avriel","year":"2000","unstructured":"Avriel M, Penn M, Shpirer N (2000) Container ship stowage problem: complexity and connection to the colouring of circle graphs. Discrete Appl Math 103:271\u2013279","journal-title":"Discrete Appl Math"},{"issue":"1","key":"5456_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/PL00013346","volume":"23","author":"J Dethloff","year":"2001","unstructured":"Dethloff J (2001) Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. Or Spektrum 23(1):79\u201396","journal-title":"Or Spektrum"},{"key":"5456_CR6","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.ejor.2007.06.064","volume":"195","author":"K Fleszar","year":"2009","unstructured":"Fleszar K, Osman I, Hindi KS (2009) A variable neighborhood search algorithm for the open vehicle routing problem. Eur J Oper Res 195:803\u2013809","journal-title":"Eur J Oper Res"},{"issue":"5","key":"5456_CR7","first-page":"580","volume":"9","author":"F Fontes","year":"2017","unstructured":"Fontes F, Goncalves G (2017) A new hub network design integrating deep sea and short sea services at liner shipping operations. Int J Ship Trans Log 9(5):580","journal-title":"Int J Ship Trans Log"},{"issue":"5","key":"5456_CR8","doi-asserted-by":"publisher","first-page":"3307","DOI":"10.1016\/j.apm.2012.07.017","volume":"37","author":"S Gelareh","year":"2013","unstructured":"Gelareh S, Maculan N, Mahey P, Monemi RN (2013) Hub-and-spoke network design and fleet deployment for string planning of liner shipping. Appl Math Model 37(5):3307\u20133321","journal-title":"Appl Math Model"},{"issue":"6","key":"5456_CR9","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1016\/j.tre.2011.03.002","volume":"47","author":"S Gelareh","year":"2011","unstructured":"Gelareh S, Pisinger D (2011) Fleet deployment, network design and hub location of liner shipping companies. Trans Res E-Log 47(6):947\u2013964","journal-title":"Trans Res E-Log"},{"key":"5456_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","volume":"5","author":"P Hansen","year":"1997","unstructured":"Hansen P, Mladenovic N (1997) Variable neighborhood search for the p-median. Locat Sci 5:207\u2013226","journal-title":"Locat Sci"},{"key":"5456_CR11","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen P, Mladenovic N, Perez JAM (2010) Variable neighborhood search: methods and applications. Ann Oper Res 175:367\u2013407","journal-title":"Ann Oper Res"},{"issue":"7\u20138","key":"5456_CR12","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1016\/j.mcm.2006.08.012","volume":"45","author":"CI Hsu","year":"2007","unstructured":"Hsu CI, Hsieh YP (2007) Routing, ship size, and sailing frequency decision-making for a maritime hub-and-spoke container network. Math Comput Model 45(7\u20138):899\u2013916","journal-title":"Math Comput Model"},{"issue":"5","key":"5456_CR13","first-page":"362","volume":"2","author":"MJ Ji","year":"2015","unstructured":"Ji MJ, Shen LX, Shi BS, Xue Y, Wang F (2015) Routing optimization for multi-type containerships in a hub-and-spoke network. J Traffic Transp Eng (Engl Ed) 2(5):362\u2013372","journal-title":"J Traffic Transp Eng (Engl Ed)"},{"key":"5456_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.endm.2014.11.037","volume":"47","author":"M Kammoun","year":"2015","unstructured":"Kammoun M, Derbel H, Ratli M, Jarboui B (2015) A variable neighborhood search for solving the multi-vehicle covering tour problem. Electron Notes Discrete Math 47:285\u2013292","journal-title":"Electron Notes Discrete Math"},{"issue":"1","key":"5456_CR15","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.tre.2008.05.001","volume":"45","author":"MG Karlaftis","year":"2009","unstructured":"Karlaftis MG, Kepaptsoglou K, Sambracos E (2009) Containership routing with time deadlines and simultaneous deliveries and pick-ups. Transp Res E-Log 45(1):210\u2013221","journal-title":"Transp Res E-Log"},{"issue":"3","key":"5456_CR16","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02125403","volume":"63","author":"JY Potvin","year":"1996","unstructured":"Potvin JY (1996) Genetic algorithms for the traveling salesman problem. Ann Oper Res 63(3):337\u2013370","journal-title":"Ann Oper Res"},{"issue":"2","key":"5456_CR17","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0377-2217(03)00030-4","volume":"152","author":"E Sambracos","year":"2004","unstructured":"Sambracos E, Paravantis JA, Tarantilis CD, Kiranoudis CT (2004) Dispatching of small containers via coastal freight lines: the case of the Aegean Sea. Eur J Oper Res 152(2):365\u2013381","journal-title":"Eur J Oper Res"},{"issue":"2","key":"5456_CR18","first-page":"71","volume":"20","author":"TD Suban","year":"2008","unstructured":"Suban TD, Twrdy E (2008) Decision support for optimal repositioning of containers in a feeder system. Promet -Traffic Transp 20(2):71\u201377","journal-title":"Promet -Traffic Transp"},{"issue":"11","key":"5456_CR19","doi-asserted-by":"publisher","first-page":"1248","DOI":"10.1057\/palgrave.jors.2601022","volume":"51","author":"ID Wilson","year":"2000","unstructured":"Wilson ID, Roach PA (2000) Container stowage planning: a methodology for generating computerised solutions. J Oper Res Soc 51(11):1248\u20131255","journal-title":"J Oper Res Soc"},{"key":"5456_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2018\/3450726","volume":"2018","author":"E Zhang","year":"2018","unstructured":"Zhang E, Mei QH, Liu M, Zheng FF (2018) Stowage planning in multiple ports with shifting fee minimization. Sci Program Sci Program 2018:1\u20139. https:\/\/doi.org\/10.1155\/2018\/3450726","journal-title":"Sci Program Sci Program"},{"issue":"5","key":"5456_CR21","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1017\/S0373463315000211","volume":"68","author":"XY Zhang","year":"2015","unstructured":"Zhang XY, Ji MJ, Yao S, Chen X (2015) Optimising feeder routing for container ships through an electronic chart display and information system. J Navig 68(5):848\u2013868","journal-title":"J Navig"},{"key":"5456_CR22","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.tre.2014.12.014","volume":"75","author":"J Zheng","year":"2015","unstructured":"Zheng J, Meng Q, Sun Z (2015) Liner hub-and-spoke shipping network design. Transp Res E-Log 75:32\u201348","journal-title":"Transp Res E-Log"},{"issue":"5","key":"5456_CR23","first-page":"59","volume":"14","author":"HL Zhu","year":"2014","unstructured":"Zhu HL, Ji MJ (2014) Optimal model and improved genetic algorithm of containership stowage on full route. J Traffic Transp Eng 14(5):59\u201367","journal-title":"J Traffic Transp Eng"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05456-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-020-05456-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05456-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,28]],"date-time":"2024-10-28T15:19:17Z","timestamp":1730128757000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-020-05456-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,7]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["5456"],"URL":"https:\/\/doi.org\/10.1007\/s00500-020-05456-9","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2021,1,7]]},"assertion":[{"value":"7 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"Lingrui Kong declares that she has no conflict of interest. Mingjun Ji declares that he has no conflict of interest. Yunxiao Guan declares that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}