The Journal of Supercomputing

, Volume 63, Issue 3, pp 816–835 | Cite as

Cellular genetic algorithms without additional parameters

Article

Abstract

Cellular genetic algorithms (cGAs) are a kind of genetic algorithms (GAs) with decentralized population in which interactions among individuals are restricted to close ones. The use of decentralized populations in GAs allows to keep the population diversity for longer, usually resulting in a better exploration of the search space and, therefore, in a better performance of the algorithm. However, it supposes the need of several new parameters that have a major impact on the behavior of the algorithm. In the case of cGAs, these parameters are the population and neighborhood shapes. We propose in this work two innovative cGAs with new adaptive techniques that allow removing the neighborhood and population shape from the algorithm’s configuration. As a result, the new adaptive cGAs are highly competitive (statistically) with all the compared cGAs in terms of the average solutions found in the continuous and combinatorial domains, while finding, in general, the best solutions for the considered problems, and with less computational effort.

Keywords

Adaptive algorithms Cellular populations Evolutionary algorithm 

References

  1. 1.
    Alba E, Dorronsoro B (2005) The exploration/exploitation tradeoff in dynamic cellular evolutionary algorithms. IEEE Trans Evol Comput 9(2):126–142 CrossRefGoogle Scholar
  2. 2.
    Alba E, Dorronsoro B (2008) Cellular genetic algorithms. Operations research/computer science interfaces. Springer, Heidelberg Google Scholar
  3. 3.
    Alba E, Dorronsoro B, Giacobini M, Tomassini M (2006) Decentralized cellular evolutionary algorithms. In: Handbook of bioinspired algorithms and applications. CRC Press, Boca Raton, pp 103–120 Google Scholar
  4. 4.
    Alba E, Tomassini M (2002) Parallelism and evolutionary algorithms. IEEE Trans Evol Comput 6(5):443–462 CrossRefGoogle Scholar
  5. 5.
    Alba E, Troya J (2000) Cellular evolutionary algorithms: evaluating the influence of ratio. In: Parallel problem solving from nature. Springer, Berlin, vol 1917, pp 29–38 Google Scholar
  6. 6.
    Alba E, Troya J (2002) Improving flexibility and efficiency by adding parallelism to genetic algorithms. Soft Comput 12(2):91–114 MathSciNetGoogle Scholar
  7. 7.
    Bäck T, Fogel D, Michalewicz Z (eds) (1997) Handbook of evolutionary computation. Oxford University Press, London MATHGoogle Scholar
  8. 8.
    Deb K, Goyal M (1996) A combined genetic adaptive search (GeneAS) for engineering design. Comput Sci Inform 26(4):30–45 Google Scholar
  9. 9.
    Dorronsoro B, Bouvry P (2011) Adaptive neighborhoods for cellular genetic algorithms. In: Nature inspired distributed computing (NIDISC). IEEE Press, New York, pp 383–389 Google Scholar
  10. 10.
    Eshelman L, Schaffer J (1993) Real coded genetic algorithms and interval schemata. In: Foundations of genetic algorithms (FOGA). Morgan-Kaufmann, San Mateo, pp 187–202 Google Scholar
  11. 11.
    García S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’05 special session on real parameter optimization. J Heuristics 15:617–644 MATHCrossRefGoogle Scholar
  12. 12.
    Glover F, Kochenberger G (eds) (2003) Handbook of metaheuristics. International series in operations research management science. Kluwer Academic, Dordrecht MATHGoogle Scholar
  13. 13.
    Luque G, Alba E, Dorronsoro B (2009) Optimization techniques for solving complex problems. In: Analyzing parallel cellular genetic algorithms, pp 49–62 Google Scholar
  14. 14.
    Manderick B, Spiessens P (1989) Fine-grained parallel genetic algorithm. In: Third int conf on genetic algorithms ICGA-3. Morgan-Kaufmann, San Mateo, pp 428–433 Google Scholar
  15. 15.
    Olariu S, Zomaya A (eds) (2006) Handbook of bioinspired algorithms and applications. CRC Press, Boca Raton MATHGoogle Scholar
  16. 16.
    Pinel F, Dorronsoro B, Bouvry P (2012) Solving very large instances of the scheduling of independent tasks problem on the GPU. J Parallel Distrib Comput. To appear, ISSN 0743-7315 Google Scholar
  17. 17.
    Pinel F, Dorronsoro B, Bouvry P (2010) A new parallel asynchronous cellular genetic algorithm for scheduling in grids. In: Nature insp distr comp, p 206b Google Scholar
  18. 18.
    Sarma J, De Jong K (1996) An analysis of the effect of the neighborhood size and shape on local selection algorithms. In: Parallel problem solving from nature (PPSN-IV). LNCS, vol 1141. Springer, Berlin, pp 236–244 Google Scholar
  19. 19.
    Whitley D (1993) Cellular genetic algorithms. In: Int conf on genetic algs, p 658 Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.Interdisciplinary Centre for Security, Reliability and TrustUniversity of LuxembourgLuxembourgLuxembourg
  2. 2.Faculty of Sciences, Technology, and CommunicationsUniversity of LuxembourgLuxembourgLuxembourg

Personalised recommendations