Evolutionary Computing: 5. Evolutionary Strategies(2)

Resource: Introduction to Evolutionary Computing, A.E.Eliben


Outline

  1. recombination
  2. parent selection
  3. survivor selection
  4. self-adaptation

1. Recombination

1.1 Basic recombination

two parents --> one child

There are two recombination variants distinguished by the manner of recombining parent allels:

  • discrete recombination: one of the parent alleles is randomly chosen with equal chance for either parents.
  • intermediate recombination: the values of parent alleles are averaged.

Formally, given two parent vectors x and y, one child z is created, where

for all i ∈ {1,...,n}.

1.2 An extension

An extension of this scheme allows the use of more than two recombinants, because the two parents x and y are drawn randomly for each position i ∈ {1,...,n} in the offspring anew.

These drawings take the whole population of μ individuals into consideration, and the result is a recombination operator with possibly more than two individuals contributing to the offspring.

The exact number of parents, however, cannot be defined in advance. This multiparent variant is called global recombination. To make terminology unambiguous, the original variant is called local recombination.

2. Parent Selection

3. Survivor Selection

4. Self-adaptation

5. Example application

时间: 2024-09-29 05:11:17

Evolutionary Computing: 5. Evolutionary Strategies(2)的相关文章

Evolutionary Computing: 5. Evolutionary Strategies

resource: Evolutionary computing, A.E.Eiben 1. What is Evolution Strategies (ES) Evolution strategies(ES) is another member of the evolutionary algorithm family. ES technical summary tableau 2. Introductory Example 2.1 Task minimimise f : Rn -> R 2.2

4. Review ——Evolutionary Computing

Resource:<Introduction to Evolutionary Computing> 1. What is an evolutionary algorithm? There are many different variants of evolutionary algorithms. The common underlying behind all these techniques is the same: given a population of individuals wi

Evolutionary Computing: multi-objective optimisation

1. What is multi-objective optimisation [wikipedia]: Multi-objective optimization (also known as multi-objective programming, vector optimization, multicriteria optimization,multiattribute optimization or Pareto optimization) is an area of multiple c

科技文献检索

The Fundamentals of Three-Phase Power Measurements Application Note Introduction Although single-phase electricity is used to supply common domestic and office electrical appliances, three-phase alternating current (a.c.) systems are almost universal

科研常用优化代码软件介绍

Free and Open Source software Name License Brief info ADMB BSD nonlinear optimization framework, using automatic differentiation ALGENCAN GPL Fortran code for general nonlinear programming. Interfaces with AMPL, C/C++, CUTEr, Matlab, Python, Octave a

牛人(周志华)推荐的人工智能网站

AI URLs (maintained by Zhi-Hua Zhou) 北京大学视觉与听觉信息处理实验室 北京邮电大学模式识别与智能系统学科 复旦大学智能信息处理开放实验室 IEEE Computer Society北京映象站点 计算机科学论坛 机器人足球赛 模式识别国家重点实验室 南京航空航天大学模式识别与神经计算实验室 - PARNEC 南京大学机器学习与数据挖掘研究所 - LAMDA 南京大学人工智能实验室 南京大学软件新技术国家重点实验室 人工生命之园 数据挖掘研究院 微软亚洲研究院

[Z] 计算机类会议期刊根据引用数排名

一位cornell的教授做的计算机类期刊会议依据Microsoft Research引用数的排名 link:http://www.cs.cornell.edu/andru/csconf.html The following are the journals and conferences in computer science that have published at least 100 papers (2003–2013), with at least 5 citations per pa

paper 15 :整理的CV代码合集

这篇blog,原来是西弗吉利亚大学的Li xin整理的,CV代码相当的全,不知道要经过多长时间的积累才会有这么丰富的资源,在此谢谢LI Xin .我现在分享给大家,希望可以共同进步!还有,我需要说一下,不管你的理论有多么漂亮,不管你有多聪明,如果没有实验来证明,那么都是错误的.  OK~本博文未经允许,禁止转载哦!  By  wei shen Reproducible Research in Computational Science “It doesn't matter how beautif

利用百度地图API和群蚁算法,对TSP问题进行模拟与求解

前言 最近由于换了工作,期间也有反思和总结上家公司的得失,总觉得有什么事情当初可以完成或者完成得更好,其中TSP问题就是其中之一.当初在开发一个仓配系统的时候,有一个线路排程的需求,当时自己简单在纸上画了思路,发现求精确解算法复杂度是N!,所以去百度,发现了NPC问题的概念,但是一直以来都没有对这个问题好好研究过,最终只是选择了贪心算法这一求近似解的方案,正好这是我的第一篇博客,就拿这个“遗憾”开刀吧. 1.  利用百度地图API模拟TSP的各个城市点 1.1. 调用百度地图API解析经纬度 这