These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
2. A study of redundancy and neutrality in evolutionary optimization. Correia MB Evol Comput; 2013; 21(3):413-43. PubMed ID: 22998618 [TBL] [Abstract][Full Text] [Related]
4. Empirical investigation of the benefits of partial Lamarckianism. Houck CR; Joines JA; Kay MG; Wilson JR Evol Comput; 1997; 5(1):31-60. PubMed ID: 10021752 [TBL] [Abstract][Full Text] [Related]
5. Simulated evolution and artificial selection. Gibson JM Biosystems; 1989; 23(2-3):219-28; discussion 229. PubMed ID: 2627566 [TBL] [Abstract][Full Text] [Related]
6. Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning. Merz P; Freisleben B Evol Comput; 2000; 8(1):61-91. PubMed ID: 10753231 [TBL] [Abstract][Full Text] [Related]
7. Multimodal function optimization using minimal representation size clustering and its application to planning multipaths. Hocaoğlu C; Sanderson AC Evol Comput; 1997; 5(1):81-104. PubMed ID: 10021754 [TBL] [Abstract][Full Text] [Related]
8. RGFGA: an efficient representation and crossover for grouping genetic algorithms. Tucker A; Crampton J; Swift S Evol Comput; 2005; 13(4):477-99. PubMed ID: 16297280 [TBL] [Abstract][Full Text] [Related]
11. Representations and evolutionary operators for the scheduling of pump operations in water distribution networks. López-Ibáñez M; Prasad TD; Paechter B Evol Comput; 2011; 19(3):429-67. PubMed ID: 21281118 [TBL] [Abstract][Full Text] [Related]
12. Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator. Hussain A; Muhammad YS; Nauman Sajid M; Hussain I; Mohamd Shoukry A; Gani S Comput Intell Neurosci; 2017; 2017():7430125. PubMed ID: 29209364 [TBL] [Abstract][Full Text] [Related]
13. Putting more genetics into genetic algorithms. Burke DS; De Jong KA; Grefenstette JJ; Ramsey CL; Wu AS Evol Comput; 1998; 6(4):387-410. PubMed ID: 10030470 [TBL] [Abstract][Full Text] [Related]
14. Convergence of simple genetic algorithms for the two-bit problem. Takahashi Y Biosystems; 1998; 46(3):235-82. PubMed ID: 9668963 [TBL] [Abstract][Full Text] [Related]
15. Principled Design and Runtime Analysis of Abstract Convex Evolutionary Search. Moraglio A; Sudholt D Evol Comput; 2017; 25(2):205-236. PubMed ID: 26469220 [TBL] [Abstract][Full Text] [Related]
16. Network random keys - a tree representation scheme for genetic and evolutionary algorithms. Rothlauf F; Goldberg DE; Heinzl A Evol Comput; 2002; 10(1):75-97. PubMed ID: 11911783 [TBL] [Abstract][Full Text] [Related]
17. Efficient and scalable Pareto optimization by evolutionary local selection algorithms. Menczer F; Degeratu M; Street WN Evol Comput; 2000; 8(2):223-47. PubMed ID: 10843522 [TBL] [Abstract][Full Text] [Related]
18. On the Performance of Different Genetic Programming Approaches for the SORTING Problem. Wagner M; Neumann F; Urli T Evol Comput; 2015; 23(4):583-609. PubMed ID: 25870929 [TBL] [Abstract][Full Text] [Related]