Kam-Fung Cheung

Kam-Fung Cheung

Auto-generated profile, based on publicly available information

Kam-Fung Cheung

The Chinese University of Hong Kong

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2020 in Transportation Research Part E: Logistics and Transportation Review
Verified
Journal Article
Closed access
KCKam-Fung Cheung
Kam-Fung Cheung
MBMichael G.H. Bell
Michael G.H. Bell
JPJing-Jing Pan
Jing-Jing Pan
SPSupun Perera
Supun Perera

1 June 2021 in European Journal of Operational Research
Verified
Journal Article
Closed access
KCKam-Fung Cheung
Kam-Fung Cheung
MBMichael G.H. Bell
Michael G.H. Bell

26 July 2019 in Maritime Policy & Management
Verified
Journal Article
Closed access
JPJing-Jing Pan
Jing-Jing Pan
MBMichael G. H. Bell
Michael G. H. Bell
KCKam-Fung Cheung
Kam-Fung Cheung
SPSupun Perera
Supun Perera
HYHang Yu
Hang Yu
Maritime shipping necessitates flexible and cost-effective port access worldwide through the global shipping network. This paper presents an efficient method to identify major port communities, and analyses the network connectivity of the global shipping network based on community structure. The global shipping network is represented by a signless Laplacian matrix which can be decomposed to generate its eigenvectors and corresponding eigenvalues. The largest gaps between the eigenvalues were then used to determine the optimal number of communities within the network. The eigenvalue decomposition method offers the advantage of detecting port communities without relying on a priori assumption about the number of communities and the size of each community. By applying this method to a dataset collected from seven world leading liner shipping companies, we found that the ports are clustered into three communities in the global container shipping network, which is consistent with the major container trade routes. The sparse linkages between port communities indicate where access is relatively poor.

4 September 2020 in Transportmetrica A: Transport Science
Verified
Journal Article
Closed access
HAHiroe Ando
Hiroe Ando
MBMichael Bell
Michael Bell
FKFumitaka Kurauchi
Fumitaka Kurauchi
KWK. I. Wong
K. I. Wong
KCKam-Fung Cheung
Kam-Fung Cheung
The methods to evaluate the robustness of a network have been extensively studied. Such methods often require obtaining traffic equilibrium conditions or solving mathematical problems, and these methods can only be applied to a network of limited size. On the other hand, nowadays detail road network data can be downloaded freely, and such data may provide different insights on network robustness evaluation. This paper applies the capacity-weighted eigenvector centrality method to identify the strongly and weakly connected parts of large networks. The eigenvector centrality is one of the evaluation methods based on network topology with a small computational load. This method can be applied to directed networks and does not require their adjacency matrices to be symmetric. Several numerical examples showed that the capacity-weighted eigenvector centrality analysis can identify the strongly and weakly connected parts of the network, and it can be used to evaluate connectivity of network for robustness.

1 February 2020 in Transportation Research Part B: Methodological
Verified
Journal Article
Closed access
MBMichael G.H. Bell
Michael G.H. Bell
JPJing-Jing Pan
Jing-Jing Pan
CTCollins Teye
Collins Teye
KCKam-Fung Cheung
Kam-Fung Cheung
SPSupun Perera
Supun Perera

1 October 2021 in European Journal of Operational Research
Verified
Journal Article
Closed access
KCKam-Fung Cheung
Kam-Fung Cheung
MBMichael G.H. Bell
Michael G.H. Bell