Abstract
A novel genetic operator, the plagiarism operator, is introduced for evolutionary design and optimisation. This operator is analogous in some respects to crossover and to biological transposition. Plagiarism is shown to be theoretically superior to uniform mutation for generalised counting-ones problems, and also to outperform uniform mutation on certain classes of random fitness landscapes. Experimental results are presented showing that plagiarism speeds up the artificial evolution of certain digital logic circuits. The performance of this operator is interpreted in terms of the non-uniform distribution of genetic primitives in good solutions for certain problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. J. Angeline and J. B. Pollack, “Evolutionary module acquisition,” in Proceedings of the Second Annual Conference on Evolutionary Programming, D. Fogel and W. Atmar (Eds.), La Jolla, CA, USA, 1993, pp. 154–163.
J. A. Bailey, G. Liu, and E. E. Eichler, “An alu transposition model for the origin and expansion of human segmental duplications,” American Journal of Human Genetics vol. 73, pp. 823–34, 2003.
B. Efron and G. Gong, “A leisurely look at the bootstrap, the jackknife, and cross-validation,” The American Statistician vol. 37, pp. 36–48, 1983.
J. V. Hansen, “Genetic programming experiments with standard and homologous crossover methods,” Genetic Programming and Evolvable Machines vol. 4, no. 1, pp. 53–66, 2003.
J. R. Koza, Genetic Programming II: Automatic Discovery of Reusable Programs, MIT Press, 1994.
J. Miller, “What bloat? Cartesian genetic programming on boolean problems,” in Late Breaking Papers, Proceedings of the 3rd Genetic and Evolutionary Computation Conference (GECCO'01), 2001, pp. 295–302.
J. F. Miller, D. Job, and V. K. Vassilev, “Principles in the evolutionary design of digital circuits,” Part I’, Journal of Genetic Programming and Evolvable Machines vol. 1, no. 1, pp. 8–35, 2000.
J. F. Miller, T. Kalganova, N. Lipnitskaya, and D. Job, “The genetic algorithm as a discovery engine: Strange circuits and new principles,” in Proceedings of the AISB Symposium on Creative Evolutionary Systems (CES'99), 1999, pp. 65–74.
T. Naemura, T. Hashiyama, and S. Okuma, ‘Module Generation for Genetic Programming and Its Incremental Evolution,’ in Second Asia-Pacific Conference on Simulated Evolution and Learning, C. Newton (Ed.), Australian Defence Force Academy, Canberra, Australia, 1998
S. Ohno, “Evolution by Gene Duplication”, Springer Verlag, 1970.
J. P. Rosca, “Hierarchical learning with procedural abstraction mechanisms,” Ph.D. thesis, Department of Computer Science, The College of Arts and Sciences, University of Rochester, Rochester, NY 14627, USA, 1997.
A. Simoes and E. Costa, “Enhancing transposition performance,” in Proceedings of the 1999 Congress on Evolutionary Computation (CEC 99), Washington, USA, 1999a, pp. 1434–1441.
A. B. Simoes and E. Costa, “Transposition versus crossover: An empirical study,” in: Proceedings of the Genetic and Evolutionary Computation Conference, W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith (Eds.) vol. 1, Orlando, Florida, USA, 1999b, pp. 612–619.
A. Simoes and E. Costa, “Using genetic algorithms with asexual transposition,” in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO' 2000), D. Whitley, D. Goldberg, L. S. E. CantúPaz, I. Parmee, and H. Beyer (Eds.), Las Vegas, USA, 2000, pp. 323–330.
L. Spector, “Evolving control structures with automatically defined macros,” in Working Notes for the AAAI Symposium on Genetic Programming, E. V. Siegel and J. R. Koza (Eds.), MIT, Cambridge, MA, USA, 1995, pp. 99–105.
A. Thompson, “An evolved circuit, intrinsic in silicon, entwined with physics,” in Proc. 1st Int. Conf. on Evolvable Systems (ICES'96), T. Higuchi, M. Iwata, and L. Weixin (Eds.), vol. 1259 of LNCS, 1997, pp. 390–405.
A. Thompson, P. Layzell, and R. S. Zebulum, “Explorations in design space: Unconventional electronics design through artificial evolution,” IEEE Trans. Evol. Comp. vol. 3, no. 3, pp. 167–196, 1999.
G. Urbanek, “Factors having an effect on quality and cost of solution in identification of inverse models with the application of genetic algorithms,” in Presented at AI-METH 2003: Methods of Artificial Intelligence, 2003.
V. K. Vassilev, T. C. Fogarty, and J. F. Miller, “Smoothness, ruggedness and neutrality of fitness landscapes: From theory to application,” in Theory and Application of Evolutionary Computation: Recent Trends, A. Ghosh and S. Tsutsui (Eds.), Springer-Verlag, 2000.
M. S. Voss and C. M. Foley, “Evolutionary algorithm for structural optimization” in Proceedings of the Genetic and Evolutionary Computation Conference, W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith (Eds.) Orlando, Florida, USA, vol. 1, 1999, pp. 678–685.
J. A. Walker and J. F. Miller, “Evolution and acquisition of modules in cartesian genetic programming,” in Genetic Programming 7th European Conference, EuroGP 2004, Proceedings, M. Keijzer, U.-M. O'Reilly, S. M. Lucas, E. Costa, and T. Soule (Eds.) vol. 3003 of LNCS, Coimbra, Portugal, 2004, pp. 187–197.
D. H. Wolpert and W. G. Macready, “No free lunch theorems for search,” Technical Report SFI-TR-95-02-010, Santa Fe, NM, 1995.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by: Riccardo Poli
Rights and permissions
About this article
Cite this article
McGregor, S., Harvey, I. Embracing Plagiarism: Theoretical, Biological and Empirical Justification for Copy Operators in Genetic Optimisation. Genet Program Evolvable Mach 6, 407–420 (2005). https://doi.org/10.1007/s10710-005-4804-9
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s10710-005-4804-9