33 citations · 40 across the 9 of their papers we have counts for
9 papers
A Distribution Evolutionary Algorithm for the Graph Coloring Problem
Yongjian Xu, Huabin Cheng, Ning Xu +2
Graph coloring is a challenging combinatorial optimization problem with a wide range of applications. In this paper, a distribution evolutionary algorithm based on a population of…
Influence of Binomial Crossover on Approximation Error of Evolutionary Algorithms
Cong Wang, Jun He, Yu Chen +1
Although differential evolution (DE) algorithms perform well on a large variety of complicated optimization problems, only a few theoretical studies are focused on the working prin…
Exploitation and Exploration Analysis of Elitist Evolutionary Algorithms: A Case Study
Yu Chen, Jun He
Known as two cornerstones of problem solving by search, exploitation and exploration are extensively discussed for implementation and application of evolutionary algorithms (EAs).…
Identification of Interaction Clusters Using a Semi-supervised Hierarchical Clustering Method
Yu Chen, Yuanyuan Yang, Yaochu Jin +1
Motivation: Identifying interaction clusters of large gene regulatory networks (GRNs) is critical for its further investigation, while this task is very challenging, attributed to…
Error Analysis of Elitist Randomized Search Heuristics
Cong Wang, Yu Chen, Jun He +1
When globally optimal solutions of complicated optimization problems cannot be located by evolutionary algorithms (EAs) in polynomial expected running time, the hitting time/runnin…
A Theoretical Framework of Approximation Error Analysis of Evolutionary Algorithms
Jun He, Yu Chen, Yuren Zhou
In the empirical study of evolutionary algorithms, the solution quality is evaluated by either the fitness value or approximation error. The latter measures the fitness difference…