期刊文献+

EXPLORATION/EXPLOITATION TRADEOFF WITH CELL-SHIFT AND HEURISTIC CROSSOVER FOR EVOLUTIONARY ALGORITHMS

EXPLORATION/EXPLOITATION TRADEOFF WITH CELL-SHIFT AND HEURISTIC CROSSOVER FOR EVOLUTIONARY ALGORITHMS
原文传递
导出
摘要 以便折衷探索 / 利用并且由房间 geneticalgorithm 启发了一个房间移动转线路操作员因为进化算法(EA ) 在这个 paper.The 定义领域被建议被划分成重新尺寸立方的子域(房间) 和在一个 n 维的立方体的每 individuallocates。如果他们在不同房间(探索) 并且随后, thecrossover 的房间数字配对的房间移动转线路第一交换从它的起始的地方转移 firstindividual 到另外的个人“ s 房间地方。如果他们已经在 thesame 房间,启发式的转线路(利用) 被使用。有基因差异的 vary 的 Cell-shift/heuristic 转线路 adaptivelyexecutes 探索 / 利用搜索。当与最近的著名 FEP 进化算法作比较时,房间移动 EA hasexcellent 表演通常以十上的效率和功效使用了 optimizationbenchmarks。 In order to tradeoff exploration/exploitation and inspired by cell genetic algorithm a cellshift crossover operator for evolutionary algorithm (EA) is proposed in this paper. The definition domain is divided into n-dimension cubic sub-domains (cell) and each individual locates at an ndimensional cube. Cell-shift crossover first exchanges the cell numbers of the crossover pair if they are in the different cells (exploration) and subsequently shift the first individual from its initial place to the other individual's cell place. If they are already in the same cell heuristic crossover (exploitation) is used. Cell-shift/heuristic crossover adaptively executes exploration/exploitation search with the vary of genetic diversity. The cell-shift EA has excellent performance in terms of efficiency and efficacy on ten usually used optimization benchmarks when comparing with the recent well-known FEP evolutionary algorithm.
出处 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2007年第1期66-74,共9页 系统科学与复杂性学报(英文版)
关键词 随机遗传算法 进化算法 勘探/开发权衡问题 数值优化 启发交叉算法 胞腔偏差 Cell-shift crossover, evolutionary algorithm, exploration/exploitation tradeoff, heuristic crossover, numerical optimization.
  • 相关文献

参考文献1

二级参考文献36

  • 1Z Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Third Edition,Springer, 1996.
  • 2Z Pan, L Kang and Y Chen, Evolutionary Computation(Chinese edition), Tsinghua University Press, GuangXi Science & Technology Press, 1998.
  • 3T Back and F Hoffmeister, Extended selection mechanisms in genetic algorithms, in Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, San Mateo, CA, 1991.
  • 4A Szalas and Z Michalewicz, Contractive Mapping Genetic Algorithms and Their Convergence,University of North Carolina at Charlotte, Technical Report 006-1993.
  • 5R E Smith, Adaptively resizing populations: an algorithm and analysis, in Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 1993, 653.
  • 6J Arabas, Z Michalewicz and J. Mulawka, GAVaPS-a genetic algorithm with varying population size, in Proceeding of the 1st IEEE International Conference on Evolutionary Computation(ICEC),Orlando, Florida, USA, IEEE Press, 1994.
  • 7Y Davidor and H P Schwefel, An introduction to actaptive optimization algorithms based on principles of nature evolution, dynamic, genetic and chaotic programming, John Wiley & Sons,1992, 138-202.
  • 8H P Schwefel, Numerical Optimization of Computer Models, John Wiley, Chichester, UK, 1981.
  • 9D E Goldberg, A note on Boltzman Tournament Selection for genetic algorithms and populationoriented simulated annealing, Complex Systems, 1990, 4(4): 445-460.
  • 10L Kang, Y Xie, S You and Z Luo, Non-Numerical Parallel Algorithms(lst Volume): Simulated Annealing Algorithm(Chinese edition), Science Press, Beijing, 1994.

共引文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部