Zhao Chunliang

Dr. Zhao Chunliang


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
29 May 2024 in Knowledge-Based Systems
Verified
Journal Article
Open access
YHYuanyuan Hao
Yuanyuan Hao
ZCZhao Chunliang
Zhao Chunliang
YZYiqin Zhang
Yiqin Zhang
YCYuanze Cao
Yuanze Cao
ZLZhong Li
Zhong Li

3 December 2024 in International Journal of Bifurcation and Chaos
Verified
Journal Article
Closed access
YZYiqin Zhang
Yiqin Zhang
JLJingqi Lu
Jingqi Lu
ZCZhao Chunliang
Zhao Chunliang
ZLZhong Li
Zhong Li
JYJun Yan
Jun Yan

9 January 2024 in Knowledge-Based Systems
Verified
Journal Article
Closed access
YHYuanyuan Hao
Yuanyuan Hao
ZCZhao Chunliang
Zhao Chunliang
ZLZhong Li
Zhong Li
BSBingfeng Si
Bingfeng Si
HUHerwig Unger
Herwig Unger

30 August 2022 in Swarm and Evolutionary Computation
Verified
Journal Article
Closed access
ZCZhao Chunliang
Zhao Chunliang
YZYuren Zhou
Yuren Zhou
YHYuanyuan Hao
Yuanyuan Hao

15 April 2022 in Transportation Research Record: Journal of the Transportation Research Board
Verified
Journal Article
Closed access
YHYuanyuan Hao
Yuanyuan Hao
SBSi Bingfeng
Si Bingfeng
ZCZhao Chunliang
Zhao Chunliang
In urban rail transit systems, passenger flow assignment is vital for administrators and designers. Many approaches using evaluation indicators seek to improve assignment accuracy. However, such approaches suffer from the inefficiency in traffic flow computation, especially in large-scale networks. K-shortest path searching is an essential component in flow assignment; its complexity depends on the network scale. This study proposes a simplified framework with a bi-layer network (BL-NSF) to find the K-shortest path as early as possible to improve the speed of flow assignment while meeting accuracy requirements. First, a bi-layer transformation operator is developed. Specifically, a first-layer transformation operator employs the station extraction function to simplify the type of stations. The network is, therefore, first reduced since non-transfer stations are extracted. Second, a second-layer transformation operator with a path filter function is designed to eliminate the non-effective connection structure. Thus, the complexity of the network is further reduced, and the streamline structure of the topology rail network is constructed. Sequentially, we search the K-shortest path by executing four designed matching mechanisms and a modified Yen’s algorithm, a traditional algorithm used in the existing transit system. After that, we perform passenger flow calculations for stations, links, and lines. Finally, a series of experiments is run on the test network to verify the effectiveness and efficiency of BL-NSF on the flow assignment. The results demonstrate that the proposed BL-NSF performs better and is more competitive than the state-of-the-art algorithms.

11 March 2022 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
ZCZhao Chunliang
Zhao Chunliang
YZYuren Zhou
Yuren Zhou
YHYuanyuan Hao
Yuanyuan Hao
GZGuangyu Zhang
Guangyu Zhang