Dataset about Port Research
doi:10.4121/14298851.v3
The doi above is for this specific version of this dataset, which is currently the latest. Newer versions may be published in the future.
For a link that will always point to the latest version, please use
doi: 10.4121/14298851
doi: 10.4121/14298851
Datacite citation style:
Yang, Zihui (2021): Dataset about Port Research. Version 3. 4TU.ResearchData. dataset. https://doi.org/10.4121/14298851.v3
Other citation styles (APA, Harvard, MLA, Vancouver, Chicago, IEEE) available at Datacite
Dataset
CC0by
Zihui Yang
After detemining that there is no direct connection to the port in the network diagram, get the direct connection distance between ports through the port.sol.com.cn、SeaRates.com and McDistance shipping calculation tool. If there is a big difference between the three query data, the average value method is used for optimization, get the table Port Distance.
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 The number of ports is crossed by the shortest path.
According to the principle of the Betweenness Centrality model, the Betweenness Centrality of each port in the whole network is obtained by the table Port Shortest Path, and then use the K-Medoids, get the table Port Betweenness Centrality.
The values and contents of the table The number of ports is crossed by the shortest path and the table Betweenness Centrality Group are combined together to get the table Total Group to facilitate data search.
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 The number of ports is crossed by the shortest path.
According to the principle of the Betweenness Centrality model, the Betweenness Centrality of each port in the whole network is obtained by the table Port Shortest Path, and then use the K-Medoids, get the table Port Betweenness Centrality.
The values and contents of the table The number of ports is crossed by the shortest path and the table Betweenness Centrality Group are combined together to get the table Total Group to facilitate data search.
history
- 2021-03-29 first online
- 2021-04-01 published, posted
publisher
4TU.ResearchData
organizations
Shandong University, School of Management, Shandong, ChinaChangsha Normal University, Department of Economic Management, Hunan, China
DATA
files (6)
- 17,202 bytesMD5:
03cc26073deb942e5dfdc8672e16f8cdPort Betweenness Centrality.xlsx - 88,937 bytesMD5:
8251d8a1c444b719471b53f7424cd8cePort Distance.xlsx - 167,011 bytesMD5:
35e88488f7ca31c94209248899d7853dPort Shortest Path Value.xlsx - 290,104 bytesMD5:
8750391c5d87065eab434b3f0a148e26Port Shortest Path.xlsx - 17,213 bytesMD5:
a1afd16f609121e31d03178f6e30040dThe number of ports is crossed by the shortest path.xlsx - 17,893 bytesMD5:
adb12ea263736c2573261afa0988c931Total group.xlsx -
download all files (zip)
598,360 bytes unzipped
