Xiaoli Wang

Prof. Xiaoli Wang

orcid

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
3 December 2014 in Soft Computing
Verified
Journal Article
Closed access
PDF file
XWXiaoli Wang
Xiaoli Wang
Yuping WangYuping Wang
Yuping Wang
YCYue Cui
Yue Cui

1 March 2013 in Applied Soft Computing
Verified
Journal Article
Closed access
RQRen Qing-Dao-Er-Ji
Ren Qing-Dao-Er-Ji
YWYuping Wang
Yuping Wang
XWXiaoli Wang
Xiaoli Wang

1 January 2012 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
XWXiaoli Wang
Xiaoli Wang
YWYuping Wang
Yuping Wang
HZHai Zhu
Hai Zhu
For the problem that the energy efficiency of the cloud computing data center is low, from the point of view of the energy efficiency of the servers, we propose a new energy‐efficient multi‐job scheduling model based on Google’s massive data processing framework. To solve this model, we design a practical encoding and decoding method for the individuals and construct an overall energy efficiency function of the servers as the fitness value of each individual. Meanwhile, in order to accelerate the convergent speed of our algorithm and enhance its searching ability, a local search operator is introduced. Finally, the experiments show that the proposed algorithm is effective and efficient.

23 December 2016 in Computational and Applied Mathematics
Verified
Journal Article
Closed access
PDF file
HLHongwei Lin
Hongwei Lin
YWYuping Wang
Yuping Wang
YGYuelin Gao
Yuelin Gao
XWXiaoli Wang
Xiaoli Wang

1 January 2013 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
XGXiaofang Guo
Xiaofang Guo
YWYuping Wang
Yuping Wang
XWXiaoli Wang
Xiaoli Wang
Many-objective optimization problems involving a large number (more than four) of objectives have attracted considerable attention from the evolutionary multiobjective optimization field recently. With the increasing number of objectives, many-objective optimization problems may lead to stagnation in search process, high computational cost, increased dimensionality of Pareto-optimal front, and difficult visualization of the objective space. In this paper, a special kind of many-objective problems which has redundant objectives and which can be degenerated to a lower dimensional Pareto-optimal front has been investigated. Different from the works in the previous literatures, a novel metric, interdependence coefficient, which represents the nonlinear relationship between pairs of objectives, is introduced in this paper. In order to remove redundant objectives, PAM clustering algorithm is employed to identify redundant objectives by merging the less conflict objectives into the same cluster, and one of the least conflict objectives is removed. Furthermore, the potential of the proposed algorithm is demonstrated by a set of benchmark test problems scaled up to 20 objectives and a practical engineering design problem.

1 December 2015
Verified
Conference Paper
Closed access
XGXiaofang Guo
Xiaofang Guo
XWXiaoli Wang
Xiaoli Wang
ZWZhen Wei
Zhen Wei
MOEA/D (multi-objective evolutionary algorithm based on decomposition) has become a promising evolution algorithm for many-objective optimization problems, and many scholars conduct their researches on how to generate weight vectors in improved MOEA/D. In order to generate uniform non-dominated solution set according to the geometric shape of the Pareto front, an adaptive weight vector design method combining generalized decomposition and uniform design is proposed, which will adjust the setting the weight vector dynamically. The results for two standard test functions show that the proposed algorithm has certain advantages in convergence and diversity compared with other related algorithms, such as MOEA/D and UMOEA/D.