154 related articles for article (PubMed ID: 20064023)
1. Analysis of an asymmetric mutation operator.
Jansen T; Sudholt D
Evol Comput; 2010; 18(1):1-26. PubMed ID: 20064023
[TBL] [Abstract][Full Text] [Related]
2. Speeding up evolutionary algorithms through asymmetric mutation operators.
Doerr B; Hebbinghaus N; Neumann F
Evol Comput; 2007; 15(4):401-10. PubMed ID: 18021012
[TBL] [Abstract][Full Text] [Related]
3. Approximating covering problems by randomized search heuristics using multi-objective models.
Friedrich T; He J; Hebbinghaus N; Neumann F; Witt C
Evol Comput; 2010; 18(4):617-33. PubMed ID: 20583912
[TBL] [Abstract][Full Text] [Related]
4. Memetic algorithms for continuous optimisation based on local search chains.
Molina D; Lozano M; García-Martínez C; Herrera F
Evol Comput; 2010; 18(1):27-63. PubMed ID: 20064025
[TBL] [Abstract][Full Text] [Related]
5. Computing gap free Pareto front approximations with stochastic search algorithms.
Schütze O; Laumanns M; Tantar E; Coello CA; Talbi el-G
Evol Comput; 2010; 18(1):65-96. PubMed ID: 20064024
[TBL] [Abstract][Full Text] [Related]
6. A new approach to population sizing for memetic algorithms: a case study for the multidimensional assignment problem.
Karapetyan D; Gutin G
Evol Comput; 2011; 19(3):345-71. PubMed ID: 20868263
[TBL] [Abstract][Full Text] [Related]
7. Evolutionary squeaky wheel optimization: a new framework for analysis.
Li J; Parkes AJ; Burke EK
Evol Comput; 2011; 19(3):405-28. PubMed ID: 21265626
[TBL] [Abstract][Full Text] [Related]
8. Analysis of (1+1) evolutionary algorithm and randomized local search with memory.
Sung CW; Yuen SY
Evol Comput; 2011; 19(2):287-323. PubMed ID: 20868262
[TBL] [Abstract][Full Text] [Related]
9. Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: a case study for the multidimensional knapsack problem.
Raidl GR; Gottlieb J
Evol Comput; 2005; 13(4):441-75. PubMed ID: 16297279
[TBL] [Abstract][Full Text] [Related]
10. Finding Mount Everest and handling voids.
Storch T
Evol Comput; 2011; 19(2):325-44. PubMed ID: 21073298
[TBL] [Abstract][Full Text] [Related]
11. Strength Pareto particle swarm optimization and hybrid EA-PSO for multi-objective optimization.
Elhossini A; Areibi S; Dony R
Evol Comput; 2010; 18(1):127-56. PubMed ID: 20064026
[TBL] [Abstract][Full Text] [Related]
12. Runtime analysis of the (mu+1) EA on simple Pseudo-Boolean functions.
Witt C
Evol Comput; 2006; 14(1):65-86. PubMed ID: 16536891
[TBL] [Abstract][Full Text] [Related]
13. Multidimensional knapsack problem: a fitness landscape analysis.
Tavares J; Pereira FB; Costa E
IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):604-16. PubMed ID: 18558527
[TBL] [Abstract][Full Text] [Related]
14. Through the interaction of neutral and adaptive mutations, evolutionary search finds a way.
Yu T; Miller JF
Artif Life; 2006; 12(4):525-51. PubMed ID: 16953784
[TBL] [Abstract][Full Text] [Related]
15. Parameter optimisation of real-time control strategies for urban wastewater systems.
Schütze M; Butler D; Beck MB
Water Sci Technol; 2001; 43(7):139-46. PubMed ID: 11385840
[TBL] [Abstract][Full Text] [Related]
16. Stagnation Detection with Randomized Local Search.
Rajabi A; Witt C
Evol Comput; 2023 Mar; 31(1):1-29. PubMed ID: 35857878
[TBL] [Abstract][Full Text] [Related]
17. Automated discovery of local search heuristics for satisfiability testing.
Fukunaga AS
Evol Comput; 2008; 16(1):31-61. PubMed ID: 18386995
[TBL] [Abstract][Full Text] [Related]
18. Theoretical convergence guarantees for cooperative coevolutionary algorithms.
Panait L
Evol Comput; 2010; 18(4):581-615. PubMed ID: 20583910
[TBL] [Abstract][Full Text] [Related]
19. Fitness Probability Distribution of Bit-Flip Mutation.
Chicano F; Sutton AM; Whitley LD; Alba E
Evol Comput; 2015; 23(2):217-48. PubMed ID: 24885680
[TBL] [Abstract][Full Text] [Related]
20. Multimodal optimization using a bi-objective evolutionary algorithm.
Deb K; Saha A
Evol Comput; 2012; 20(1):27-62. PubMed ID: 21591888
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
