Choosing selection pressure for wide-gap problems-Reference-Cited by-同舟云学术

Choosing selection pressure for wide-gap problems

Published:2010-02 Issue:6 Volume:411 Page:926-934
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Chen Tianshi,He Jun,Chen Guoliang,Yao Xin

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference24 articles.

1. The exploration/exploitation tradeoff in dynamic cellular genetic algorithms;Alba;IEEE Trans. Evol. Comput.,2005

2. T. Bäck, Selective pressure in evolutionary algorithms: A characterization of selection mechanisms, in: D. Fogel, (Ed.), Proc. 1st IEEE Conf. Evol. Comput., Orlando, FL, 1994, pp. 57–62

3. A new approach to analyzing average time complexity of population-based evolutionary algorithms on unimodal problems;Chen;IEEE Trans. Syst., Man, and Cybern., Part B,2009

4. T. Blickle, L. Thiele, A comparison of selection schemes used in genetic algorithms, Technical Report No. 11. Gloriastrasse 35, CH-8092 Zurich: Swiss Federal Institute of Technology (ETH) Zurich, Computer Engineering and Communications Networks Lab (TIK), 1995

5. On the analysis of the (1+1) evolutionary algorithm;Droste;Theor. Comput. Sci.,2002

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Helper and Equivalent Objectives: Efficient Approach for Constrained Optimization;IEEE Transactions on Cybernetics;2022-01

2. The impatience mechanism as a diversity maintaining and saddle crossing strategy;International Journal of Applied Mathematics and Computer Science;2016-12-01

3. A Lower Bound Analysis of Population-Based Evolutionary Algorithms for Pseudo-Boolean Functions;Lecture Notes in Computer Science;2016

4. On the Easiest and Hardest Fitness Functions;IEEE Transactions on Evolutionary Computation;2015-04

5. On the equality constraints tolerance of Constrained Optimization Problems;Theoretical Computer Science;2014-09