TY - DATA
T1 - Dataset about Port Research
PY - 2021/04/01
AU - Zihui Yang
UR - https://data.4tu.nl/articles/dataset/Dataset_about_Port_Research/14298851/3
DO - 10.4121/14298851.v3
KW - Port
KW - Port Distance
KW - Port Shortest Path
KW - Port Shortest Path Value
KW - The number of ports is crossed by the shortest path
KW - Port Betweenness Centrality
KW - Total Group
N2 - <div>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.<br></div><div>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.<br></div><div>After get the Port Shortest Path, calculate the value of the shortest path between two ports, get the table Port Shortest Path Value.<br></div><div>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.<br></div><div>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.<br></div><div>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.<br></div><div><br></div>
ER -