Dataset about Port Research

Datacite citation style:
Yang, Zihui (2021): Dataset about Port Research. Version 2. 4TU.ResearchData. dataset.
Other citation styles (APA, Harvard, MLA, Vancouver, Chicago, IEEE) available at Datacite
choose version: version 3 - 2021-04-01 (latest)
version 2 - 2021-03-31
version 1 - 2021-03-29
Using the Floyd algorithm, the path between two ports in the port network graph is solved on the basis of the table Port Distance, there maybe multiple shortest paths between two ports, but this situation is not considered here, the only result will be the result of Python simulation, get the table Port Shortest Path.
After get the Port Shortest Path, calculate the value of the shortest path between two ports, get the table Port Shortest Path Value.
According to the shortest path between two ports, count the number of routes for each port, then use the K-Medoids, construting the model of strategic importance of ports, get the table Number of ports are crossed by the shortest path.

  • 2021-03-29 first online
  • 2021-03-31 published, posted
Shandong University, School of Management, Shandong, China
Changsha Normal University, Department of Economic Management, Hunan, China


files (6)