Ming-Kong Zhang

13 papers B 2Journal 3Unranked 8
YearRankTypeTitle / Venue / Authors
2021 J jnl
Finding all Pareto optimal paths by simulating ripple relay race in multi-objective networks.
Swarm Evol. Comput.
Xiao-Bing Hu, Sheng-Hao Gu, Chi Zhang, Gong-Peng Zhang, Ming-Kong Zhang, Mark S. Leeson
2020 J jnl
Finding the k shortest paths by ripple-spreading algorithms.
Eng. Appl. Artif. Intell.
Xiao-Bing Hu, Chi Zhang, Gong-Peng Zhang, Ming-Kong Zhang, Hang Li, Mark S. Leeson, Jian-Qin Liao
2019 J jnl
A benchmark test problem toolkit for multi-objective path optimization.
Swarm Evol. Comput.
Xiao-Bing Hu, Hailin Zhang, Chi Zhang, Ming-Kong Zhang, Hang Li, Mark S. Leeson
2018 — conf
Finding all Pareto Optimal Paths for Dynamical Multi-Objective Path optimization Problems.
SSCI
Xiao-Bing Hu, Hang Li, Jun Zhou, Ming-Kong Zhang, Jian-Qin Liao
2018 — conf
Finding the k Shortest Paths for Co-Evolutionary Path Optimization.
SSCI
Xiao-Bing Hu, Jun Zhou, Hang Li, Ming-Kong Zhang
2017 — conf
A ripple-spreading algorithm for calculating weighted betweenness in networks.
ICNC-FSKD
Xiao-Bing Hu, Ming-Kong Zhang, Jian-Qin Liao
2017 — conf
An approximate ripple-spreading algorithm to identify the k best paths.
ICNC-FSKD
Xiao-Bing Hu, Ming-Kong Zhang, Di Hu
2017 — conf
An approximate ripple-spreading algorithm with terminal h strategy.
SSCI
Xiao-Bing Hu, Ming-Kong Zhang, Jian-Qin Liao
2016 — conf
A new path optimization method in dynamic adverse weathers.
ICNC-FSKD
Ming-Kong Zhang, Xiao-Bing Hu, Jian-Qin Liao
2016 — conf
A ripple-spreading algorithm for network performance assessment.
SSCI
Xiao-Bing Hu, Ming-Kong Zhang, Jian-Qin Liao
2016 — conf
A ripple-spreading algorithm to calculate the k shortest paths in a network with time-windows.
ICNC-FSKD
Xiao-Bing Hu, Ming-Kong Zhang, Jian-Qin Liao, Hailin Zhang
2016 B conf
An effective method to find the k shortest paths in a generalized time-window network.
CEC
Xiao-Bing Hu, Ming-Kong Zhang, Jian-Qin Liao, Hailin Zhang
2016 B conf
Improving the computational efficiency of ripple-spreading algorithm for the k shortest paths problem.
CEC
Xiao-Bing Hu, Ming-Kong Zhang, Di Hu