- Convergence Rates for the Distribution of Program Outputs
W.B. Langdon, Computer Science, University College, London, W.Langdon@cs.ucl.ac.uk
这是关于GP的一篇文章,它利用MARKOV链分析了收敛GP的收敛的特点。
- Using schema theory to explore interactions of multiple operators
Nicholas Freitag McPhee, University of Minnesota, Morris, USA, mcphee@mrs.umn.edu
Riccardo Poli, University of Essex, UK, rpoli@essex.ac.uk
这是关于GP的一篇文章,它利用SCHEMA理论对不同的杂交和变异算子进行了一个综合性的描述。
- Visualization of Fitness Landscape, A steady-state Genetic Search and Schema Traces
Yong-Hyuk Kim, Byung-Ro Moon, Seoul National University, Korea, {yhdfly, moon}@soar.snu.ac.kr
提出了一种将GA搜索过程可视化的方法,它利用SAMMON的映射方法并加以扩展
- Using GAs to Deal with Dynamic Environments: A comparative study of several approaches based on Promoting Diversity
Anabela Simoes, Coimbra Polytechnic, Portugal, abs@isec.pt
Ernesto Costa, University of Coimbra, Portugal, ernesto@dei.uc.pt
利用一种新提出的遗传算子transformation进行了一系列实验,并将实验结果进行对比
- Adaptive Non-uniform Crossover Based on Statistics for Genetic Algorithms
Shengxiang Yang, University of Leicester, UK, s.yang@mcs.le.ac.uk
提出一种基于概率的杂交方法,它种方法是对UNIFORM方法的一种改进,效率比其它杂交算法效率要高
[评]这篇文章中对其它杂交方法的论述让人看起来比较系统,我做作业的时候就可以用到这些。。:)
- Varying Fitness Functions in Genetic Algorithms: Studying the Rate of Increase of Dynamic Penalty Terms
S. Kazarlis, V. Petridis, Aristotle University of Thessaloniki, Greece
提出了一种随时间增加的惩罚方法,其原则就是使用动态的FINTESS函数,如果得到一个错误的结果不但得到一个低的FITNESS值,而且还会再减少一些FITNESS值作为惩罚。这具惩罚会随时间增大而增大。
- An Analysis of Multi-Point Crossover
William M. Spears, Naval Research Lab, USA, spears@aic.nrl.navy.mil
Kenneth A. De Jong, George Mason University, USA, kdejong@aic.gmu.edu
这篇文章对多点杂交和UNIFORM杂交提供了理论证明。
- A Formal Analysis of the Role of Multi-Point Crossover in Genetic Algorithm
William M. Spears, Naval Research Lab, USA, spears@aic.nrl.navy.mil
Kenneth A. De Jong, George Mason University, USA, kdejong@aic.gmu.edu
这篇文章对多点杂交和UNIFORM杂交提供了理论证明。
- Two Views of Classifier Systems
Tim Kovacs, University of Bistol, UK, kovacs@cs.bris.ac.uk
主要对CS系统是不是基于GA的进行了说明,同时用了两个例子XCS,和SBXCS进行具体说明
- Revisiting Bremermann's Genetic Algorithm
David B. Fogel, Natural Selection Inc. USA, dfogel@natural-selection.com
Russel W. Andreson, HNC Software Inc. USA, rwa@hnc.com
主要对Bremermann的一些作用进行了描述,指导性文章。
- A Fixed Point Analysis of a Gene Pool GA with Mutation
Alden H. Wright, University of Montana, USA, wright@cs.umt.edu
Jonathan E. Rowe, University of Birmingham, UK, j.e.rowe@cs.bhma.ac.uk
一篇理论性文章,对MAXONE问题进行了理论分析
- Understanding EA Dynamic via Population Fitness Distribution
Elena Popovici, Kenneth De Jong, George Manson University, USA, epopovic@gmu.edu
利用群体的分布研究群体性质的一篇文章。
- No Free Lunch Theorems for Optimization
David H. Wolpert, IBM Almaden Research Center, USA
William G. Macready, Santa Fe Institute
说明没有一个统一的遗传算法能够解决所有问题,遗传算法是和问题相关的
- Analysis of the Simple Genetic Algorithm on the Single-peak and Double-peak Landscapes
Alden H. Wright, University of Montana, USA, wright@cs.umt.edu
Johnathan E. Rowe, University of Birmingham, UK, j.e.rowe@cs.bham.ac.uk
在SGA下,可能会因为CROSSOVER发生导致FITNESS值下降的情况。它提供了一些比较有用的背景资料,比如MUTATION值的取值范围。
- A Markov Framework for the Simple Genetic Algorithm
Thomas E. Davis, Jose C. Principe
University of Florida, USA
利用Markov模型分析了SGA,提出了只要有变异存在就一定会有一个唯一的稳定分布。
- The Genetic Algorithm in Computer Sicence
Eric K. Prebys
对一些GA的理论成就做了一些概括性的描述
- Crossover or Mutation?
William M. Spears, Navy Center for Applied Research in AI, US, spears@aic.nrl.navy.mil
对杂交和交配的一篇很好的文章,清楚易懂,指出杂交与变异在实质上是一样,杂交与时间相关,而变异与时间无关
- Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithm
Terry Jones, Santa Fe Institute, US, terry@santefe.edu
Stephanie Forrest, University of Mexico, US, forrest@cs.unm.edu
引入了一个新的FDC相关度分析,用于分析一个问题是不是对GA是难解的。
- Markov Chian Models of Genetic Algorithm
Alden H. Wright, University of Montana, US, wright@cs.umt.edu
Yong Zhao, University of Montana, US, yzhao@cs.umt.edu
利用马尔可夫链分析杂交和变异作用
- Parallel Genetic Algorithm with Schema Migration
Baowen Yu, Yu Guan, Zhanenqiang Chen, Southeast University, China, bwxu@seu.edu.cn
提出了一种新的并行通信模式SMS,它可以将多群体的GA通信代价减少。
- Reconstructing the Shifting Balance Theory in a GA: Taking Sewall Wright Seriously
Franz Oppacher, Carleton University, Canada, oppacher@scs.carleton.ca
Mark Wineberg, Carleton University, Canada, wineberg@scs.carleton.ca
提出了一种多群体GA,使群体中的个体分为主从式,一定时间之后从向主发出自己最优秀的个体,如果主向从逼近,则从向远离主的方向移动,两者是不是靠近要靠HAMMING DISTANCE来衡量
- Enhancing the GA's Ability to Cope with Dynamic Environments
Franz Oppacher, Carleton University, Canada, oppacher@scs.carleton.ca
Mark Wineberg, Carleton University, Canada, wineberg@scs.carleton.ca
利用在[21]中提出的结构处理变环境下求最佳值的问题
- A Real Coded Genetic Algorithm with an Explorer and an Exploiter Populations
Shigeyoshi Tsutsui, Hannan University, Japan, tsutsui@hannan-u.ac.jp
Ashish Ghosh, Indian Statistical Institute, India, ash@isical.ernet.in
David Corne, The University of Reading, UK, d.w.corne@reading.ac.uk
Yoshiji, Fujimoto, Ryukoku University, Japan, fujimoto@math.ryukoku.ac.jp
提出了一种两个群体的多群体GA,一个群体进行粗粒度的搜索,另一个进行细粒度的搜索,粗粒度搜索定时进行重启。通过这样的方法找最佳值
- Topologies, Migration Rates, and Multi-population Parallel Genetic Algorithms
Erick Cantu-Paz, University of Illinois, US, cantupaz@illigal.ge.uiuc.edu
一篇理论性文章,对并行GA的结构进行了分析,提出理论上的估计值。
- A New Model of Distributed Genetic Algorithm for Cluster Systems: Dual Individual DGA
Tomoyuki Hiroyasu, Mitsumori Miki, Doshisha University, Japan, tomo@is.doshisha.ac.jp
介绍了一种并行GA的结构,一个小群体里只有两个个体,个体数很多。
- Solving LEGO brick layout problem using Evolutionary Algorithm
Pavel Petrovic, Norwegian University of Science and Technology, Norway, pavel.petrovic@idi.ntnu.no
利用遗传算法解决LEGO问题的一个例子,属于应用型文章
- A New Parallel Distributed Genetic Algorithm Applied to Traveling Salesman Problems
提出了一种新的并行GA,不让多个GA小群体通信,只在一定时间之后将小群体中的个体收集起来组成大群体,然后再分。
- The Hierarchical Fair Competition (HFC) Model for Parallel Evolutionary Algorithms
Jianjun Hu, Michigan State University, hujianju@cse.msu.edu
Erik D. Goodman, Michigan State University, goodman@egr.msu.edu
提供了一种新型的GA结构,思想取自中国的教育制度,不同的个体因FITNESS值不同而被放在不同的层次中,相同FINTESS值的个体进行竞争,以这种方法希望保证GA能够不聚合于局部最优
- A Genetic Algorithm for the P-Median Problem
Elon Santos Correa, Colegio Militar de Curitiba Timoteo Jose Ferreira, Brazil, elonsc@yahoo.com
一篇应用性的文章,将GA用于在N个点中间放置另外M个点,使这M个点到N个点的距离和最小
- A Statistical Mechanical Formulation of the Dynamics of Genetic Algorithms
Jonathan Shapiro, Adam Pruguel-Bennett, Magnus Rattray, University of Manchester, UK
对GA统计特征的文章,涉及了FINTESS的SKEW的内容
- Convergence Analysis of Canonical Genetic Algorithm
Gunter Rudolph, University of Dortmund, Germany
利用马尔可夫链理论对GA进行分析的一文章,可以说是分析标准GA的一篇范文
- Using Genetic Algorithm to Deal With Dynamic Environment: A Comparative Study of Several Approaches Based on Promoting Diversity
Anabela Simoes, Coimbra Polytechnic, Portugal, abs@isec.pt
Ernesto Costa, University of Coimbra, ernesto@dei.uc.pt
提出了一种新的遗传算子:TRANSFORM。并利用这种算子对变化情况下的GA进行了一些实验
- Adaptation of Length in a nonstationary environment
Han Yu, Annie S. Wu, University of Central Florida, US, {hyu, aswu}@cs.ucf.edu
将基因片段变成非定长片断,并认为这样可以提高GA的效率
- Dynamic Memory Model for Non-Stationary Optimization
Claus N. Bendtsen, University of Aarhus, Denmark, claus@daimi.au.dk
Thiemo Krink, University of Aarhus, Denmark, krink@daimi.au.hk
提供利用一段专用内存对GA数据进行处理,以达到处理变化环境的目的
- Diversity Maintenance on Neutral Landscapes: An Argument for Recombination
Nicholas Geard, University of Queensland, Australia, nic@itee.uq.edu.au
Janet Wiles, University of Queensland, Australia, j.wiles@itee.uq.edu.au
通过保存低适应值的个体,达到提高多样性的目的
- Evaluation of Search Performance of Bacterial Evolutionary Algorithm
Kosuke Yamamoto, Tomohiro Yoshikawa, Takeshi Furuhashi, Mie University, Japan, yamamoto@ip.elec.mie-u.ac.jp
通过对一种细菌变异算子的研究,得到结论,这种细菌变异算子对搜索更有用
- Optimization by Means of Genetic Algorithms
Thomas Back, University of Dortmund, Germany, baeck@lumpi.informatik.uni-dortmund.de
对GA搜索进行的文章,对GA进行了一些数学总结。
- Selective Pressure in Evolutionary Algorithms: A Characterization of Selection Mechanisms
Thomas Back, University of Dortmund, Germany, baeck@lumpi.informatik.uni-dortmund.de
对各种选择函数下个体被选择的概率进行了数学推演
- Visualization of Evolutionary Algorithms: Real-World Application of Standard Techniques and Multidimensional Visualization
Hartmut Pohlheim, DaimlerChrylsler AG, Research and Technology, Germany, pohlheim@dbag.bln.daimlerbenz.com
提供了一种对GA数据进行多维可视化的方法
- On Eeffect of Migration on the Fitness Distribution of Parallel Evolutionary Algorithms
Erick Cantu-Paz, Lawrence Livermore National Lab, US, cantupaz@llnl.gov
在并行GA时,不同群体之间个体的迁移可以使GA找到最好的结果。当不同群体之间的连接越多的时候,这种效果就越好
- Genetic Algorithm Dynamics on a Rugged Landscape
Stefan Bornholdt, Institute Fur Theoretische Physik, Universitat Kiel, Germany, bornholdt@theo-physik.uni-kiel.de
提出了GA群体分布的模型,与[30]内容类似
- Visual Analysis of Evolutionary Algorithms
Annie S. Wu, Naval Research Lab, US, aswu@sic.nrl.navy.mil
Kenneth A. De Jong, George Mason University, US, kdejong@cs.gmu.edu
提出了一种对EA的可视化方法
- Optimal Mutation Rate in Genetic Algorithm
Thomas Back, University of Dortmund, Germany, baeck@ls11.informatik.uni-dortmund.de
指出变化的变异率对GA更好
- An Analysis of the Interacting Roles of Population Size and Crossover in Genetic Algorithm
Kenneth A. De Jong, George Mason University, US, kdejong@aic.gmu.edu
William M. Spears, Naval Research Lab, US, spears@aic.nrl.navy.mil
提出了N点交配和UNIFORM交配对GA的干扰作用,在考虑到群体大小的情况下可以得到相应的如何选择交配方法,但这个结果不明显。群体数目比较大的时候,使用2点杂交比较好
- Adapting Crossover in a Genetic Algorithm
William M. Spears, Naval Research Lab, US, spears@aic.nrl.navy.mil
此文章是对[41]的扩展,在GA运行时添加一位使得GA能够自己选择是采用2点杂交还是UNIFORM杂交,此方法对于大群体有用,对小群体效果不好
- On Recombination and Optimal Mutation Rates
Gabriela Ochoa, Imman Harvey, Hilary Buxton, University of Sussex, UK
力图获得杂交与变异算子的最佳组合,结果是如果有杂交,变异最好是不变的,而且比较小;如果没有杂交,开始时变异比较大,以后变异比较小比较好。
- Using Problem Generators to Explore the Effects of Epistasis
Kenneth A. De Jong, George Mason University, US, kdejong@gmu.edu
Mitchell A. Potter, George Mason University, US, mpotter@gmu.edu
William M. Spears, Naval Research Lab, US, spears@aic.nrl.navy.mil
提出了自动生成一系列函数的方法,这些函数是用于GA进行测试的。
- Adaptive Mutation Rate Control Schemes in Genetic Algorithms
Dirk Thierens, utrecht university
针对MUTATION的一种自适应GA,文中还对三种其它自适应GA参数方法进行了说明
一些遗传算法的论文(GA)
最新推荐文章于 2022-09-06 10:09:50 发布