Abstract
This paper presents and examines the behaviour of a system whereby the rules governing local search within a Memetic Algorithm are co-evolved alongside the problem representation. We describe the rationale for such a system, and the implementation of a simple version in which the evolving rules are encoded as (condition:action) patterns applied to the problem representation, and are effectively self-adapted. We investigate the behaviour of the algorithm on a test suite of problems, and show significant performance improvements over a simple Genetic Algorithm, a Memetic Algorithm using a fixed neighbourhood function, and a similar Memetic Algorithm which uses random rules, i.e. with the learning mechanism disabled.
Analysis of these results enables us to draw some conclusions about the way that even the simplified system is able to discover and exploit different forms of structure and regularities within the problems. We suggest that this “meta-learning” of problem features provides a means both of creating highly scaleable algorithms, and of capturing features of the solution space in an understandable form.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Merz, P., Freisleben, B.: A comparion of Memetic Algorithms, Tabu Search, and ant colonies for the quadratic assignment problem. In: Proceedings of the 1999 Congress on Evolutionary Computation, IEEE Service Center (1999) 2063–2070
Vavak, F., Fogarty, T., Jukes, K.: A genetic algorithm with variable range of local search for tracking changing environments. In Voigt, H. M., Ebeling, W., I. Rechenberg, Schwefel, H. P., eds.: Proceedings of the Fourth Conference on Parallel Problem Solving from Nature, Springer Verlag (1996) 376–385
Knowles, J., Corne, D.: A comparative assessment of memetic, evolutionary and constructive algorithms for the multi-objective d-msat problem. In: Gecco-2001 Workshop Program. (2001) 162–167
Moscato, P.: Memetic algorithms’ home page. Technical report, http://www.densis.fee.unicamp.br/~moscato/memetic home.html (2002)
Hart, W. E.: Adaptive Global Optimization with Local Search. PhD thesis, University of California, San Diego (1994)
Jones, T.: Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, The University of New Mexico, Albuquerque, NM (1995)
Merz, P., Freisleben, B.: Fitness landscapes and memetic algorithm design. In Corne, D., Dorigo, M., Glover, F., eds.: New Ideas in Optimization, McGraw Hill (1999) 245–260
Krasnogor, N., Smith, J.: Emergence of profitiable search strategies based on a simple inheritance mechanism. In Spector, L., Goodman, E., Wu, A., Langdon, W. B., Voigt, H. M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M., Burke, E., eds.: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2001, Morgan Kaufmann (2001) 432–439
Hansen, P., Mladenović, N.: An introduction to variable neighborhood search. In Voβ, S., Martello, S., Osman, I. H., Roucairol, C., eds.: Meta-Heuristics: Advances and trends in local search paradigms for optimization. Proceedings of MIC 97 Conference. Kluwer Academic Publishers, Dordrecht, The Netherlands (1998)
Schwefel, H. P.: Numerical Optimisation of Computer Models. John Wiley and Sons, New York (1981)
Fogel, D.: Evolving Artificial Intelligence. PhD thesis, University of California (1992)
Back, T.: Self adaptation in genetic algorithms. In Varela, F., Bourgine, P., eds.: Towards a Practice on Autonomous Systems: Proceedings of the First European Conference on Artificial Life, MIT Press (1992) 263–271
Schaffer, J., Morishima, A.: An adaptive crossover distribution mechanism for genetic algorithms. In J. J. Grefenstette, ed.: Proceedings of the Second International Conference on Genetic Algorithms, Lawrence Erlbaum (1987) 36–40
Smith, J., Fogarty, T. C.: An adaptive poly-parental recombination strategy. In Fogarty, T. C., ed.: Evolutionary Computing 2, Springer Verlag (1995) 48–61
Smith, J., Fogarty, T.: Adaptively parameterised evolutionary systems: Self adaptive recombination and mutation in a genetic algorithm. In Voigt, Ebeling, Rechenberg, Schwefel, eds.: Proceedings of the Fourth Conference on Parallel Problem Solving from Nature, Springer Verlag (1996) 441–450
Husbands, P.: Distributed co-evolutionary genetic algorithms for multi-criteria and multi-constraint optimisiation. In Fogarty, T., ed.: Evolutionary Computing: Proceedings of the AISB workshop. LNCS 865, Springer Verlag (1994) 150–165
Paredis, J.: The symbiotic evolution of solutions and their representations. In Eshelman, L. J., ed.: Proceedings of the Sixth International Conference on Genetic Algorithms, Morgan Kaufmann (1995) 359–365
Potter, M. A., DeJong, K.: A cooperative coevolutionary approach to function optimisation. In Davidor, Y., ed.: Proceedings of the Third Conference on Parallel Problem Solving from Nature, Springer Verlag (1994) 248–257
Bull, L.: Artificial Symbiology. PhD thesis, University of the West of England (1995)
Bull, L.: Evolutionary computing in multi agent environments: Partners. In Back, T., ed.: Proceedings of the Seventh International Conference on Genetic Algorithms, Morgan Kaufmann (1997) 370–377
Bull, L., Holland, O., Blackmore, S.: On meme-gene coevolution. Artificial Life 6 (2000) 227–235
Keller, R. E., Banzhaf, W.: The evolution of genetic code in genetic programming. In Banzhaf, W., Daida, J., Eiben, A. E., Garzon, M. H., Honavar, V., Jakiela, M., Smith, R. E., eds.: Proceedings of the Genetic and Evolutionary Computation Conference. Volume 2., Orlando, Florida, USA, Morgan Kaufmann (1999) 1077–1082
Back, T., Fogel, D., Michalwicz, Z.: Handbook of Evolutionary Computation. Volume 1. Oxford University Press (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smith, J. (2002). Co-evolving Memetic Algorithms: Initial Investigations. In: Guervós, J.J.M., Adamidis, P., Beyer, HG., Schwefel, HP., Fernández-Villacañas, JL. (eds) Parallel Problem Solving from Nature — PPSN VII. PPSN 2002. Lecture Notes in Computer Science, vol 2439. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45712-7_52
Download citation
DOI: https://doi.org/10.1007/3-540-45712-7_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44139-7
Online ISBN: 978-3-540-45712-1
eBook Packages: Springer Book Archive