Learn More
Utilizing cumulative correlation information already existing in an evolutionary process, this paper proposes a predictive approach to the reproduction mechanism of new individuals for differential evolution (DE) algorithms. DE uses a distributed model (DM) to generate new individuals, which is relatively explorative, whilst evolution strategy (ES) uses a(More)
This paper studies the optimization problem of topological active net (TAN), which is often seen in image segmentation and shape modeling. A TAN is a topological structure containing many nodes, whose positions must be optimized while a predefined topology needs to be maintained. TAN optimization is often time-consuming and even constructing a single(More)
Crossover is a very important operation in current differential evolution (DE) algorithms. The existing crossover strategies in DE show promising effects especially when the algorithms are applied to separable functions. However, the operation fails to work well when applied to the ill-conditioned and inseparable problems because the recombination of good(More)
—The SET k-cover problem is an NP-complete combinatorial optimization problem, which is derived from constructing energy efficient wireless sensor networks (WSNs). The goal of the problem is to find a way to divide sensors into disjoint cover sets, with every cover set being able to fully cover an area and the number of cover sets maximized. Instead of(More)
In order to combine the advantages of distributed model (DM) and centralized model (CM) offspring generation models, this paper proposes to use the differential evolution (DE) algorithm as the base population reproduction method and enhance its DM scheme with one of the key CM features, which is the covariance matrix adaptation (CMA) used in CMA-ES. In this(More)
This paper will introduce a new differential evolution (DE) algorithm called DE/cluster. DE/cluster applies a simple hierarchical clustering model to mine the distribution information of the DE population every K generations to make a dynamic partition of the population. One special cluster formed by the single-individual clusters will use a slower(More)
  • 1