Maintaining healthy population diversity using adaptive crossover, mutation, and selection

IEEE Transactions on Evolutionary Computation

Volumn 15, Issue 5, 2011, Pages 692-714

  Mc Ginley, Brian ^a   Maher, John ^a   O'Riordan, Colm ^a   Morgan, Fearghal ^a  

^a NATIONAL UNIVERSITY OF IRELAND   (Ireland)

Author keywords

Genetic algorithm parameter adaptation; healthy population diversity

Indexed keywords

ADAPTIVE CROSSOVERS; ADAPTIVE OPERATORS; ALGORITHM PARAMETERS; CROSSOVER AND MUTATION; DIVERSITY PERFORMANCE; EXPLORATION AND EXPLOITATION; FITNESS LANDSCAPE; HEALTHY INDIVIDUALS; HEALTHY POPULATION; MULTIMODAL BENCHMARK; MULTIMODAL FITNESS LANDSCAPES; NOVEL GENETIC ALGORITHM; SELECTION MECHANISM; SELECTION PARAMETERS; SELECTION PRESSURES; STANDARD POPULATION; TOURNAMENT SELECTION;

GENETIC ALGORITHMS; GEOMORPHOLOGY; MATHEMATICAL OPERATORS;

HEALTH;

EID: 80054704800     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2010.2046173     Document Type: Article

References (58)

1. A. Eiben and J. Smith, "Multi-modal problems and spatial distribution," in Introduction to Evolutionary Computing. Berlin, Germany: Springer, 2003, pp. 153-172.
2. J. Holland, "Reproductive plans and genetic operators," in Adaptation in Natural and Artificial Systems, ch. 6. Cambridge, MA: MIT Press, 1992, pp. 89-118.
3. D. Whitley, "The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best," in Proc. 3rd Int. Conf. Genetic Algorithms, vol. 1. 1989, pp. 116-121.
4. A. Eiben, R. Hinterding, and Z. Michalewicz, "Parameter control in evolutionary algorithms," IEEE Trans. Evol. Comput., vol. 3, no. 2, pp. 124-141, Jul. 1999.
5. K. Zhu, "A diversity-controlling adaptive genetic algorithm for the vehicle routing problem with time windows," in Proc. 15th IEEE Int. Conf. Tools Artif. Intell., 2003, pp. 176-183.
6. R. Ursem, "Diversity-guided evolutionary algorithms," in Proc. 7th PPSN, vol. 2439. 2002, pp. 462-471.
7. H. Shimodaira, "A diversity-control-oriented genetic algorithm (DCGA): Performance in function optimization," in Proc. Congr. Evol. Comput. (CEC), vol. 1. 2001, pp. 44-51. (Pubitemid 32806317)
8. D. Goldberg and K. Deb, "A comparative analysis of selection schemes used in genetic algorithms," in Proc. Foundations Genetic Algorithms, vol. 1. 1991, pp. 69-93.
9. J. Hooker, "Testing heuristics: We have it all wrong," J. Heuristics, vol. 1, no. 1, pp. 33-42, 1995.
10. G. Greenwood, "So many algorithms. So little time," ACM SIGSOFT Softw. Eng. Notes, vol. 22, no. 2, pp. 92-93, 1997.
11. S. Mahfoud, "Niching methods for genetic algorithms," Ph.D. dissertation, Dept. General Eng., Univ. Illinois at Urbana-Champaign, Champaign, IL, 1996.
12. K. De Jong, "Analysis of the behavior of a class of genetic adaptive systems," Ph.D. dissertation, Dept. Comput. Commun. Sci., Univ. Michigan, Ann Arbor, 1975.
13. L. Chambers, "The Boltzman selection procedure," in Practical Handbook of Genetic Algorithms: New Frontiers, vol. 2, ch. 5. Boca Raton, FL: CRC Press, 1995, pp. 111-139.
14. L. Eshelman, "The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination," in Proc. Foundations Genetic Algorithms, vol. 1. 1991, pp. 265-283.
15. D. Goldberg and J. Richardson, "Genetic algorithms with sharing for multimodal function optimization," in Proc. 2nd Int. Conf. Genetic Algorithms Their Applicat., 1987, pp. 41-49.
16. I. Rechenberg, Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Stuttgart, Germany: Frommann-Holzboog, 1973.
17. D. Liu and S. Feng, "A novel adaptive genetic algorithms," in Proc. Int. Conf. Mach. Learn. Cybern., vol. 1. 2004, pp. 414-416.
18. P. Palmes, T. Hayasaka, and S. Usui, "Mutation-based genetic neural network," IEEE Trans. Neural Netw., vol. 16, no. 3, pp. 587-600, May 2005. (Pubitemid 40718005)
19. R. Krohling, Y. Zhou, and A. Tyrrell, "Evolving FPGA-based robot controllers using an evolutionary algorithm," in Proc. 1st Int. Conf. Artif. Immune Syst., 2002, pp. 41-46.
20. D. Thierens, "Adaptive mutation rate control schemes in genetic algorithms," in Proc. Congr. Evol. Comput., 2002, pp. 980-985.
21. H. Hagras, A. Pounds-Cornish, M. Colley, V. Callaghan, and G. Clarke, "Evolving spiking neural network controllers for autonomous Robots," in Proc. IEEE Int. Conf. Robotics Automat., vol. 5. 2004, pp. 4620-4626.
22. J. Zhang, H. Chung, and W. Lo, "Clustering-based adaptive crossover and mutation probabilities for genetic algorithms," IEEE Trans. Evol. Comput., vol. 11, no. 3, pp. 326-335, Jun. 2007. (Pubitemid 46895411)
23. S. Yuen and C. Chow, "A genetic algorithm that adaptively mutates and never revisits," IEEE Trans. Evol. Comput., vol. 13, no. 2, pp. 454-472, Apr. 2009.
24. M. Srinivas and L. Patnaik, "Adaptive probabilities of crossover and mutation in genetic algorithms," IEEE Trans. Syst., Man, Cybern., vol. 24, no. 4, pp. 656-667, Apr. 1994.
25. Z. Liu, J. Zhou, and S. Lai, "New adaptive genetic algorithm based on ranking," in Proc. Int. Conf. Mach. Learn. Cybern., vol. 3. 2003, pp. 1841-1844.
26. T. Kuo and S. Hwang, "A genetic algorithm with disruptive selection," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 26, no. 2, pp. 299-307, Apr. 1996. (Pubitemid 126777782)
27. M. Affenzeller and S. Wagner, "Offspring selection: A new self-adaptive selection scheme for genetic algorithms," in Proc. Int. Conf. Adapt. Natural Comput. Algorithms, 2005, pp. 218-221.
28. A. Eiben, A. de Wilde, and M. Schut, "Boosting genetic algorithms with self-adaptive selection," in Proc. IEEE Conf. Evol. Comput., 2006, pp. 477-482. (Pubitemid 47130537)
29. A. Eiben, M. Schut, and A. de Wilde, "Is self-adaptation of selection pressure and population size possible? A case study," in Proc. 9th Parallel Problem Solving Nature (PPSN), vol. 4193. 2006, pp. 900-909. (Pubitemid 44609466)
30. P. Vajda, A. Eiben, and W. Hordijk, "Parameter control methods for selection operators in genetic algorithms," in Proc. 10th Parallel Problem Solving Nature (PPSN), 2008, pp. 620-630.
31. A. Cioppa, C. De Stefano, and A. Marcelli, "Where are the niches? Dynamic fitness sharing," IEEE Trans. Evol. Comput., vol. 11, no. 4, pp. 453-465, Aug. 2007. (Pubitemid 47250402)
32. S. Mahfoud, "Crowding and preselection revisited," in Proc. 2nd Parallel Problem Solving Nature (PPSN), 1992, pp. 27-36.
33. C. Jassadapakorn and P. Chongstitvatana, "Diversity control to improve convergence rate in genetic algorithms," in Proc. 4th Int. Conf. Intell. Data Eng. Automat. Learn. (IDEAL), 2003, pp. 421-425. (Pubitemid 36996117)
34. M. Lozano, F. Herrera, and J. Cano, "Replacement strategies to maintain useful diversity in steady-state genetic algorithms," Soft Comput.: Methodologies Applicat., vol. 32, pp. 85-96, May 2006.
35. V. Koumousis and C. Katsaras, "A saw-tooth genetic algorithm combining the effects of variable population size and reinitialization to enhance performance," IEEE Trans. Evol. Comput., vol. 10, no. 1, pp. 19-28, Feb. 2006. (Pubitemid 43174982)
36. M. Rocha and J. Neves, "Preventing premature convergence to local optima in genetic algorithms via random offspring generation," in Proc. 12th Int. Conf. Ind. Eng. Applicat. Artif. Intell. Expert Syst., vol. 1611. 1999, pp. 127-136.
37. M. Laumanns, L. Thiele, K. Deb, and E. Zitzler, "Combining convergence and diversity in evolutionary multiobjective optimization," Evol. Comput., vol. 10, no. 3, pp. 263-282, 2002.
38. T. Back and F. Homeister, "Extended selection mechanisms in genetic algorithms," in Proc. 4th Int. Conf. Genetic Algorithms, 1991, pp. 92-99.
39. D. Curran, C. O'Riordan, and H. Sorensen, "The effects of lifetime learning on the diversity and fitness of populations," in Proc. 9th Ann. Conf. Genetic Evol. Comput., 2007, p. 337. (Pubitemid 47291535)
40. J. Grefenstette, "Optimization of control parameters for genetic algorithms," IEEE Trans. Syst., Man, Cybern., vol. 16, no. 1, pp. 122-128, Jan. 1986.
41. J. Schaffer, R. Caruana, L. Eshelman, and R. Das, "A study of control parameters affecting online performance of genetic algorithms for function optimization," in Proc. 3rd Int. Conf. Genetic Algorithms, 1989, pp. 51-60.
42. T. Blickle and L. Thiele, "A mathematical analysis of tournament selection," in Proc. 6th Int. Conf. Genet. Algorithms, 1995, pp. 9-16.
43. D. Goldberg, K. Deb, and J. Horn, "Massive multimodality, deception, and genetic algorithms," in Proc. 2nd Parallel Problem Solving Nature (PPSN), vol. 51. 1992, p. 61801.
44. X. Du, Y. Li, W. Chen, Y. Zhang, and D. Yao, "A Markov random field based hybrid algorithm with simulated annealing and genetic algorithm for image segmentation," in Advances in Natural Computation, LNCS 4221. Berlin, Germany: Springer-Verlag, 2006, pp. 706-715. (Pubitemid 44617956)
45. K. Srinivasa, K. Venugopal, and L. Patnaik, "A self-adaptive migration model genetic algorithm for data mining applications," Inf. Sci., vol. 177, no. 20, pp. 4295-4313, 2007. (Pubitemid 47069319)
46. D. Zhang, Q. Chen, and L. Wei, "Building behavior scoring model using genetic algorithm and support vector machines," in Proc. Int. Conf. Comput. Sci. (ICCS), LNCS 4488. 2007, pp. 482-485.
47. R. Poli, "Tournament selection, iterated coupon-collection problem, and backward-chaining evolutionary algorithms," in Proc. Foundations Genetic Algorithms, vol. 3469. 2005, pp. 132-155. (Pubitemid 41313311)
48. K. Deb and D. Goldberg, "An investigation of niche and species formation in genetic function optimization," in Proc. 3rd Int. Conf. Genetic Algorithms, 1989, pp. 42-50.
49. J. Horn and D. Goldberg, "Genetic algorithm difficulty and the modality of fitness landscapes," in Proc. 3rd Foundations Genetic Algorithms, 1994, pp. 243-269.
50. R. Brits, A. Engelbrecht, and F. Van den Bergh, "Locating multiple optima using particle swarm optimization," Appl. Math. Comput., vol. 189, no. 2, pp. 1859-1883, 2007. (Pubitemid 46802795)
51. G. Singh, "Comparison of multimodal optimization algorithms based on evolutionary algorithms," in Proc. 8th Ann. Conf. Genetic Evol. Comput., 2006, pp. 1305-1312. (Pubitemid 44611466)
52. S. Bird and X. Li, "Adaptively choosing niching parameters in a PSO," in Proc. 8th Ann. Conf. Genetic Evol. Comput., 2006, pp. 3-10.
53. G. Dick, P. Whigham, and N. Dunedin, "A weighted local sharing technique for multimodal optimization," in Proc. 7th Int. Conf. Simulated Evol. Learn., 2008, pp. 452-461.
54. D. Beasley, D. Bull, and R. Martin, "A sequential niche technique for multimodal function optimization," Evol. Comput., vol. 1, no. 2, pp. 101-125, 1993.
55. D. Montgomery, "Experiments with a single factor: The analysis of variance," in Design and Analysis of Experiments, ch. 3. New York: Wiley, 2006, pp. 60-114.
56. W. Kruskal and W. Wallis, "Use of ranks in one-criterion variance analysis," J. Am. Stat. Assoc., vol. 47, no. 260, pp. 583-621, 1952.
57. ACROMUSE-Statistical-Analysis-Results [Online]. Available: http://sites.google.com/site/brianmcginley/
58. D. Wolpert and W. Macready, "No free lunch theorems for search," IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 67-82, Apr. 1997.