Ming Yang

Ming Yang

Auto-generated profile, based on publicly available information

Ming Yang

China University of Geosciences, China

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
25 April 2017 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Open access
MOMohammad Nabi Omidvar
Mohammad Nabi Omidvar
MYMing Yang
Ming Yang
YMYi Mei
Yi Mei
XLXiaodong Li
Xiaodong Li
XYXin Yao
Xin Yao
Identification of variable interaction is essential for an efficient implementation of a divide-and-conquer algorithm for large-scale black-box optimization. In this paper, we propose an improved variant of the differential grouping (DG) algorithm, which has a better efficiency and grouping accuracy. The proposed algorithm, DG2, finds a reliable threshold value by estimating the magnitude of roundoff errors. With respect to efficiency, DG2 reuses the sample points that are generated for detecting interactions and saves up to half of the computational resources on fully separable functions. We mathematically show that the new sampling technique achieves the lower bound with respect to the number of function evaluations. Unlike its predecessor, DG2 checks all possible pairs of variables for interactions and has the capacity to identify overlapping components of an objective function. On the accuracy aspect, DG2 outperforms the state-of-the-art decomposition methods on the latest large-scale continuous optimization benchmark suites. DG2 also performs reliably in the presence of imbalance among contribution of components in an objective function. Another major advantage of DG2 is the automatic calculation of its threshold parameter ($\epsilon $ ), which makes it parameter-free. Finally, the experimental results show that when DG2 is used within a cooperative co-evolutionary framework, it can generate competitive results as compared to several state-of-the-art algorithms.

15 December 2016 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Open access
MYMing Yang
Ming Yang
MOMohammad Nabi Omidvar
Mohammad Nabi Omidvar
CLChanghe Li
Changhe Li
XLXiaodong Li
Xiaodong Li
ZCZhihua Cai
Zhihua Cai
XYXin Yao
Xin Yao
Cooperative co-evolution (CC) is an explicit means of problem decomposition in multipopulation evolutionary algorithms for solving large-scale optimization problems. For CC, subpopulations representing subcomponents of a large-scale optimization problem co-evolve, and are likely to have different contributions to the improvement of the best overall solution to the problem. Hence, it makes sense that more computational resources should be allocated to the subpopulations with greater contributions. In this paper, we study how to allocate computational resources in this context and subsequently propose a new CC framework named CCFR to efficiently allocate computational resources among the subpopulations according to their dynamic contributions to the improvement of the objective value of the best overall solution. Our experimental results suggest that CCFR can make efficient use of computational resources and is a highly competitive CCFR for solving large-scale optimization problems.

15 July 2020 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
MYMing Yang
Ming Yang
AiMin ZhouAiMin Zhou
AiMin Zhou
CLChanghe Li
Changhe Li
XYXin Yao
Xin Yao
Cooperative co-evolution (CC) is an efficient and practical evolutionary framework for solving large-scale optimization problems. The performance of CC is affected by the variable decomposition. An accurate variable decomposition can help to improve the performance of CC on solving an optimization problem. The variable grouping methods usually spend many computational resources obtaining an accurate variable decomposition. To reduce the computational cost on the decomposition, we propose an efficient recursive differential grouping (ERDG) method in this paper. By exploiting the historical information on examining the interrelationship between the variables of an optimization problem, ERDG is able to avoid examining some interrelationship and spend much less computation than other recursive differential grouping methods. Our experimental results and analysis suggest that ERDG is a competitive method for decomposing large-scale continuous problems and improves the performance of CC for solving the large-scale optimization problems.

1 February 2020 in Information Sciences
Verified
Journal Article
Closed access
MYMing Yang
Ming Yang
AiMin ZhouAiMin Zhou
AiMin Zhou
CLChanghe Li
Changhe Li
JGJing Guan
Jing Guan
XYXuesong Yan
Xuesong Yan


1 May 2018 in IEEE Transactions on Cybernetics
Verified
Journal Article
Open access
CLChanghe Li
Changhe Li
TNTrung Thanh Nguyen
Trung Thanh Nguyen
SZSanyou Zeng
Sanyou Zeng
MYMing Yang
Ming Yang
Min WuMin Wu
Min Wu
Many artificial benchmark problems have been proposed for different kinds of continuous optimization, e.g., global optimization, multimodal optimization, multiobjective optimization, dynamic optimization, and constrained optimization. However, there is no unified framework for constructing these types of problems and possible properties of many problems are not fully tunable. This will cause difficulties for researchers to analyze strengths and weaknesses of an algorithm. To address these issues, this paper proposes a simple and intuitive framework, which is able to construct different kinds of problems for continuous optimization. The framework utilizes the k-d tree to partition the search space and sets a certain number of simple functions in each subspace. The framework is implemented into global/multimodal optimization, dynamic single objective optimization, multiobjective optimization, and dynamic multiobjective optimization, respectively. Properties of the proposed framework are discussed and verified with traditional evolutionary algorithms.