Differential evolution

As explained in Optimization Algorithms: AI techniques for design, planning, and control problems

Differential evolution is a population-based optimization algorithm that creates trial solutions by combining vector differences among candidate solutions.

Differential evolution is a stochastic, nature-inspired evolutionary computing algorithm for search and optimization. It uses population-based candidate solutions and vector differences to create trial solutions. section 2.2 section 2.4

Use these distinctions to place differential evolution among optimization methods:

• Accepts randomness in parameters or decisions, so runs are not exactly repeatable and solution quality or runtime cannot be guaranteed. section 2.2
• Can avoid becoming trapped in local optima, although it may also miss an optimal solution. section 2.2
• Belongs to evolutionary computing, alongside genetic algorithms, genetic programming, evolutionary programming, and evolutionary strategies. section 2.4

Treasure-hunting analogy

Imagine a group searching an island for pirate treasure. Feasible areas represent the search space, the treasure represents an optimal solution, and the searchers represent search agents. Randomized exploration helps them avoid following one potentially misleading path. section 2.2

Figure 2.16 Deterministic vs. stochastic algorithms. Deterministic algorithms follow a set procedure, and the results are repeatable, while stochastic searches have elements of randomness built into the algorithms.

Compare repeatable deterministic procedures with stochastic searches that include randomness. section 2.2

How Optimization Algorithms: AI techniques for design, planning, and control problems covers it

How deep it goes

Classifies the algorithm and describes its inspiration, but defers its operational steps, parameters, heuristics, and implementation.

Examples

Uses a treasure-hunting search-space analogy and a deterministic-versus-stochastic comparison figure.

What you can do after

Evaluate differential evolution as a randomized optimization approach and explain its exploration benefits and reliability trade-offs.

How it connects

Connects differential evolution with stochastic optimization, evolutionary computing, genetic algorithms, and nature-inspired algorithms.

liveBookmanning.com

Read Optimization Algorithms: AI techniques for design, planning, and control problems on liveBook Get the book at manning.com

Also explained in

• 

  liveBookmanning.com
  Evolutionary Deep Learning: Genetic algorithms and neural networksDifferential evolution is a population-based evolutionary optimization algorithm that generates candidate solutions from scaled differences between existing solutions.

Compare how 2 books explain differential evolution →

Related concepts

• evolution strategycontrasts with · An evolution strategy is a population-based evolutionary optimization method that searches through stochastic variation, selection, and adaptation of strategy parameters.
• hyperparameter tuninguses · Hyperparameter tuning is the process of selecting or adjusting configurable model or procedure settings and evaluating them against a chosen objective.
• particle swarm optimizationcontrasts with · Particle swarm optimization is a population-based optimization method in which candidate solutions adjust their positions using individual and collective search information.
• populationuses · A population is a defined group or complete set of people, units, observations, or candidate solutions considered together in a particular context.

This explainer was generated by Manning's knowledge graph from the text of Optimization Algorithms: AI techniques for design, planning, and control problems. The section links point to the parts of the book it draws on.