Chenglong Xiao

Prof. Dr. Chenglong Xiao


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
2 September 2023 in The Journal of Engineering
Verified
Journal Article
Open access
JWJiaying Wang
Jiaying Wang
CXChenglong Xiao
Chenglong Xiao
SWShanshan Wang
Shanshan Wang
YRYaqi Ruan
Yaqi Ruan
Travelling salesman problem (TSP) is one of the most famous problems in graph theory, as well as one of the typical nondeterministic polynomial time (NP)‐hard problems in combinatorial optimization. Reinforcement learning (RL) has been widely regarded as an effective tool for solving combinatorial optimization problems. This paper attempts to solve the TSP problem using different reinforcement learning algorithms and evaluated the performance of three RL algorithms (Q‐Learning, SARSA, and Double Q‐Learning) under different reward functions, ε‐greedy decay strategies, and running times. A comprehensive analysis and comparison of the three algorithms mentioned above were conducted in the experiment. First, the experimental results indicate that the Double Q‐Learning algorithm is the best algorithm. Among the eight TSP instances, the Double Q‐Learning algorithm outperforms the other two algorithms in five instances. Additionally, it has shorter runtimes compared to the SARSA algorithm and similar runtimes to the Q‐Learning algorithm across all instances. Second, upon analysing the results, it was found that using the reward strategy contributes to obtaining the best results for all algorithms. Among the 24 combinations of 3 algorithms and 8 instances, 17 combinations achieved the best results when the reward strategy was set to .

2 May 2011
Verified
Conference Paper
Open access
PDF file
CXChenglong Xiao
Chenglong Xiao
ECEmmanuel Casseau
Emmanuel Casseau

5 October 2024 in Integration
Verified
Journal Article
Closed access
YYYuan Yao
Yuan Yao
HHHuiliang Hong
Huiliang Hong
SWShanshan Wang
Shanshan Wang
CXChenglong Xiao
Chenglong Xiao

26 July 2023 in The Journal of Engineering
Verified
Journal Article
Open access
CXChenglong Xiao
Chenglong Xiao
YWYajie Wang
Yajie Wang
SWShanshan Wang
Shanshan Wang
The Local Fitness Method (LFM) and Speaker‐Listener Label Propagation (SLPA) algorithms are widely used to detect overlapping communities in complex networks. The main problem with these two algorithms is that they are extremely sensitive to the setting of the hyperparameters. Previous methods set the hyperparameters of LFM or SLPA based on either empirical values or random choices, resulting in a large amount of computation for adjusting those parameters. To solve this problem, in this paper, a machine‐learning‐based approach is proposed to automatically set the hyperparameters of these two algorithms. Experimental results show that compared with the manual method, automatically setting the hyperparameter using machine learning models can lead to higher‐quality divisions. Furthermore, in comparison to the well‐known hyperparameter tuning method using Bayesian Optimization, the proposed predictive model‐based approach can find suitable para meters for LFM and SLPA much faster, while achieving competitive results in terms of division quality.

1 May 2017 in Journal of Systems Architecture
Verified
Journal Article
Closed access
CXChenglong Xiao
Chenglong Xiao
SWShanshan Wang
Shanshan Wang
WLWanjun Liu
Wanjun Liu
ECEmmanuel Casseau
Emmanuel Casseau

1 January 2021 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
CXChenglong Xiao
Chenglong Xiao
SWShanshan Wang
Shanshan Wang
WLWanjun Liu
Wanjun Liu
XWXinlin Wang
Xinlin Wang
ECEmmanuel Casseau
Emmanuel Casseau