4 research outputs found

    Differential evolution with an evolution path: a DEEP evolutionary algorithm

    Get PDF
    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 centralized model (CM) to generate offspring, which through adaptation retains a convergence momentum. This paper adopts a key feature in the CM of a covariance matrix adaptation ES, the cumulatively learned evolution path (EP), to formulate a new evolutionary algorithm (EA) framework, termed DEEP, standing for DE with an EP. Without mechanistically combining two CM and DM based algorithms together, the DEEP framework offers advantages of both a DM and a CM and hence substantially enhances performance. Under this architecture, a self-adaptation mechanism can be built inherently in a DEEP algorithm, easing the task of predetermining algorithm control parameters. Two DEEP variants are developed and illustrated in the paper. Experiments on the CEC'13 test suites and two practical problems demonstrate that the DEEP algorithms offer promising results, compared with the original DEs and other relevant state-of-the-art EAs

    Fast micro-differential evolution for topological active net optimization

    Get PDF
    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 solution is hard to do. Such a problem is usually approached by a ``best improvement local search'' (BILS) algorithm based on deterministic search (DS), which is inefficient because it spends too much efforts in nonpromising probing. In this paper, we propose the use of micro-differential evolution (DE) to replace DS in BILS for improved directional guidance. The resultant algorithm is termed deBILS. Its micro-population efficiently utilizes historical information for potentially promising search directions and hence improves efficiency in probing. Results show that deBILS can probe promising neighborhoods for each node of a TAN. Experimental tests verify that deBILS offers substantially higher search speed and solution quality not only than ordinary BILS, but also the genetic algorithm and scatter search algorithm

    Fast terminal sliding-mode finite-time tracking control with differential evolution optimization algorithm using integral chain differentiator in uncertain nonlinear systems

    Get PDF
    This paper presents a fast terminal sliding-mode tracking control for a class of uncertain nonlinear systems with unknown parameters and system states combined with time-varying disturbances. Fast terminal sliding-mode finite-time tracking systems based on differential evolution algorithms incorporate an integral chain differentiator (ICD) to feedback systems for the estimation of the unknown system states. The differential evolution optimization algorithm using ICD is also applied to a tracking controller, which provides unknown parametric estimation in the limitation of unknown system states for trajectory tracking. The ICD in the tracking systems strengthens the tracking controller robustness for the disturbances by filtering noises. As a powerful finite-time control effort, the fast terminal sliding-mode tracking control guarantees that all tracking errors rapidly converge to the origin. The effectiveness of the proposed approach is verified via simulations, and the results exhibit high-precision output tracking performance in uncertain nonlinear systems
    corecore