2,443
个编辑
更改
跳到导航
跳到搜索
第4行：
第4行： − In [[computer science]], '''evolutionary computation''' is a family of [[algorithm]]s for [[global optimization]] inspired by [[biological evolution]], and the subfield of [[artificial intelligence]] and [[soft computing]] studying these algorithms. In technical terms, they are a family of population-based [[trial and error]] problem solvers with a [[metaheuristic]] or [[stochastic optimization]] character.+ − In computer science, evolutionary computation is a family of algorithms for global optimization inspired by biological evolution, and the subfield of artificial intelligence and soft computing studying these algorithms. In technical terms, they are a family of population-based trial and error problem solvers with a metaheuristic or stochastic optimization character. − − 在计算机科学中，<font color="#ff8000"> 演化计算 Evolutionary computation</font>是一个受生物演化启发的全局优化算法家族，这些算法的研究属于人工智能和软计算的子领域。在技术术语上，它们是一类基于群体的试错型问题求解器，具有元启发式或随机优化特性。 − − − In evolutionary computation, an initial set of candidate solutions is generated and iteratively updated. Each new generation is produced by stochastically removing less desired solutions, and introducing small random changes. In biological terminology, a [[population]] of solutions is subjected to [[natural selection]] (or [[artificial selection]]) and [[mutation]]. As a result, the population will gradually [[evolution|evolve]] to increase in [[fitness (biology)|fitness]], in this case the chosen [[fitness function]] of the algorithm. − − In evolutionary computation, an initial set of candidate solutions is generated and iteratively updated. Each new generation is produced by stochastically removing less desired solutions, and introducing small random changes. In biological terminology, a population of solutions is subjected to natural selection (or artificial selection) and mutation. As a result, the population will gradually evolve to increase in fitness, in this case the chosen fitness function of the algorithm. − − − Evolutionary computation techniques can produce highly optimized solutions in a wide range of problem settings, making them popular in [[computer science]]. Many variants and extensions exist, suited to more specific families of problems and data structures. Evolutionary computation is also sometimes used in [[evolutionary biology]] as an ''in silico'' experimental procedure to study common aspects of general evolutionary processes. − − Evolutionary computation techniques can produce highly optimized solutions in a wide range of problem settings, making them popular in computer science. Many variants and extensions exist, suited to more specific families of problems and data structures. Evolutionary computation is also sometimes used in evolutionary biology as an in silico experimental procedure to study common aspects of general evolutionary processes. 第29行：
第16行： − The use of evolutionary principles for automated problem solving originated in the 1950s. It was not until the 1960s that three distinct interpretations of this idea started to be developed in three different places. − − The use of evolutionary principles for automated problem solving originated in the 1950s. It was not until the 1960s that three distinct interpretations of this idea started to be developed in three different places. − + − − − − ''[[Evolutionary programming]]'' was introduced by [[Lawrence J. Fogel]] in the US, while [[John Henry Holland]] called his method a ''[[genetic algorithm]]''. In Germany [[Ingo Rechenberg]] and [[Hans-Paul Schwefel]] introduced ''[[Evolution strategy|evolution strategies]]''. These areas developed separately for about 15 years. From the early nineties on they are unified as different representatives ("dialects") of one technology, called ''evolutionary computing''. Also in the early nineties, a fourth stream following the general ideas had emerged – ''[[genetic programming]]''. Since the 1990s, nature-inspired algorithms are becoming an increasingly significant part of the evolutionary computation. − − Evolutionary programming was introduced by Lawrence J. Fogel in the US, while John Henry Holland called his method a genetic algorithm. In Germany Ingo Rechenberg and Hans-Paul Schwefel introduced evolution strategies. These areas developed separately for about 15 years. From the early nineties on they are unified as different representatives ("dialects") of one technology, called evolutionary computing. Also in the early nineties, a fourth stream following the general ideas had emerged – genetic programming. Since the 1990s, nature-inspired algorithms are becoming an increasingly significant part of the evolutionary computation. − − − − − − − − These terminologies denote the field of evolutionary computing and consider evolutionary programming, evolution strategies, genetic algorithms, and genetic programming as sub-areas. − − These terminologies denote the field of evolutionary computing and consider evolutionary programming, evolution strategies, genetic algorithms, and genetic programming as sub-areas. − − − − − − Simulations of [[evolution]] using [[evolutionary algorithm]]s and [[artificial life]] started with the work of Nils Aall Barricelli in the 1960s, and was extended by [[Alex Fraser (scientist)|Alex Fraser]], who published a series of papers on simulation of [[artificial selection]].<ref>{{cite journal |author=Fraser AS |title=Monte Carlo analyses of genetic models |journal=Nature |volume=181 |issue=4603 |pages=208–9 |year=1958 |pmid=13504138 |doi=10.1038/181208a0 |ref=harv|bibcode=1958Natur.181..208F }}</ref> [[Evolutionary algorithm|Artificial evolution]] became a widely recognised optimisation method as a result of the work of [[Ingo Rechenberg]] in the 1960s and early 1970s, who used [[Evolution strategy|evolution strategies]] to solve complex engineering problems.<ref>{{cite book |last=Rechenberg |first=Ingo |year=1973 |title=Evolutionsstrategie – Optimierung technischer Systeme nach Prinzipien der biologischen Evolution (PhD thesis) |publisher=Fromman-Holzboog|language = German}}</ref> [[Genetic algorithm]]s in particular became popular through the writing of [[John Henry Holland|John Holland]].<ref>{{cite book |last=Holland |first=John H. |year=1975 |title=Adaptation in Natural and Artificial Systems |publisher=[[University of Michigan Press]] |isbn=978-0-262-58111-0 |url-access=registration |url=https://archive.org/details/adaptationinnatu00holl }}</ref> As academic interest grew, dramatic increases in the power of computers allowed practical applications, including the automatic evolution of computer programs.<ref>{{cite book |last=Koza|first=John R. |year=1992 |title=Genetic Programming: On the Programming of Computers by Means of Natural Selection|publisher=[[MIT Press]] |isbn=978-0-262-11170-6}}</ref> Evolutionary algorithms are now used to solve multi-dimensional problems more efficiently than software produced by human designers, and also to optimise the design of systems.<ref>G. C. Onwubolu and B V Babu, {{cite book|url=https://www.springer.com/in/book/9783540201670|title=New Optimization Techniques in Engineering|accessdate=17 September 2016|isbn=9783540201670|last1=Onwubolu|first1=Godfrey C.|last2=Babu|first2=B. V.|date=2004-01-21}}</ref><ref>{{cite journal |author=Jamshidi M |title=Tools for intelligent control: fuzzy controllers, neural networks and genetic algorithms |journal=[[Philosophical Transactions of the Royal Society A]] |volume=361 |issue=1809 |pages=1781–808 |year=2003 |pmid=12952685 |doi=10.1098/rsta.2003.1225 |ref=harv|bibcode=2003RSPTA.361.1781J }}</ref> − − Simulations of evolution using evolutionary algorithms and artificial life started with the work of Nils Aall Barricelli in the 1960s, and was extended by Alex Fraser, who published a series of papers on simulation of artificial selection. Artificial evolution became a widely recognised optimisation method as a result of the work of Ingo Rechenberg in the 1960s and early 1970s, who used evolution strategies to solve complex engineering problems. Genetic algorithms in particular became popular through the writing of John Holland. As academic interest grew, dramatic increases in the power of computers allowed practical applications, including the automatic evolution of computer programs. Evolutionary algorithms are now used to solve multi-dimensional problems more efficiently than software produced by human designers, and also to optimise the design of systems. 第72行：
第32行： − Evolutionary computing techniques mostly involve [[metaheuristic]] [[Mathematical optimization|optimization]] [[algorithm]]s. Broadly speaking, the field includes: − Evolutionary computing techniques mostly involve metaheuristic optimization algorithms. Broadly speaking, the field includes: 第108行：
第66行： − {{Main|演化算法_Evolutionary_Algorithms}} − − [[Evolutionary algorithms]] form a subset of evolutionary computation in that they generally only involve techniques implementing mechanisms inspired by [[biological evolution]] such as [[reproduction]], [[mutation]], [[Genetic recombination|recombination]], [[natural selection]] and [[survival of the fittest]]. [[Candidate solutions]] to the optimization problem play the role of individuals in a population, and the [[Loss function|cost function]] determines the environment within which the solutions "live" (see also [[fitness function]]). [[Evolution]] of the population then takes place after the repeated application of the above operators. − − Evolutionary algorithms form a subset of evolutionary computation in that they generally only involve techniques implementing mechanisms inspired by biological evolution such as reproduction, mutation, recombination, natural selection and survival of the fittest. Candidate solutions to the optimization problem play the role of individuals in a population, and the cost function determines the environment within which the solutions "live" (see also fitness function). Evolution of the population then takes place after the repeated application of the above operators. 第121行：
第74行： − − − In this process, there are two main forces that form the basis of evolutionary systems: '''Recombination''' '''mutation''' and '''crossover''' create the necessary diversity and thereby facilitate novelty, while '''selection''' acts as a force increasing quality. − − In this process, there are two main forces that form the basis of evolutionary systems: Recombination mutation and crossover create the necessary diversity and thereby facilitate novelty, while selection acts as a force increasing quality. − − − − Many aspects of such an evolutionary process are [[stochastic]]. Changed pieces of information due to recombination and mutation are randomly chosen. On the other hand, selection operators can be either deterministic, or stochastic. In the latter case, individuals with a higher [[Fitness function|fitness]] have a higher chance to be selected than individuals with a lower [[Fitness function|fitness]], but typically even the weak individuals have a chance to become a parent or to survive. − − Many aspects of such an evolutionary process are stochastic. Changed pieces of information due to recombination and mutation are randomly chosen. On the other hand, selection operators can be either deterministic, or stochastic. In the latter case, individuals with a higher fitness have a higher chance to be selected than individuals with a lower fitness, but typically even the weak individuals have a chance to become a parent or to survive. 第145行：
第87行： − {{Main|Evolutionary algorithm}} − − [[Genetic algorithms]] deliver methods to model [[biological systems]] and [[systems biology]] that are linked to the theory of [[dynamical systems]], since they are used to predict the future states of the system. This is just a vivid (but perhaps misleading) way of drawing attention to the orderly, well-controlled and highly structured character of development in biology. − − Genetic algorithms deliver methods to model biological systems and systems biology that are linked to the theory of dynamical systems, since they are used to predict the future states of the system. This is just a vivid (but perhaps misleading) way of drawing attention to the orderly, well-controlled and highly structured character of development in biology. − − 遗传算法提供了与动力系统理论相关的生物系统和系统生物学模型的方法，因为它们可以被用来预测系统的未来状态。这是一种生动的(但也许是误导性的)方式，提醒人们注意生物学发展的有序、控制良好和高度结构化的特征。 − − − − − − However, the use of algorithms and informatics, in particular of [[computational theory]], beyond the analogy to dynamical systems, is also relevant to understand evolution itself. − − However, the use of algorithms and informatics, in particular of computational theory, beyond the analogy to dynamical systems, is also relevant to understand evolution itself. − − 然而，算法和信息学的使用，特别是计算理论的使用，超越了对动力系统的类比，这也与理解演化本身有关。 + + − This view has the merit of recognizing that there is no central control of development; organisms develop as a result of local interactions within and between cells. The most promising ideas about program-development parallels seem to us to be ones that point to an apparently close analogy between processes within cells, and the low-level operation of modern computers.<ref>{{Cite book | chapter-url=https://plato.stanford.edu/entries/information-biological/#InfEvo | title=The Stanford Encyclopedia of Philosophy| chapter=Biological Information| publisher=Metaphysics Research Lab, Stanford University| year=2016}}</ref> Thus, biological systems are like computational machines that process input information to compute next states, such that biological systems are closer to a computation than classical dynamical system.<ref>{{cite journal |author= J.G. Diaz Ochoa |title= Elastic Multi-scale Mechanisms: Computation and Biological Evolution |journal=[[Journal of Molecular Evolution]] |volume=86 |issue=1 |pages=47–57 |year=2018 |pmid=29248946 |doi=10.1007/s00239-017-9823-7 |ref=harv|bibcode=2018JMolE..86...47D }}</ref> − This view has the merit of recognizing that there is no central control of development; organisms develop as a result of local interactions within and between cells. The most promising ideas about program-development parallels seem to us to be ones that point to an apparently close analogy between processes within cells, and the low-level operation of modern computers. Thus, biological systems are like computational machines that process input information to compute next states, such that biological systems are closer to a computation than classical dynamical system. − + + + + − + − Furthermore, following concepts from [[computational theory]], micro processes in biological organisms are fundamentally incomplete and undecidable ([[completeness (logic)]]), implying that “there is more than a crude metaphor behind the analogy between cells and computers.<ref>{{cite journal |author= A. Danchin |title= Bacteria as computers making computers |journal=[[FEMS Microbiol. Rev.]] |volume=33 |issue=1 |pages=3–26 |year=2008 |doi=10.1111/j.1574-6976.2008.00137.x |pmid= 19016882 |ref=harv |pmc=2704931 }}</ref> − − Furthermore, following concepts from computational theory, micro processes in biological organisms are fundamentally incomplete and undecidable (completeness (logic)), implying that “there is more than a crude metaphor behind the analogy between cells and computers. − − 此外，根据计算理论的概念，生物有机体中的微进程从根本上来说是不完整的和不可判定的 ，这意味着细胞和计算机之间的类比不只仅仅只是一个粗略的比喻。 − − − The analogy to computation extends also to the relationship between [[inheritance systems]] and biological structure, which is often thought to reveal one of the most pressing problems in explaining the origins of life. − − The analogy to computation extends also to the relationship between inheritance systems and biological structure, which is often thought to reveal one of the most pressing problems in explaining the origins of life. − − 计算的类比也延伸到遗传系统和生物结构之间的关系，这通常被认为是揭示解释生命起源最紧迫的问题之一。 − − − − ''Evolutionary automata''{{r|ldr11|ldr13|ldr14}}, a generalization of ''Evolutionary Turing machines''{{r|ldr15|ldr16}}, have been introduced in order to investigate more precisely properties of biological and evolutionary computation. In particular, they allow to obtain new results on expressiveness of evolutionary computation{{r|ldr14|ldr17}}. This confirms the initial result about undecidability of natural evolution and evolutionary algorithms and processes. ''Evolutionary finite automata'', the simplest subclass of Evolutionary automata working in ''terminal mode'' can accept arbitrary languages over a given alphabet, including non-recursively enumerable (e.g., diagonalization language) and recursively enumerable but not recursive languages (e.g., language of the universal Turing machine){{r|ldr18}}. − − Evolutionary automata, a generalization of Evolutionary Turing machines, have been introduced in order to investigate more precisely properties of biological and evolutionary computation. In particular, they allow to obtain new results on expressiveness of evolutionary computation. This confirms the initial result about undecidability of natural evolution and evolutionary algorithms and processes. Evolutionary finite automata, the simplest subclass of Evolutionary automata working in terminal mode can accept arbitrary languages over a given alphabet, including non-recursively enumerable (e.g., diagonalization language) and recursively enumerable but not recursive languages (e.g., language of the universal Turing machine). − − 演化自动机是演化图灵机<font color="#ff8000"> 图灵机Turing machines</font>的一种推。人们引入了这一概念来更精确地研究生物和演化计算的性质。特别是，他们在演化计算的表现力上获得新的成果。这证实了关于自然演化和演化算法及过程不可判定性的初步结果。演化有限自动机是演化自动机中最简单的子类，在终端模式下可以接受给定字母表上的任意语言，包括非递归的可枚举语言(例如，对角化语言)和递归的可枚举但不递归语言(例如，通用图灵机语言)。 第207行：
第115行： − + − The list of active researchers is naturally dynamic and non-exhaustive. A network analysis of the community was published in 2007.<ref>{{cite arXiv |author=J.J. Merelo and C. Cotta |title=Who is the best connected EC researcher? Centrality analysis of the complex network of authors in evolutionary computation |year=2007 |eprint=0708.2021|class=cs.CY }}</ref> − − The list of active researchers is naturally dynamic and non-exhaustive. A network analysis of the community was published in 2007. − − 活跃的研究人员名单自然是动态的，并非详尽无遗。社区的网络分析在2007年发表。<ref>{{cite arXiv |author=J.J. Merelo and C. Cotta |title=Who is the best connected EC researcher? Centrality analysis of the complex network of authors in evolutionary computation |year=2007 |eprint=0708.2021|class=cs.CY }}</ref> 第236行：
第139行： − + − The main conferences in the evolutionary computation area include − − The main conferences in the evolutionary computation area include − − 演化计算地区的主要会议包括 第278行：
第176行： − − 第308行：
第204行： − − − − <noinclude> − − <small>This page was moved from [[wikipedia:en:Evolutionary computation]]. Its edit history can be viewed at [[演化计算/edithistory]]</small></noinclude> − − [[Category:待整理页面]]
无编辑摘要
在计算机科学中，<font color="#ff8000"> 演化计算 Evolutionary computation</font>是一个受生物演化启发的全局优化算法家族，这些算法的研究属于[[人工智能]]和软计算的子领域。在技术术语上，它们是一类基于群体的试错型问题求解器，具有元启发式或随机优化特性。
在演化计算中，一个初始的候选解决方案集被生成并迭代更新。每一代都是通过随机去除不太理想的解法，引入小的随机变化而产生的。在生物学术语中，一个解决方案的群体会经历自然选择(或人工选择)和突变。因此，种群会逐渐演化，其适应度不断提高，在这个语境中所谓适应度就是算法选择的目标函数。
在演化计算中，一个初始的候选解决方案集被生成并迭代更新。每一代都是通过随机去除不太理想的解法，引入小的随机变化而产生的。在生物学术语中，一个解决方案的群体会经历自然选择(或人工选择)和突变。因此，种群会逐渐演化，其适应度不断提高，在这个语境中所谓适应度就是算法选择的目标函数。
演化计算技术可以应用在在诸多问题领域中，并产生高度优化的解决方案，这使其在计算机科学中广受欢迎。演化计算存在许多变体和扩展，能适用于更具体的问题和数据结构。演化计算有时也被用在演化生物学中，作为一种电子实验程序来研究一般演化过程的共性特点。
演化计算技术可以应用在在诸多问题领域中，并产生高度优化的解决方案，这使其在计算机科学中广受欢迎。演化计算存在许多变体和扩展，能适用于更具体的问题和数据结构。演化计算有时也被用在演化生物学中，作为一种电子实验程序来研究一般演化过程的共性特点。
== 历史 ==
== 历史 ==
使用演化原理来进行<font color="#ff8000">自动化问题求解 automated problem solving</font>起源于20世纪50年代。直到20世纪60年代，才在三个不同的地方形成了对这一观点的三种不同的解释。
使用演化原理来进行<font color="#ff8000">自动化问题求解 automated problem solving</font>起源于20世纪50年代。直到20世纪60年代，才在三个不同的地方形成了对这一观点的三种不同的解释。
<font color="#ff8000">演化程序设计 ''Evolutionary programming''</font>是由美国的 Lawrence J. Foge提出的，而[[约翰·霍兰德]]''John Henry Holland''称他的方法为[[遗传算法]]。在德国，Ingo Rechenberg 和 Hans-Paul Schwefel 引入了<font color="#ff8000">演化策略 evolution strategies</font>。这些领域分别独立地发展了大约15年。从九十年代早期开始，它们被统一为一种被称为演化计算的技术的不同表示(类似“方言”)。也是在九十年代初期，出现了继一般思想之后的第四种思潮——<font color="#ff8000">遗传程序设计 genetic programming</font>。自20世纪90年代以来，以自然为灵感的算法正在成为演化计算日益重要的一部分。
<font color="#ff8000">演化程序设计 Evolutionary programming</font>是由美国的 Lawrence J. Foge提出的，而[[约翰·霍兰德_John_H_Holland|约翰·霍兰德]]称他的方法为[[遗传算法]]。在德国，Ingo Rechenberg 和 Hans-Paul Schwefel 引入了<font color="#ff8000">演化策略 evolution strategies</font>。这些领域分别独立地发展了大约15年。从九十年代早期开始，它们被统一为一种被称为演化计算的技术的不同表示(类似“方言”)。也是在九十年代初期，出现了继一般思想之后的第四种思潮——<font color="#ff8000">遗传程序设计 genetic programming</font>。自20世纪90年代以来，以自然为灵感的算法正在成为演化计算日益重要的一部分。
这些术语表示演化计算领域，并将演化程序设计、演化策略、遗传算法和遗传程序设计作为子领域。
这些术语表示演化计算领域，并将演化程序设计、演化策略、遗传算法和遗传程序设计作为子领域。
利用演化算法和人工生命模拟进化始于20世纪60年代 Nils Aall Barricelli的工作，后来被Alex Fraser扩展，他发表了一系列关于人工选择模拟的论文<ref>{{cite journal |author=Fraser AS |title=Monte Carlo analyses of genetic models |journal=Nature |volume=181 |issue=4603 |pages=208–9 |year=1958 |pmid=13504138 |doi=10.1038/181208a0 |ref=harv|bibcode=1958Natur.181..208F }}</ref> 。20世纪60年代和70年代早期，Ingo Rechenberg 使用演化策略解决复杂的工程问题，人工演化因此成为被广泛认可的优化方法。尤其是遗传算法，因为[[约翰·霍兰德_John_H_Holland|约翰·霍兰德]]的著作而变得流行起来<ref>{{cite book |last=Holland |first=John H. |year=1975 |title=Adaptation in Natural and Artificial Systems |publisher=[[University of Michigan Press]] |isbn=978-0-262-58111-0 |url-access=registration |url=https://archive.org/details/adaptationinnatu00holl }}</ref>。学术界兴趣增长的同时，计算机能力的急剧增长使得这种算法可以被实际应用起来，其中包括计算机程序的自动演化。<ref>{{cite book |last=Koza|first=John R. |year=1992 |title=Genetic Programming: On the Programming of Computers by Means of Natural Selection|publisher=[[MIT Press]] |isbn=978-0-262-11170-6}}</ref> 演化算法现在被用来解决多维度问题，且比人类设计者生产的软件更有效，同时还可以优化系统的设计。 <ref>G. C. Onwubolu and B V Babu, {{cite book|url=https://www.springer.com/in/book/9783540201670|title=New Optimization Techniques in Engineering|accessdate=17 September 2016|isbn=9783540201670|last1=Onwubolu|first1=Godfrey C.|last2=Babu|first2=B. V.|date=2004-01-21}}</ref><ref>{{cite journal |author=Jamshidi M |title=Tools for intelligent control: fuzzy controllers, neural networks and genetic algorithms |journal=[[Philosophical Transactions of the Royal Society A]] |volume=361 |issue=1809 |pages=1781–808 |year=2003 |pmid=12952685 |doi=10.1098/rsta.2003.1225 |ref=harv|bibcode=2003RSPTA.361.1781J }}</ref>
利用演化算法和人工生命模拟进化始于20世纪60年代 Nils Aall Barricelli的工作，后来被Alex Fraser扩展，他发表了一系列关于人工选择模拟的论文<ref>{{cite journal |author=Fraser AS |title=Monte Carlo analyses of genetic models |journal=Nature |volume=181 |issue=4603 |pages=208–9 |year=1958 |pmid=13504138 |doi=10.1038/181208a0 |ref=harv|bibcode=1958Natur.181..208F }}</ref> 。20世纪60年代和70年代早期，Ingo Rechenberg 使用演化策略解决复杂的工程问题，人工演化因此成为被广泛认可的优化方法。尤其是遗传算法，因为[[约翰·霍兰德_John_H_Holland|约翰·霍兰德]]的著作而变得流行起来<ref>{{cite book |last=Holland |first=John H. |year=1975 |title=Adaptation in Natural and Artificial Systems |publisher=[[University of Michigan Press]] |isbn=978-0-262-58111-0 |url-access=registration |url=https://archive.org/details/adaptationinnatu00holl }}</ref>。学术界兴趣增长的同时，计算机能力的急剧增长使得这种算法可以被实际应用起来，其中包括计算机程序的自动演化。<ref>{{cite book |last=Koza|first=John R. |year=1992 |title=Genetic Programming: On the Programming of Computers by Means of Natural Selection|publisher=[[MIT Press]] |isbn=978-0-262-11170-6}}</ref> 演化算法现在被用来解决多维度问题，且比人类设计者生产的软件更有效，同时还可以优化系统的设计。 <ref>G. C. Onwubolu and B V Babu, {{cite book|url=https://www.springer.com/in/book/9783540201670|title=New Optimization Techniques in Engineering|accessdate=17 September 2016|isbn=9783540201670|last1=Onwubolu|first1=Godfrey C.|last2=Babu|first2=B. V.|date=2004-01-21}}</ref><ref>{{cite journal |author=Jamshidi M |title=Tools for intelligent control: fuzzy controllers, neural networks and genetic algorithms |journal=[[Philosophical Transactions of the Royal Society A]] |volume=361 |issue=1809 |pages=1781–808 |year=2003 |pmid=12952685 |doi=10.1098/rsta.2003.1225 |ref=harv|bibcode=2003RSPTA.361.1781J }}</ref>
== 技术 ==
== 技术 ==
演化计算技术主要涉及元启发式优化算法。一般来说，这个领域包括:
演化计算技术主要涉及元启发式优化算法。一般来说，这个领域包括:
== 演化算法 ==
== 演化算法 ==
演化算法是演化计算的一个子集，因为它们通常只涉及实现生物演化机制的技术，如繁殖、变异、重组、自然选择和适者生存。最佳化问题的候选解决方案扮演了人口中个体的角色，而成本函数决定了解决方案“生存”的环境(参见适应度函数)。在重复应用上述算子之后，种群的演化就发生了。
演化算法是演化计算的一个子集，因为它们通常只涉及实现生物演化机制的技术，如繁殖、变异、重组、自然选择和适者生存。最佳化问题的候选解决方案扮演了人口中个体的角色，而成本函数决定了解决方案“生存”的环境(参见适应度函数)。在重复应用上述算子之后，种群的演化就发生了。
在这个过程中，有两种主要的力量构成了演化系统的基础: 重组（Recombination）、突变（mutation）和交换（crossover）创造了必要的多样性，从而促进了新颖性，而选择带来的优胜劣汰则是一种提高质量的力量。
在这个过程中，有两种主要的力量构成了演化系统的基础: 重组（Recombination）、突变（mutation）和交换（crossover）创造了必要的多样性，从而促进了新颖性，而选择带来的优胜劣汰则是一种提高质量的力量。
这种演化过程的许多方面都是随机的。由于重组和突变而改变的信息片段是随机选择的。另一方面，选择操作可以是确定性的，也可以是随机的。在后一种情况下，适合度较高的个体比适合度较低的个体有更高的机会被选中，但通常即使是适应度较差的个体也有机会成为父本或生存下来。
这种演化过程的许多方面都是随机的。由于重组和突变而改变的信息片段是随机选择的。另一方面，选择操作可以是确定性的，也可以是随机的。在后一种情况下，适合度较高的个体比适合度较低的个体有更高的机会被选中，但通常即使是适应度较差的个体也有机会成为父本或生存下来。
== 演化算法和生物学 ==
== 演化算法和生物学 ==
遗传算法提供了与[[动力系统理论]]相关的生物系统和[[系统生物学]]模型的方法，因为它们可以被用来预测系统的未来状态。这是一种生动的(但也许是误导性的)方式，提醒人们注意生物学发展的有序、控制良好和高度结构化的特征。
然而，算法和信息学的使用，特别是[[计算理论]]的使用，超越了对[[动力系统]]的类比，这也与理解演化本身有关。
这一观点的优点是认识到发育没有中央控制；生物体的发育是细胞内部和细胞之间局部相互作用的结果。在我们看来，关于程序开发并行的最有前途的想法似乎是那些指出细胞内的进程与现代计算机的低级操作之间明显相似的思想。<ref>{{Cite book | chapter-url=https://plato.stanford.edu/entries/information-biological/#InfEvo | title=The Stanford Encyclopedia of Philosophy| chapter=Biological Information| publisher=Metaphysics Research Lab, Stanford University| year=2016}}</ref> 因此，生物系统就像计算机器，处理输入信息来计算下一个状态。这样看来，生物系统比经典的动力系统更接近于计算。<ref>{{cite journal |author= J.G. Diaz Ochoa |title= Elastic Multi-scale Mechanisms: Computation and Biological Evolution |journal=[[Journal of Molecular Evolution]] |volume=86 |issue=1 |pages=47–57 |year=2018 |pmid=29248946 |doi=10.1007/s00239-017-9823-7 |ref=harv|bibcode=2018JMolE..86...47D }}</ref>
这一观点的优点是认识到发育没有中央控制；生物体的发育是细胞内部和细胞之间局部相互作用的结果。在我们看来，关于程序开发并行的最有前途的想法似乎是那些指出细胞内的进程与现代计算机的低级操作之间明显相似的思想。<ref>{{Cite book | chapter-url=https://plato.stanford.edu/entries/information-biological/#InfEvo | title=The Stanford Encyclopedia of Philosophy| chapter=Biological Information| publisher=Metaphysics Research Lab, Stanford University| year=2016}}</ref> 因此，生物系统就像计算机器，处理输入信息来计算下一个状态。这样看来，生物系统比经典的[[动力系统]]更接近于计算。<ref>{{cite journal |author= J.G. Diaz Ochoa |title= Elastic Multi-scale Mechanisms: Computation and Biological Evolution |journal=[[Journal of Molecular Evolution]] |volume=86 |issue=1 |pages=47–57 |year=2018 |pmid=29248946 |doi=10.1007/s00239-017-9823-7 |ref=harv|bibcode=2018JMolE..86...47D }}</ref>
此外，根据计算理论的概念，生物有机体中的微进程从根本上来说是不完整的和不可判定的 ，这意味着细胞和计算机之间的类比不只仅仅只是一个粗略的比喻。<ref>{{cite journal |author= A. Danchin |title= Bacteria as computers making computers |journal=[[FEMS Microbiol. Rev.]] |volume=33 |issue=1 |pages=3–26 |year=2008 |doi=10.1111/j.1574-6976.2008.00137.x |pmid= 19016882 |ref=harv |pmc=2704931 }}</ref>
计算的类比也延伸到遗传系统和生物结构之间的关系，这通常被认为是揭示解释[[生命起源]]最紧迫的问题之一。
演化[[元胞自动机|自动机]]是演化图灵机<font color="#ff8000"> 图灵机Turing machines</font>的一种推。人们引入了这一概念来更精确地研究生物和演化计算的性质。特别是，他们在演化计算的表现力上获得新的成果。这证实了关于自然演化和演化算法及过程不可判定性的初步结果。演化有限自动机是演化自动机中最简单的子类，在终端模式下可以接受给定字母表上的任意语言，包括非递归的可枚举语言(例如，对角化语言)和递归的可枚举但不递归语言(例如，通用图灵机语言)。
活跃的研究人员名单自然是动态的，并非详尽无遗。社区的[[网络分析]]在2007年发表。<ref>{{cite arXiv |author=J.J. Merelo and C. Cotta |title=Who is the best connected EC researcher? Centrality analysis of the complex network of authors in evolutionary computation |year=2007 |eprint=0708.2021|class=cs.CY }}</ref>
演化计算领域的主要会议包括
* [[Association for Computing Machinery|ACM]] [[Genetic and Evolutionary Computation Conference]] (GECCO) 计算机协会 遗传与进化计算会议
* [[Association for Computing Machinery|ACM]] [[Genetic and Evolutionary Computation Conference]] (GECCO) 计算机协会 遗传与进化计算会议
== 参考书目 ==
== 参考书目 ==
* Th. Bäck, D.B. Fogel, and [[Zbigniew Michalewicz|Z. Michalewicz]] (Editors), [https://www.amazon.com/Handbook-Evolutionary-Computation-Thomas-Back/dp/0750303921 Handbook of Evolutionary Computation], 1997, {{ISBN|0750303921}}
* Th. Bäck, D.B. Fogel, and [[Zbigniew Michalewicz|Z. Michalewicz]] (Editors), [https://www.amazon.com/Handbook-Evolutionary-Computation-Thomas-Back/dp/0750303921 Handbook of Evolutionary Computation], 1997, {{ISBN|0750303921}}
== 引用 ==
== 引用 ==
{{reflist}}
{{reflist}}