{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T04:45:37Z","timestamp":1772253937880,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T00:00:00Z","timestamp":1648166400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T00:00:00Z","timestamp":1648166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1741197"],"award-info":[{"award-number":["IIS-1741197"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-13-2-0045"],"award-info":[{"award-number":["W911NF-13-2-0045"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72101046"],"award-info":[{"award-number":["72101046"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["DUT20RC(3)046"],"award-info":[{"award-number":["DUT20RC(3)046"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EPJ Data Sci."],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The maritime shipping network is the backbone of global trade. Data about the movement of cargo through this network comes in various forms, from ship-level Automatic Identification System (AIS) data, to aggregated bilateral trade volume statistics. Multiple network representations of the shipping system can be derived from any one data source, each of which has advantages and disadvantages. In this work, we examine data in the form of liner shipping service routes, a list of walks through the port-to-port network aggregated from individual shipping companies by a large shipping logistics database. This data is inherently sequential, in that each route represents a sequence of ports called upon by a cargo ship. Previous work has analyzed this data without taking full advantage of the sequential information. Our contribution is to develop a path-based methodology for analyzing liner shipping service route data, computing navigational trajectories through the network that both respect the directional information in the shipping routes and minimize the number of cargo transfers between routes, a desirable property in industry practice. We compare these paths with those computed using other network representations of the same data, finding that our approach results in paths that are longer in terms of both network and nautical distance. We further use these trajectories to re-analyze the role of a previously-identified structural core through the network, as well as to define and analyze a measure of betweenness centrality for nodes and edges.<\/jats:p>","DOI":"10.1140\/epjds\/s13688-022-00331-z","type":"journal-article","created":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T14:52:18Z","timestamp":1648219938000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A path-based approach to analyzing the global liner shipping network"],"prefix":"10.1140","volume":"11","author":[{"given":"Timothy","family":"LaRock","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8234-7910","authenticated-orcid":false,"given":"Mengqiao","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Tina","family":"Eliassi-Rad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,25]]},"reference":[{"issue":"10","key":"331_CR1","doi-asserted-by":"publisher","first-page":"2061","DOI":"10.1016\/j.physa.2008.12.016","volume":"388","author":"Y Hu","year":"2009","unstructured":"Hu Y, Zhu D (2009) Empirical analysis of the worldwide maritime transportation network. Phys A, Stat Mech Appl 388(10):2061\u20132071. https:\/\/doi.org\/10.1016\/j.physa.2008.12.016","journal-title":"Phys A, Stat Mech Appl"},{"issue":"48","key":"331_CR2","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1098\/rsif.2009.0495","volume":"7","author":"P Kaluza","year":"2010","unstructured":"Kaluza P, K\u00f6lzsch A, Gastner MT, Blasius B (2010) The complex network of global cargo ship movements. J R Soc Interface 7(48):1093\u20131103. https:\/\/doi.org\/10.1098\/rsif.2009.0495","journal-title":"J R Soc Interface"},{"issue":"1","key":"331_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1080\/03088830903461175","volume":"37","author":"C Ducruet","year":"2010","unstructured":"Ducruet C, Lee S-W, Ng AKY (2010) Centrality and vulnerability in liner shipping networks: revisiting the Northeast Asian port hierarchy. Marit Policy Manag 37(1):17\u201336. https:\/\/doi.org\/10.1080\/03088830903461175","journal-title":"Marit Policy Manag"},{"issue":"2","key":"331_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1080\/03088839.2011.650718","volume":"39","author":"C Ducruet","year":"2012","unstructured":"Ducruet C, Zaidi F (2012) Maritime constellations: a complex network approach to shipping and ports. Marit Policy Manag 39(2):151\u2013168. https:\/\/doi.org\/10.1080\/03088839.2011.650718","journal-title":"Marit Policy Manag"},{"issue":"3","key":"331_CR5","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1111\/j.1471-0374.2011.00355.x","volume":"12","author":"C Ducruet","year":"2012","unstructured":"Ducruet C, Notteboom T (2012) The worldwide maritime network of container shipping: spatial structure and regional dynamics. Glob Netw 12(3):395\u2013423. https:\/\/doi.org\/10.1111\/j.1471-0374.2011.00355.x","journal-title":"Glob Netw"},{"key":"331_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.jtrangeo.2013.03.004","volume":"30","author":"C Ducruet","year":"2013","unstructured":"Ducruet C (2013) Network diversity and maritime flows. J Transp Geogr 30:77\u201388. https:\/\/doi.org\/10.1016\/j.jtrangeo.2013.03.004","journal-title":"J Transp Geogr"},{"key":"331_CR7","doi-asserted-by":"publisher","first-page":"1699","DOI":"10.1145\/2623330.2623364","volume-title":"Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining","author":"J Xu","year":"2014","unstructured":"Xu J, Wickramarathne TL, Chawla NV, Grey EK, Steinhaeuser K, Keller RP, Drake JM, Lodge DM (2014) Improving management of aquatic invasions by integrating shipping network, ecological, and environmental data: data mining for social good. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1699\u20131708. https:\/\/doi.org\/10.1145\/2623330.2623364"},{"issue":"1","key":"331_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10708-014-9524-3","volume":"80","author":"Z Li","year":"2015","unstructured":"Li Z, Xu M, Shi Y (2015) Centrality in global shipping network basing on worldwide shipping areas. GeoJournal 80(1):47\u201360. https:\/\/doi.org\/10.1007\/s10708-014-9524-3","journal-title":"GeoJournal"},{"key":"331_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jtrangeo.2015.02.003","volume":"44","author":"M Xu","year":"2015","unstructured":"Xu M, Li Z, Shi Y, Zhang X, Jiang S (2015) Evolution of regional inequality in the global shipping network. J Transp Geogr 44:1\u201312. https:\/\/doi.org\/10.1016\/j.jtrangeo.2015.02.003","journal-title":"J Transp Geogr"},{"issue":"1","key":"331_CR10","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-018-35922-2","volume":"9","author":"S Kojaku","year":"2019","unstructured":"Kojaku S, Xu M, Xia H, Masuda N (2019) Multiscale core-periphery structure in a global liner shipping network. Sci Rep 9(1):404. https:\/\/doi.org\/10.1038\/s41598-018-35922-2","journal-title":"Sci Rep"},{"issue":"1","key":"331_CR11","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-16619-5","volume":"11","author":"M Xu","year":"2020","unstructured":"Xu M, Pan Q, Muscoloni A, Xia H, Cannistraci CV (2020) Modular gateway-ness connectivity and structural core organization in maritime network science. Nat Commun 11(1):2849. https:\/\/doi.org\/10.1038\/s41467-020-16619-5","journal-title":"Nat Commun"},{"issue":"1","key":"331_CR12","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-020-76602-4","volume":"10","author":"M Saebi","year":"2020","unstructured":"Saebi M, Xu J, Curasi SR, Grey EK, Chawla NV, Lodge DM (2020) Network analysis of ballast-mediated species transfer reveals important introduction and dispersal patterns in the Arctic. Sci Rep 10(1):19558. https:\/\/doi.org\/10.1038\/s41598-020-76602-4","journal-title":"Sci Rep"},{"issue":"1","key":"331_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tre.2012.06.009","volume":"49","author":"S Wang","year":"2013","unstructured":"Wang S, Meng Q, Sun Z (2013) Container routing in liner shipping. Transp Res, Part E, Logist Transp Rev 49(1):1\u20137. https:\/\/doi.org\/10.1016\/j.tre.2012.06.009","journal-title":"Transp Res, Part E, Logist Transp Rev"},{"issue":"3","key":"331_CR14","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1137\/20M1355896","volume":"63","author":"L Torres","year":"2021","unstructured":"Torres L, Blevins AS, Bassett D, Eliassi-Rad T (2021) The Why, How, and When of Representations for Complex Systems. SIAM Rev 63(3):435\u2013485. https:\/\/doi.org\/10.1137\/20M1355896","journal-title":"SIAM Rev"},{"issue":"3","key":"331_CR15","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnaa018","volume":"8","author":"PS Chodrow","year":"2020","unstructured":"Chodrow PS (2020) Configuration models of random hypergraphs. J Complex Netw 8(3):018. https:\/\/doi.org\/10.1093\/comnet\/cnaa018","journal-title":"J Complex Netw"},{"key":"331_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2020.05.004","volume":"874","author":"F Battiston","year":"2020","unstructured":"Battiston F, Cencetti G, Iacopini I, Latora V, Lucas M, Patania A, Young J-G, Petri G (2020) Networks beyond pairwise interactions: structure and dynamics. Phys Rep 874:1\u201392. 2006.01764. https:\/\/doi.org\/10.1016\/j.physrep.2020.05.004","journal-title":"Phys Rep"},{"key":"331_CR17","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1145\/3097983.3098145","volume-title":"Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining","author":"I Scholtes","year":"2017","unstructured":"Scholtes I (2017) When is a network a network?: multi-order graphical model selection in pathways and temporal networks. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, pp 1037\u20131046. https:\/\/doi.org\/10.1145\/3097983.3098145"},{"issue":"4","key":"331_CR18","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1038\/s41567-019-0459-y","volume":"15","author":"R Lambiotte","year":"2019","unstructured":"Lambiotte R, Rosvall M, Scholtes I (2019) From networks to optimal higher-order models of complex systems. Nat Phys 15(4):313\u2013320. https:\/\/doi.org\/10.1038\/s41567-019-0459-y","journal-title":"Nat Phys"},{"issue":"5","key":"331_CR19","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.1600028","volume":"2","author":"J Xu","year":"2016","unstructured":"Xu J, Wickramarathne TL, Chawla NV (2016) Representing higher-order dependencies in networks. Sci Adv 2(5):1600028. https:\/\/doi.org\/10.1126\/sciadv.1600028","journal-title":"Sci Adv"},{"issue":"2","key":"331_CR20","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1287\/trsc.2013.0471","volume":"48","author":"BD Brouer","year":"2014","unstructured":"Brouer BD, Alvarez JF, Plum CEM, Pisinger D, Sigurd MM (2014) A base integer programming model and benchmark suite for liner-shipping network design. Transp Sci 48(2):281\u2013312","journal-title":"Transp Sci"},{"issue":"2","key":"331_CR21","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1016\/j.ejor.2017.05.031","volume":"263","author":"A Balakrishnan","year":"2017","unstructured":"Balakrishnan A, Karsten CV (2017) Container shipping service selection and cargo routing with transshipment limits. Eur J Oper Res 263(2):652\u2013663","journal-title":"Eur J Oper Res"},{"key":"331_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trb.2021.07.002","volume":"151","author":"JG Jin","year":"2021","unstructured":"Jin JG, Meng Q, Wang H (2021) Feeder vessel routing and transshipment coordination at a congested hub port. Transp Res, Part B, Methodol 151:1\u201321. https:\/\/doi.org\/10.1016\/j.trb.2021.07.002","journal-title":"Transp Res, Part B, Methodol"},{"key":"331_CR23","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.trc.2018.09.012","volume":"96","author":"H Yang","year":"2018","unstructured":"Yang H, Ke J, Ye J (2018) A universal distribution law of network detour ratios. Transp Res, Part C, Emerg Technol 96:22\u201337. https:\/\/doi.org\/10.1016\/j.trc.2018.09.012","journal-title":"Transp Res, Part C, Emerg Technol"},{"issue":"10","key":"331_CR24","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008(10):10008. https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/P10008","journal-title":"J Stat Mech Theory Exp"},{"key":"331_CR25","volume-title":"Rank correlation methods","author":"MG Kendall","year":"1970","unstructured":"Kendall MG (1970) Rank correlation methods, 4th edn. Griffin, London","edition":"4"},{"key":"331_CR26","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","volume":"17","author":"P Virtanen","year":"2020","unstructured":"Virtanen P, Gommers R, Oliphant TE, Haberland M, Reddy T, Cournapeau D, Burovski E, Peterson P, Weckesser W, Bright J, van der Walt SJ, Brett M, Wilson J, Millman KJ, Mayorov N, Nelson ARJ, Jones E, Kern R, Larson E, Carey CJ, Polat \u0130, Feng Y, Moore EW, VanderPlas J, Laxalde D, Perktold J, Cimrman R, Henriksen I, Quintero EA, Harris CR, Archibald AM, Ribeiro AH, Pedregosa F, van Mulbregt P (eds) (2020) SciPy 1.0 contributors: SciPy 1.0: fundamental algorithms for scientific computing in python. Nat Methods 17:261\u2013272. https:\/\/doi.org\/10.1038\/s41592-019-0686-2","journal-title":"Nat Methods"},{"issue":"3","key":"331_CR27","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2016-60663-0","volume":"89","author":"I Scholtes","year":"2016","unstructured":"Scholtes I, Wider N, Garas A (2016) Higher-order aggregate networks in the analysis of temporal networks: path structures and centralities. Eur Phys J B 89(3):61. https:\/\/doi.org\/10.1140\/epjb\/e2016-60663-0","journal-title":"Eur Phys J B"},{"key":"331_CR28","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-68880-8_5","volume-title":"Algorithmic aspects in information and management","author":"C Barrett","year":"2008","unstructured":"Barrett C, Bisset K, Holzer M, Konjevod G, Marathe M, Wagner D (2008) Engineering label-constrained shortest-path algorithms. In: Fleischer R, Xu J (eds) Algorithmic aspects in information and management, vol 5034, pp 27\u201337. https:\/\/doi.org\/10.1007\/978-3-540-68880-8_5"},{"key":"331_CR29","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-15775-2_25","volume-title":"Algorithms \u2013 ESA","author":"H Bast","year":"2010","unstructured":"Bast H, Carlsson E, Eigenwillig A, Geisberger R, Harrelson C, Raychev V, Viger F (2010) Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns. In: Hutchison D, Kanade T, Kittler J, Kleinberg JM, Mattern F, Mitchell JC, Naor M, Nierstrasz O, Pandu Rangan C, Steffen B, Sudan M, Terzopoulos D, Tygar D, Vardi MY, Weikum G, de Berg M, Meyer U (eds) Algorithms \u2013 ESA, vol 2010, pp 290\u2013301. https:\/\/doi.org\/10.1007\/978-3-642-15775-2_25"},{"issue":"3","key":"331_CR30","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0965-8564(99)00056","volume":"35","author":"A Lozano","year":"2001","unstructured":"Lozano A, Storchi G (2001) Shortest viable path algorithm in multimodal networks. Transp Res, Part A, Policy Pract 35(3):225\u2013241. https:\/\/doi.org\/10.1016\/S0965-8564(99)00056","journal-title":"Transp Res, Part A, Policy Pract"},{"issue":"11","key":"331_CR31","doi-asserted-by":"publisher","DOI":"10.3390\/a13110269","volume":"13","author":"R Lewis","year":"2020","unstructured":"Lewis R (2020) Algorithms for Finding Shortest Paths in Networks with Vertex Transfer Penalties. Algorithms 13(11):269. https:\/\/doi.org\/10.3390\/a13110269","journal-title":"Algorithms"},{"key":"331_CR32","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-030-34960-8_32","volume-title":"Advances in optimization and decision science for society, services and enterprises","author":"D Ferone","year":"2019","unstructured":"Ferone D, Festa P, Pastore T (2019) The k-color shortest path problem. In: Paolucci M, Sciomachen A, Uberti P (eds) Advances in optimization and decision science for society, services and enterprises, vol 3. Springer, Cham, pp 367\u2013376. https:\/\/doi.org\/10.1007\/978-3-030-34960-8_32"},{"issue":"3","key":"331_CR33","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/s00224-016-9747-4","volume":"62","author":"K B\u00f6hmov\u00e1","year":"2018","unstructured":"B\u00f6hmov\u00e1 K, H\u00e4fliger L, Mihal\u00e1k M, Pr\u00f6ger T, Sacomoto G, Sagot M-F (2018) Computing and Listing st-Paths in Public Transportation Networks. Theory Comput Syst 62(3):600\u2013621. https:\/\/doi.org\/10.1007\/s00224-016-9747-4","journal-title":"Theory Comput Syst"},{"key":"331_CR34","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1137\/1.9781611976236.52","volume-title":"Proceedings of the 2020 SIAM international conference on data mining","author":"T LaRock","year":"2020","unstructured":"LaRock T, Nanumyan V, Scholtes I, Casiraghi G, Eliassi-Rad T, Schweitzer F (2020) Hypa: efficient detection of path anomalies in time series data on networks. In: Proceedings of the 2020 SIAM international conference on data mining, pp 460\u2013468. https:\/\/doi.org\/10.1137\/1.9781611976236.52"}],"container-title":["EPJ Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1140\/epjds\/s13688-022-00331-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1140\/epjds\/s13688-022-00331-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1140\/epjds\/s13688-022-00331-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T14:52:23Z","timestamp":1648219943000},"score":1,"resource":{"primary":{"URL":"https:\/\/epjdatascience.springeropen.com\/articles\/10.1140\/epjds\/s13688-022-00331-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,25]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["331"],"URL":"https:\/\/doi.org\/10.1140\/epjds\/s13688-022-00331-z","relation":{},"ISSN":["2193-1127"],"issn-type":[{"value":"2193-1127","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,25]]},"assertion":[{"value":"25 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"18"}}