Xiaofang Guo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Xiaofang Guo has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
Xiaoli Wang
School of Computer Science and Technology, Xidian University, South Taibai Road, Xi’an, Shaanxi, P. R. China
2 shared publications- Xiaoli Wang
School of Computer Science and Technology, Xidian University, Xian, China
2 shared publications Yuping Wang
Xidian University
2 shared publications- Zhen Wei
School of Computer Science and Information Engineering, Hefei University of Technology, Hefei, China
1 shared publication
Latest Publications
- Open Access
- 6 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 72825-72838
A Survey of Decomposition Based Evolutionary Algorithms for Many-Objective Optimization Problems
The framework of decomposition-based multi-objective evolutionary algorithms(MOEA/D) has evolved for more than ten years, and it has become irreplaceable tool for solving multi-objective optimization problems. In recent years, many scholars have investigated improved strategies from different directions. This paper gives a systematic comparison of six different components for decomposition-based algorithms, including framework analysis, weight vector generation scheme, aggregation evaluation function construction, reproduction operator, individual selection and update strategy, and the characteristics and application scope of various algorithms are also analyzed in detail in the survey. Different from previous survey on decomposition-based multi-objective evolutionary algorithms, a more detailed classification and experimental comparison are elaborated in the proposed paper.
- 6 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 72825-72838
Open AccessA Survey of Decomposition Based Evolutionary Algorithms for Many-Objective Optimization Problems
The framework of decomposition-based multi-objective evolutionary algorithms(MOEA/D) has evolved for more than ten years, and it has become irreplaceable tool for solving multi-objective optimization problems. In recent years, many scholars have investigated improved strategies from different directions. This paper gives a systematic comparison of six different components for decomposition-based algorithms, including framework analysis, weight vector generation scheme, aggregation evaluation function construction, reproduction operator, individual selection and update strategy, and the characteristics and application scope of various algorithms are also analyzed in detail in the survey. Different from previous survey on decomposition-based multi-objective evolutionary algorithms, a more detailed classification and experimental comparison are elaborated in the proposed paper.
- 24 September 2019
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
- Vol. 34 (06)
A Novel Objective Grouping Evolutionary Algorithm for Many-Objective Optimization Problems
The thorniest difficulties for multi-objective evolutionary algorithms (MOEAs) handling many-objective optimization problems (MaOPs) are the inefficiency of selection operators and high computational cost. To alleviate such difficulties and simplify the MaOPs, objective reduction algorithms have been proposed to remove the redundant objectives during the search process. However, those algorithms can only be applicable to specific problems with redundant objectives. Worse still, the Pareto solutions obtained by reduced objective set may not be the Pareto solutions of the original MaOPs. In this paper, we present a novel objective grouping evolutionary algorithm (OGEA) for general MaOPs. First, by dividing original objective set into several overlapping lower-dimensional subsets in terms of interdependence correlation information, we aim to separate the MaOPs into a number of sub-problems so that each of them can be able to preserve as much dominance structure in the original objective set as possible. Subsequently, we employ the nondominated sorting genetic algorithm II (NSGA-II) to generate Pareto solutions. Besides, instead of nondominated sorting on the whole population, a novel dual selection mechanism is proposed to choose individuals either having high ranks in subspaces or locating sparse region in the objective space for better proximity and diversity. Finally, we compare the proposed strategy with the other two classical space partition methods on benchmark DTLZ5 (I, M), DTLZ2 and a practical engineering problem. Numerical results show the proposed objective grouping algorithm can preserve more dominance structure in original objective set and achieve better quality of Pareto solutions.
- 24 September 2019
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
- Vol. 34 (06)
A Novel Objective Grouping Evolutionary Algorithm for Many-Objective Optimization Problems
The thorniest difficulties for multi-objective evolutionary algorithms (MOEAs) handling many-objective optimization problems (MaOPs) are the inefficiency of selection operators and high computational cost. To alleviate such difficulties and simplify the MaOPs, objective reduction algorithms have been proposed to remove the redundant objectives during the search process. However, those algorithms can only be applicable to specific problems with redundant objectives. Worse still, the Pareto solutions obtained by reduced objective set may not be the Pareto solutions of the original MaOPs. In this paper, we present a novel objective grouping evolutionary algorithm (OGEA) for general MaOPs. First, by dividing original objective set into several overlapping lower-dimensional subsets in terms of interdependence correlation information, we aim to separate the MaOPs into a number of sub-problems so that each of them can be able to preserve as much dominance structure in the original objective set as possible. Subsequently, we employ the nondominated sorting genetic algorithm II (NSGA-II) to generate Pareto solutions. Besides, instead of nondominated sorting on the whole population, a novel dual selection mechanism is proposed to choose individuals either having high ranks in subspaces or locating sparse region in the objective space for better proximity and diversity. Finally, we compare the proposed strategy with the other two classical space partition methods on benchmark DTLZ5 (I, M), DTLZ2 and a practical engineering problem. Numerical results show the proposed objective grouping algorithm can preserve more dominance structure in original objective set and achieve better quality of Pareto solutions.
- 18 July 2017
- Published by Springer Nature
- p. 242-249
A New Decomposition Many-Objective Evolutionary Algorithm Based on - Efficiency Order Dominance
- 18 July 2017
- Published by Springer Nature
- p. 242-249
A New Decomposition Many-Objective Evolutionary Algorithm Based on - Efficiency Order Dominance
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 291-294
MOEA/D with Adaptive Weight Vector Design
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.
- 1 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 291-294
MOEA/D with Adaptive Weight Vector Design
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.
- 18 July 2015
- Published by Springer Nature in Soft Computing
- Vol. 20 (12) , 4881-4895
An objective reduction algorithm using representative Pareto solution search for many-objective optimization problems
- 18 July 2015
- Published by Springer Nature in Soft Computing
- Vol. 20 (12) , 4881-4895
An objective reduction algorithm using representative Pareto solution search for many-objective optimization problems
- Open Access
- 1 January 2013
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2013, 1-12
Using Objective Clustering for Solving Many-Objective Optimization Problems
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 January 2013
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2013, 1-12
Open AccessUsing Objective Clustering for Solving Many-Objective Optimization Problems
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.