Skip to main content
Springer Nature Link
Log in

Parallel evolution using multi-chromosome cartesian genetic programming

  • Original Paper
  • Published:
Genetic Programming and Evolvable Machines Aims and scope Submit manuscript

Abstract

Parallel and distributed methods for evolutionary algorithms have concentrated on maintaining multiple populations of genotypes, where each genotype in a population encodes a potential solution to the problem. In this paper, we investigate the parallelisation of the genotype itself into a collection of independent chromosomes which can be evaluated in parallel. We call this multi-chromosomal evolution (MCE). We test this approach using Cartesian Genetic Programming and apply MCE to a series of digital circuit design problems to compare the efficacy of MCE with a conventional single chromosome approach (SCE). MCE can be readily used for many digital circuits because they have multiple outputs. In MCE, an independent chromosome is assigned to each output. When we compare MCE with SCE we find that MCE allows us to evolve solutions much faster. In addition, in some cases we were able to evolve solutions with MCE that we unable to with SCE. In a case-study, we investigate how MCE can be applied to to a single objective problem in the domain of image classification, namely, the classification of breast X-rays for cancer. To apply MCE to this problem, we identify regions of interest (RoI) from the mammograms, divide the RoI into a collection of sub-images and use a chromosome to classify each sub-image. This problem allows us to evaluate various evolutionary mutation operators which can pairwise swap chromosomes either randomly or topographically or reuse chromosomes in place of other chromosomes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Notes

  1. The CGP website is currently under construction and can be found at http://www.cartesiangp.co.uk.

References

  1. Center for Health Care Technologies Livermore. Lawrence Livermore National Library/UCSF Digital Mammogram Database. Livermore, CA, 1995

  2. D. Andre, A. Teller, Evolving team darwin united, in RoboCup-98: Robot Soccer World Cup II, ed. by M. Asada, H. Kitano (Springer, 1999), pp. 346–351

  3. R. Cavill, Multi-chromosomal genetic programming. PhD thesis, Department of Electronics, University of York, UK, 2006

  4. R. Cavill, S.L. Smith, A.M. Tyrrell, Multi-chromosomal genetic programming, in Proceedings of the 2005 Genetic and Evolutionary Computation Conference (GECCO), vol. 2 (ACM Press, Washington DC, 2005), pp. 1649–1656

  5. R. Cavill, S.L. Smith, A.M. Tyrrell, The performance of polyploid evolutionary algorithms is improved both by having many chromosomes and by having many copies of each chromosome on symbolic regression problems, in Proceedings of the 2005 Congress on Evolutionary Computation Conference (CEC), vol. 1 (2005), pp. 935–941

  6. R. Chow, Genotype to phenotype mappings with a multiple-chromosome genetic algorithm, in Proceedings of the 2004 Genetic and Evolutionary Computation Conference (GECCO), vol. 3102 of LNCS (Springer, Seattle, 2004), pp. 1006–1017

  7. S. Christensen, F. Oppacher, An analysis of koza’s computational effort statistic for genetic programming, in Proceedings of the 5th European Conference on Genetic Programming (EuroGP), vol. 2278 of Lecture notes in computer science (Springer, 2002), pp. 182–191

  8. J. Clegg, J.A. Walker, J.F. Miller, A new crossover technique for cartesian genetic programming, in Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO) (ACM Press, 2007), pp. 1580–1587

  9. P. Collet, E. Lutton, F. Raynal, M. Schoenauer, Polar IFS + parisian genetic programming = efficient IFS inverse problem solving. Genet. Program. Evolvable Mach. 1(4), 339–361 (2000)

    Article  MATH  Google Scholar 

  10. D. Corne, E. Collingwood, P. Ross, Investigating multiploidy’s niche, in Evolutionary computing: selected papers from the AISB workshop, vol. 1143 of LNCS (Springer, Brighton, 1996), pp. 189–197

  11. D.B. Fogel, Evolving artificial intelligence. PhD thesis, University of California, San Diego (1992)

  12. L.J. Fogel, A.J. Owens, M.J. Walsh, Artificial Intelligence Through Simulated Evolution (Wiley, New York, 1966)

    MATH  Google Scholar 

  13. J.C. Fu, et al., Image segmentation feature selection and pattern classification for mammographic microcalcifications. Comput. Med. Imaging. Graph. 29(6), 419–429 (2005)

    Article  Google Scholar 

  14. T. Haynes, S. Sen, D. Schoenefeld, R. Wainwright, in Working Notes for the AAAI Symposium on Genetic Programming. Evolving a Team (Cambridge, AAAI, 1995)

  15. D.W. Hillis, Co-evolving parasites improve simulated evolution in an optimization procedure. Physica D 42, 228–234 (1990)

    Article  Google Scholar 

  16. J. Jiang, B. Yao, A. Wason, A genetic algorithm design for microcalcification detection and classification in digital mammograms. Comput. Med. Imaging. Graph. 31(1), 49–61 (2007)

    Article  Google Scholar 

  17. J.R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection (MIT Press, Cambridge, 1992)

    MATH  Google Scholar 

  18. S. Lee, C. Lo, C. Wang, P. Chung, C. Chang, C. Yang, P. Hsu, A computer-aided design mammography screening system for detection and classification of microcalcifications. Int. J. Med. Inform. 60(1), 29–57 (2000)

    Article  Google Scholar 

  19. S. Luke, C. Hohn, J. Farris, G. Jackson, J. Hendler, in RoboCup-97: Robot Soccer World Cup I, ed. by H. Kitano. Co-evolving soccer softbot team coordination with genetic programming (Springer, New York, 1997), pp. 398–411

  20. S. Luke, L. Spector, in Proceedings of the 1st Annual Workshop on Genetic Programming (GP). Evolving Teamwork and Coordination with Genetic Programming (MIT Press, Stanford University, CA, 28–31, 1996), pp. 150–156

  21. H.B. Mann, D.R. Whitney, On a test of whether one of 2 random variables is stochastically larger than the other. Ann. Math. Stat. 18, 50–60 (1947)

    Article  MATH  MathSciNet  Google Scholar 

  22. H.A. Mayer, M. Spitzlinger, in Proceedings of the 2003 Congress on Evolutionary Computation Conference (CEC). Multi-chromosomal Representations and Chromosome Shuffling in Evolutionary Algorithms (IEEE Press, Canberra, 2003), pp. 1145–1149

  23. J.F. Miller, in Proceedings of the 1999 Genetic and Evolutionary Computation Conference (GECCO). An Empirical Study of the Efficiency of Learning Boolean Functions using a Cartesian Genetic Programming Approach (Morgan Kaufmann, Orlando, 1999), pp. 1135–1142

  24. J.F. Miller, D. Job, V.K. Vassilev, Principles in the evolutionary design of digital circuits—part I. Genet. Program. Evolvable Mach. 1(1), 8–35 (2000)

    Article  Google Scholar 

  25. J.F. Miller, S.L. Smith, Redundancy and computational efficiency in cartesian genetic programming. IEEE Trans. Evol. Comput. 10(2), 167–174 (2006)

    Article  Google Scholar 

  26. J.F. Miller, P. Thomson, in Proceedings of the 3rd European Conference on Genetic Programming (EuroGP 2000), vol. 1802 of Lecture Notes in Computer Science. Cartesian Genetic Programming (Springer, Edinburgh, 2000), pp. 121–132

  27. J.F. Miller, P. Thomson, T.C. Fogarty, in Genetic Algorithms and Evolution Strategies in Engineering and Computer Science: Recent Advancements and Industrial Applications. Designing Electronic Circuits Using Evolutionary Algorithms. Arithmetic Circuits: A Case Study (1997)

  28. J. Niehaus, W. Banzhaf, in Proceedings of the Fifth European Conference on Genetic Programming (EuroGP), vol. 2610 of Lecture Notes in Computer Science. More on Computational Effort Statistics for Genetic Programming (Springer, 2003), pp. 164–172

  29. R. Nishikawa, Current status and future directions of computer-aided diagnosis in mammography. Comput. Med. Imaging Graph. 31, 224–235 (2007)

    Article  Google Scholar 

  30. M. Oltean, C. Grosan, in Proceedings of the 2004 NASA/DoD Conference on Evolvable Hardware. Evolving Digital Circuits Using Multi Expression Programming (IEEE Press, Seattle, 2004), pp. 87–90

  31. M. Oltean, C. Grosan, M. Oltean, in International Conference on Computational Science. Encoding Multiple Solutions in a Linear Genetic Programming Chromosome (2004), pp. 1281–1288

  32. M. Oltean, C. Grosan, M. Oltean, in Proceedings of the 4th International Conference on Computational Science (ICCS), vol. 3038 of LNCS. Evolving Digital Circuits for the Knapsack Problem (Springer, Krakow 2004), pp. 1257–1264

  33. C. Ryan, in In AAAI Fall Symposium Series on Genetic Programming Working Notes. GP Robots and GP Teams: Competition, Co-evolution and Co-operation in Genetic Programming (AAAI, 1995), pp. 86–93

  34. H. Schwefel, Kybernetische evolution als strategie der experimentelen forschung in der stromungstechnik. Master’s thesis, Technical University Berlin (1965)

  35. T. Soule, in Proceedings of the 1999 Genetic and Evolutionary Computation Conference (GECCO). Voting Teams: A Cooperative Approach to Non-typical Problems Using Genetic Programming (Morgan Kaufmann, San Francisco, 1999), pp. 916–922

  36. T. Soule, in Proceedings of the 2000 Genetic and Evolutionary Computation Conference (GECCO). Heterogeneity and Specialization in Evolving Teams, pp. 778–785

  37. J. Torresen, in Proceedings of the 5th International Conference on Evolvable Systems (ICES), vol. 2606 of Lecture Notes in Computer Science. Evolving Multiplier Circuits by Training set and Training Vector Partitioning (Springer, Trondheim, 2003), pp. 228–237

  38. C. Van Rijsbergen. Information Retrieval. Butterworths (1979)

  39. V.K. Vassilev, J.F. Miller, in Proceedings of the 3rd International Conference on Evolvable Systems (ICES), vol. 1801 of Lecture Notes in Computer Science. The Advantages of Landscape Neutrality in Digital Circuit Evolution (Springer, 2000), pp. 252–263

  40. G. Veni, E. Regentova, L. Zhang, Detection of clustered microcalcifications with susan edge detector, adaptive contrast thresholding and spatial filters, vol. 5112 of LNCS, pp. 837–843 (2008)

  41. J.A. Walker, J.F. Miller, in Proceedings of the 7th European Conference on Genetic Programming (EuroGP), vol. 3003 of Lecture Notes in Computer Science. Evolution and acquisition of modules in cartesian genetic programming (Springer, 2004), pp. 187–197

  42. J.A. Walker, J.F. Miller, in Proceedings of the 2005 International Conference on Evolvable Systems (ICES), vol. 3637 of Lecture Notes in Computer Science. Improving the Evolvability of Digital Multipliers using Embedded Cartesian Genetic Programming and Product Reduction (Springer, 2005), pp. 131–142

  43. J.A. Walker, J.F. Miller, in Proceedings of the 2005 Genetic and Evoluationary Computation Conference (GECCO), vol. 2. Investigating the Performance of Module Acquisition in Cartesian Genetic Programming (ACM Press, 2005), pp 1649–1656

  44. J.A. Walker, J.F. Miller. Automatic acquisition, evolution and re-use of modules in cartesian genetic programming. to be published in IEEE Trans. Evol. Comput. (2008)

  45. M. Walker, H. Edwards, C. Messom, in Proceedings of the 10th European Conference on Genetic Programming (EuroGP), vol. 4445 of Lecture Notes in Computer Science. Confidence intervals for computational effort comparisons (Springer, 2007), pp. 23–32

  46. M. Walker, H. Edwards, C. Messom, in Proceedings of the 2007 Genetic and Evolutionary Computation Conference (GECCO). The Reliability of Confidence Intervals for Computational Effort Comparisons (ACM, 2007), pp. 1716–1723

  47. F. Wilcoxon, Individual comparisons by ranking methods. Biomet. Bull. 1, 80–83 (1945)

    Article  Google Scholar 

  48. T. Yu, J.F. Miller, in Proceedings of the 4th European Conference on Genetic Programming (EuroGP), vol. 2038 of Lecture Notes in Computer Science. Neutrality and the Evolvability of Boolean Function Landscape (Springer, 2001), pp. 204–217

  49. T. Yu, J.F. Miller, in Proceedings of the 5th European Conference on Genetic Programming (EuroGP), vol. 2278 of Lecture Notes in Computer Science. Finding needles in haystacks is not hard with neutrality (Springer, 2002), pp. 13–25

Download references

Acknowledgments

The authors would like to thank Eddy Munday for his work in preparing the regions of interest from the mammograms used in the experimental work described in this paper.

Author information

Authors and Affiliations

  1. Intelligent Systems Group, Department of Electronics, University of York, Heslington, York, YO10 5DD, UK

    James Alfred Walker, Katharina Völk, Stephen L. Smith & Julian Francis Miller

Authors
  1. James Alfred Walker
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Katharina Völk
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Stephen L. Smith
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Julian Francis Miller
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to James Alfred Walker.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Walker, J.A., Völk, K., Smith, S.L. et al. Parallel evolution using multi-chromosome cartesian genetic programming. Genet Program Evolvable Mach 10, 417–445 (2009). https://doi.org/10.1007/s10710-009-9093-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10710-009-9093-2

Keywords