Wanliang Wang

Wanliang Wang


Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
2 July 2012 in Sensors
Verified
Journal Article
Open access
PDF file
HSHai-Yan Shi
Hai-Yan Shi
WWWanliang Wang
Wanliang Wang
NKNgaiming Kwok
Ngaiming Kwok
SCShengyong Chen
Shengyong Chen
Game theory (GT) is a mathematical method that describes the phenomenon of conflict and cooperation between intelligent rational decision-makers. In particular, the theory has been proven very useful in the design of wireless sensor networks (WSNs). This article surveys the recent developments and findings of GT, its applications in WSNs, and provides the community a general view of this vibrant research area. We first introduce the typical formulation of GT in the WSN application domain. The roles of GT are described that include routing protocol design, topology control, power control and energy saving, packet forwarding, data collection, spectrum allocation, bandwidth allocation, quality of service control, coverage optimization, WSN security, and other sensor management tasks. Then, three variations of game theory are described, namely, the cooperative, non-cooperative, and repeated schemes. Finally, existing problems and future trends are identified for researchers and engineers in the field.

29 April 2015 in Journal of Intelligent Manufacturing
Verified
Journal Article
Closed access
PDF file
JZJing Zhang
Jing Zhang
WWWanliang Wang
Wanliang Wang
XXXinli Xu
Xinli Xu

10 July 2019 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
ZZZelin Zang
Zelin Zang
WWWanliang Wang
Wanliang Wang
YSYuhang Song
Yuhang Song
LLLinyan Lu
Linyan Lu
WLWeikun Li
Weikun Li
YZYanwei Zhao
Yanwei Zhao
In this paper, a hybrid deep neural network scheduler (HDNNS) is proposed to solve job-shop scheduling problems (JSSPs). In order to mine the state information of schedule processing, a job-shop scheduling problem is divided into several classification-based subproblems. And a deep learning framework is used for solving these subproblems. HDNNS applies the convolution two-dimensional transformation method (CTDT) to transform irregular scheduling information into regular features so that the convolution operation of deep learning can be introduced into dealing with JSSP. The simulation experiments designed for testing HDNNS are in the context of JSSPs with different scales of machines and jobs as well as different time distributions for processing procedures. The results show that the MAKESPAN index of HDNNS is 9% better than that of HNN and the index is also 4% better than that of ANN in ZLP dataset. With the same neural network structure, the training time of the HDNNS method is obviously shorter than that of the DEEPRM method. In addition, the scheduler has an excellent generalization performance, which can address large-scale scheduling problems with only small-scale training data.

28 May 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
YWYule Wang
Yule Wang
WWWanliang Wang
Wanliang Wang
The knapsack problem is one of the most widely researched NP-complete combinatorial optimization problems and has numerous practical applications. This paper proposes a quantum-inspired differential evolution algorithm with grey wolf optimizer (QDGWO) to enhance the diversity and convergence performance and improve the performance in high-dimensional cases for 0-1 knapsack problems. The proposed algorithm adopts quantum computing principles such as quantum superposition states and quantum gates. It also uses adaptive mutation operations of differential evolution, crossover operations of differential evolution, and quantum observation to generate new solutions as trial individuals. Selection operations are used to determine the better solutions between the stored individuals and the trial individuals created by mutation and crossover operations. In the event that the trial individuals are worse than the current individuals, the adaptive grey wolf optimizer and quantum rotation gate are used to preserve the diversity of the population as well as speed up the search for the global optimal solution. The experimental results for 0-1 knapsack problems confirm the advantages of QDGWO with the effectiveness and global search capability for knapsack problems, especially for high-dimensional situations.

9 August 2012 in International Journal of Automation and Computing
Verified
Journal Article
Closed access
PDF file
GLGui-Sen Li
Gui-Sen Li
WWWanliang Wang
Wanliang Wang
XYXin-Wei Yao
Xin-Wei Yao

1 August 2017 in Applied Soft Computing
Verified
Journal Article
Closed access
SYSenliang Ying
Senliang Ying
LLLi Li
Li Li
ZWZheng Wang
Zheng Wang
WLWeikun Li
Weikun Li
WWWanliang Wang
Wanliang Wang