A path-based approach to analyzing the global liner shipping network

被引:0
|
作者
Timothy LaRock
Mengqiao Xu
Tina Eliassi-Rad
机构
[1] Northeastern University,Network Science Institute
[2] Dalian University of Technology,School of Economics and Management
[3] Northeastern University,Khoury College of Computer Sciences
来源
关键词
Complex networks; Network representation; Sequential patterns; Path data; Maritime economics; Liner shipping;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
相关论文
共 50 条
  • [41] Show Me New Counterexamples: A Path-Based Approach
    Castillos, Kalou Cabrera
    Waeselynck, Helene
    Wiels, Virginie
    2015 IEEE 8TH INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION (ICST), 2015,
  • [42] Community structure based global hub location problem in liner shipping
    Zheng, Jianfeng
    Qi, Jingwen
    Sun, Zhuo
    Li, Feng
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2018, 118 : 1 - 19
  • [43] A Path-based Fuzzy Approach to Color Image Segmentation
    Chamorro-Martinez, Jesus
    Mengibar-Rodriguez, Miriam
    Manuel Martinez-Jimenez, Pedro
    IEEE CIS INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS 2021 (FUZZ-IEEE), 2021,
  • [44] Segment-based alteration for container liner shipping network design
    Wang, Shuaian
    Liu, Zhiyuan
    Meng, Qiang
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2015, 72 : 128 - 145
  • [45] Data-driven static and dynamic resilience assessment of the global liner shipping network
    Bai, Xiwen
    Ma, Zhongjun
    Zhou, Yaoming
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2023, 170
  • [46] A Minimal Path-Based Method for Computing Multistate Network Reliability
    Xu, Xiu-Zhen
    Niu, Yi-Feng
    He, Can
    COMPLEXITY, 2020, 2020
  • [47] Online Path-based Test Method for Network-on-Chip
    Zhan, Junkai
    Huang, Letian
    Wang, Junshi
    Ebrahimi, Masoumeh
    Li, Qiang
    2019 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2019,
  • [48] Integrated Liner Shipping Network Design and Scheduling
    Koza, David F.
    Desaulniers, Guy
    Ropke, Stefan
    TRANSPORTATION SCIENCE, 2020, 54 (02) : 512 - 533
  • [49] Methods for strategic liner shipping network design
    Mulder, Judith
    Dekker, Rommert
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 235 (02) : 367 - 377
  • [50] Time constrained liner shipping network design
    Karsten, Christian Vad
    Brouer, Berk Dangaard
    Desaulniers, Guy
    Pisinger, David
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2017, 105 : 152 - 162