Yuping Wang

Prof. Dr. Yuping Wang

School of Computer Science and Technology, Xidian University, Xi'an 710071, China
orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
1 January 2014 in Integrated Computer-Aided Engineering
Verified
Journal Article
Closed access
PDF file
LJLiping Jia
Liping Jia
Yuping WangYuping Wang
Yuping Wang
LFLei Fan
Lei Fan
Currently, the production-distribution planning problems are usually modeled as single-objective bilevel programming problems. However, many real world production-distribution planning problems involve several objectives simultaneously for decision m

6 April 2020 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
HLHaiyan Liu
Haiyan Liu
Yuping WangYuping Wang
Yuping Wang
NFNinglei Fan
Ninglei Fan
Many real world problems contain a large number of decision variables which can be modeled as large scale global optimization (LSGO) problems. One effective way to solve an LSGO problem is to decompose it into smaller sub-problems to solve. The existing works mainly focused on designing methods to decompose separable problems, while seldom focused on the decomposition of non-separable large scale problems. Also, the existing decomposition methods only learn the interaction (correlation or interdependence) among variables to make the decomposition. In this paper, we make the decomposition deeper: we not only consider the variable interaction, but also take the essentialness of the variable into account to form a deep grouping method. To do this, we first design an essential/trivial variable detection scheme to support the deep decomposition for both separable problems and non-separable problems. Based on it, we propose a new decomposition method called deep grouping method. Then, we design a new differential evolution (DE) algorithm with a new mutation strategy. By integrating all these, we propose a hybrid deep grouping (HDG) algorithm. Finally, the experiments are conducted on the widely used and most challenging LSGO benchmark suites, and the comparison results of the proposed algorithm with the state-of-the-art algorithms indicate the proposed algorithm is more effective.

31 January 2022 in Knowledge-Based Systems
Verified
Journal Article
Closed access
JRJinjun Ren
Jinjun Ren
Yuping WangYuping Wang
Yuping Wang
MMMingqian Mao
Mingqian Mao
YCYiu-ming Cheung
Yiu-ming Cheung

10 September 2018 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
LCLei Chen
Lei Chen
HLHai-Lin Liu
Hai-Lin Liu
KTKay Chen Tan
Kay Chen Tan
YCYiu-ming Cheung
Yiu-ming Cheung
Yuping WangYuping Wang
Yuping Wang
Decomposition-based evolutionary algorithms have shown great potential in many-objective optimization. However, the lack of theoretical studies on decomposition methods has hindered their further development and application. In this paper, we first theoretically prove that weight sum, Tchebycheff, and penalty boundary intersection decomposition methods are essentially interconnected. Inspired by this, we further show that highly customized dominance relationship can be derived from decomposition for any given decomposition vector. A new evolutionary algorithm is then proposed by applying the customized dominance relationship with adaptive strategy to each subpopulation of multiobjective to multiobjective framework. Experiments are conducted to compare the proposed algorithm with five state-of-the-art decomposition-based evolutionary algorithms on a set of well-known scaled many-objective test problems with 5 to 15 objectives. Simulation results have shown that the proposed algorithm can make better use of the decomposition vectors to achieve better performance. Further investigations on unscaled many-objective test problems verify the robust and generality of the proposed algorithm.

1 December 2018 in Evolutionary Computation
Verified
Journal Article
Closed access
Yuping WangYuping Wang
Yuping Wang
HLHaiyan Liu
Haiyan Liu
FWFei Wei
Fei Wei
TZTingting Zong
Tingting Zong
XLXiaodong Li
Xiaodong Li
For a large-scale global optimization (LSGO) problem, divide-and-conquer is usually considered an effective strategy to decompose the problem into smaller subproblems, each of which can then be solved individually. Among these decomposition methods, variable grouping is shown to be promising in recent years. Existing variable grouping methods usually assume the problem to be black-box (i.e., assuming that an analytical model of the objective function is unknown), and they attempt to learn appropriate variable grouping that would allow for a better decomposition of the problem. In such cases, these variable grouping methods do not make a direct use of the formula of the objective function. However, it can be argued that many real-world problems are white-box problems, that is, the formulas of objective functions are often known a priori. These formulas of the objective functions provide rich information which can then be used to design an effective variable group method. In this article, a formula-based grouping strategy (FBG) for white-box problems is first proposed. It groups variables directly via the formula of an objective function which usually consists of a finite number of operations (i.e., four arithmetic operations “ ”, “ ”, “ ”, “ ” and composite operations of basic elementary functions). In FBG, the operations are classified into two classes: one resulting in nonseparable variables, and the other resulting in separable variables. In FBG, variables can be automatically grouped into a suitable number of non-interacting subcomponents, with variables in each subcomponent being interdependent. FBG can easily be applied to any white-box problem and can be integrated into a cooperative coevolution framework. Based on FBG, a novel cooperative coevolution algorithm with formula-based variable grouping (so-called CCF) is proposed in this article for decomposing a large-scale white-box problem into several smaller subproblems and optimizing them respectively. To further enhance the efficiency of CCF, a new local search scheme is designed to improve the solution quality. To verify the efficiency of CCF, experiments are conducted on the standard LSGO benchmark suites of CEC'2008, CEC'2010, CEC'2013, and a real-world problem. Our results suggest that the performance of CCF is very competitive when compared with those of the state-of-the-art LSGO algorithms. For a large-scale global optimization (LSGO) problem, divide-and-conquer is usually considered an effective strategy to decompose the problem into smaller subproblems, each of which can then be solved individually. Among these decomposition methods, variable grouping is shown to be promising in recent years. Existing variable grouping methods usually assume the problem to be black-box (i.e., assuming that an analytical model of the objective function is unknown), and they attempt to learn appropriate variable grouping that would allow for a better decomposition of the problem. In such cases, these variable grouping methods do not make a direct use of the formula of the objective function. However, it can be argued that many real-world problems are white-box problems, that is, the formulas of objective functions are often known a priori. These formulas of the objective functions provide rich information which can then be used to design an effective variable group method. In this article, a formula-based grouping strategy (FBG) for white-box problems is first proposed. It groups variables directly via the formula of an objective function which usually consists of a finite number of operations (i.e., four arithmetic operations “ ”, “ ”, “ ”, “ ” and composite operations of basic elementary functions). In FBG, the operations are classified into two classes: one resulting in nonseparable variables, and the other resulting in separable variables. In FBG, variables can be automatically grouped into a suitable number of non-interacting subcomponents, with variables in each subcomponent being interdependent. FBG can easily be applied to any white-box problem and can be integrated into a cooperative coevolution framework. Based on FBG, a novel cooperative coevolution algorithm with formula-based variable grouping (so-called CCF) is proposed in this article for decomposing a large-scale white-box problem into several smaller subproblems and optimizing them respectively. To further enhance the efficiency of CCF, a new local search scheme is designed to improve the solution quality. To verify the efficiency of CCF, experiments are conducted on the standard LSGO benchmark suites of CEC'2008, CEC'2010, CEC'2013, and a real-world problem. Our results suggest that the performance of CCF is very competitive when compared with those of the state-of-the-art LSGO algorithms.

22 January 2014 in Journal of Optimization Theory and Applications
Verified
Journal Article
Closed access
PDF file
FWFei Wei
Fei Wei
Yuping WangYuping Wang
Yuping Wang
HLHongwei Lin
Hongwei Lin