Estimating meme fitness in adaptive memetic algorithms for combinatorial problems

Evolutionary Computation

Volumn 20, Issue 2, 2012, Pages 165-188

  Smith, J E ^a  

^a UNIVERSITY OF THE WEST OF ENGLAND   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE OPERATORS; CANDIDATE SOLUTION; COMBINATORIAL PROBLEM; CONTINUOUS SPACES; CREDIT ASSIGNMENT; EVOLUTIONARY SEARCH; GENETIC OPERATORS; HISTORICAL RECORDS; LOCAL SEARCH ALGORITHM; LOCAL-IMPROVEMENT OPERATORS; MEMETIC ALGORITHMS; OPTIMISATIONS; SEARCH PROCESS; SIGNIFICANT PATTERNS; SOLUTION SPACE;

EVOLUTIONARY ALGORITHMS;

ESTIMATION;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; INFORMATION RETRIEVAL; SYSTEMS THEORY;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; INFORMATION STORAGE AND RETRIEVAL; SYSTEMS THEORY;

EID: 84860813212     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/EVCO_a_00060     Document Type: Article

References (66)

1. Bäck, T. (1992). Self adaptation in genetic algorithms. In F. Varela and P. Bourgine (Eds.), Toward a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life, pp. 263-271.
2. Bäck, T., Fogel, D., and Michalewicz, Z. (Eds.). (1997). Handbook of evolutionary computation. Bristol, UK: Institute of Physics Publishing.
3. Barkat Ullah, A. S. S. M., Sarker, R., Cornforth, D., and Lokan, C. (2009). AMA: A new approach for solving constrained real-valued optimization problems. Soft Computing, 13(8-9):741-762.
4. Bull, L. (1995). Artificial symbiology. PhD thesis, University of the West of England.
5. Bull, L. (1997). Evolutionary computing in multi agent environments: Partners. In T. Bäck (Ed.), Proceedings of the 7th International Conference on Genetic Algorithms, pp. 370-377.
6. Bull, L., and Fogarty, T. (1997). Horizontal gene transfer in endosymbiosis. In Proceedings of the 5th International Workshop on Artificial Life: Synthesis and Simulation of Living Systems (ALIFE-96), pp. 77-84.
7. Burke, E., and Smith, A. (2000). Hybrid evolutionary techniques for the maintenance scheduling problem. IEEE Transactions on Power Systems, 15(1):122-128
8. Burke, E., Kendall, G., and Soubeiga, E. (2003). A TABU search hyperheuristic for timetabling and rostering. Journal of Heuristics, 9(6):451-470.
9. Burke, E. K., Curtois, T., Hyde, M. R., Kendall, G., Ochoa, G., Petrovic, S., Rodríguez, J. A. V., and Gendreau, M. (2010). Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms. In Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1-8.
10. Caponio, A., Cascella, G., Neri, F., Salvatore, N., and Sumner, M. (2007). A fast adaptive memetic algorithm for online and offline control design of PMSM drives. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 37(1):28-41.
11. Caponio, A., Neri, F., and Tirronen, V. (2009). Super-fit control adaptation in memetic differential evolution frameworks. Soft Computing, 13(8-9):811-831.
12. CEC-2003. (2003). Proceedings of the 2003 Congress on Evolutionary Computation (CEC 2003). Piscataway, NJ: IEEE Press.
13. Chen, X. (2010). An algorithm development environment for problem-solving. In Proceedings of the 2010 International Conference on Computational Problem-Solving (ICCP), pp. 85-90.
14. Chen, X. S., Ong, Y. S., Lim, M. H., and Tan, K. C. (2011). A multi-facet survey on memetic computation. IEEE Transactions on Evolutionary Computation, 15(5):591-607.
15. Cowling, P., Kendall, G., and Soubeiga, E. (2001). A hyperheuristic approach to scheduling a sales summit. In Practice and theory of automated timetabling. Lecture Notes in Computer Science, Vol. 2079 (pp. 176-190). Berlin: Springer.
16. Eiben, A., and van Hemert, J. (1999). SAW-ing EAs: Adapting the fitness function for solving constrained problems. In D. Corne, M. Dorigo, and F. Glover (Eds.), New ideas in optimization (Chap. 26, pp. 389-402). New York: McGraw-Hill.
17. Eiben, A., Hinterding, R., and Michalewicz, Z. (1999). Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 3(2):124-141.
18. Eiben, A., Michalewicz, Z., Schoenauer, M., and Smith, J. (2007). Parameter control in evolutionary algorithms. In F. G. Lobo, C. F. Lima, and Z. Michalewicz (Eds.), Parameter setting in evolutionary algorithms, studies in computational intelligence, Vol. 54, (pp. 19-46). Berlin: Springer Verlag.
19. Fialho, A., Da Costa, L., Schoenauer, M., and Sebag, M. (2008). Extreme value based adaptive operator selection. In Parallel Problem Solving from Nature (PPSN X). Lecture Notes in Computer Science, Vol. 5199 (pp. 175-184). Berlin: Springer. Available at http://hal.inria.fr/inria-00287355/en/
20. Fialho, A., Da Costa, L., Schoenauer, M., and Sebag, M. (2010). Analyzing bandit-based adaptive operator selection mechanisms. Annals of Mathematics and Artificial Intelligence, Special issue on learning and intelligent optimization. DOI 10.1007/s10472-010-9213-y. Available at http://dx.doi.org/10.1007/s10472-010-9213-y
21. Fogel, D. (1992). Evolving artificial intelligence. PhD thesis, University of California at San Diego.
22. Fukunaga, A. (2008). Automated discovery of local search heuristics for satisfiability testing. Evolutionary Computation, 16(1):31-61.
23. Kendall, G., Cowling, P., and Soubeiga, E. (2002). Choice function and random hyperheuristics. In Proceedings of the Fourth Asia-Pacific Conference on Simulated Evolution and Learning (SEAL), pp. 667-671.
24. Krasnogor, N. (1999). Coevolution of genes and memes in memetic algorithms. In A. Wu (Ed.), Proceedings of the 1999 Genetic and Evolutionary Computation Conference Workshop Program.
25. Krasnogor, N. (2002). Studies in the theory and design space of memetic algorithms. PhD thesis, University of the West of England.
26. Krasnogor, N. (2004). Self-generating metaheuristics in bioinformatics: The protein structure comparison case. Genetic Programming and Evolvable Machines, 5(2):181-201.
27. Krasnogor, N., and Gustafson, S. (2004). A study on the use of "self-generation" in memetic algorithms. Natural Computing, 3(1):53-76.
28. Krasnogor, N., and Smith, J. (2000). A memetic algorithm with self-adaptive local search: TSP as a case study. In D. Whitley, D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, and H. G. Beyer (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), pp. 987-994.
29. Krasnogor, N., and Smith, J. (2001). Emergence of profitable search strategies based on a simple inheritance mechanism. In L. Spector, E. Goodman, A. Wu, W. Langdon, H. M. Voight, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. Garzon, and E. Burke (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pp. 432-439.
30. Krasnogor, N., Blackburne, B., Burke, E., and Hirst, J. (2002). Multimeme algorithms for protein structure prediction. In J. M. Guervos, P. Adamidis, J. L. Fernandez-Villacanas, H. P. Schwefel (Eds.), Proceedings of the 7th Conference on Parallel Problem Solving from Nature. Lecture Notes in Computer Science, Vol. 2439, pp. 769-778.
31. Maturana, J., Fialho, Á., Saubion, F., Schoenauer, M., and Sebag, M. (2009). Extreme compass and dynamic multi-armed bandits for adaptive operator selection. In IEEE Congress on Evolutionary Computation, Trondheim, Norway.
32. Meuth, R., Lim, M., Ong, Y., and Wunsch, D. (2009). A proposition on memes and meta-memes in computing for higher-order learning. Memetic Computing, 1(2):85-100.
33. Moscato, P. (1989). On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Caltech Concurrent Computation Program Report 826. Pasadena, CA: Caltech.
34. Neri, F. (2007a). An adaptive multimeme algorithm for designing HIV multidrug therapies. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 4(2):264-278.
35. Neri, F. (2007b). Fitness diversity based adaptation in multimeme algorithms: A comparative study. In IEEE Congress on Evolutionary Computation, CEC 2007, pp. 2374-2381.
36. Nguyen, H. Q., Ong, Y. S., Lim, M. H., and Krasnogor, N. (2009a). Adaptive cellular memetic algorithms. Evolutionary Computation, 17(2):231-256.
37. Nguyen, Q. H., Ong, Y. S., and Lim, M. H. (2009b). A probabilistic memetic framework. IEEE Transactions on Evolutionary Computation, 13(3):604-623.
38. Ong, Y., and Keane, A. (2004). Meta-Lamarckian learning in memetic algorithms. IEEE Transactions on Evolutionary Computation, 8(2):99-110.
39. Ong Y., Lim, M., Zhu, N., and Wong, K. (2006). Classification of adaptive memetic algorithms: A comparative study. IEEE Transactions on Systems, Man and Cybernetics, Part B, 36(1):141-152.
40. Ong, Y. S., Lim, M. H., and Chen, X. (2010). Memetic computation-Past, present & future [Research Frontier]. Computational Intelligence Magazine, 5(2):24-31.
41. Ostermeier, A., Gawelczyk, A., and Hansen, N. (1994). A derandomized approach to selfadaptation of evolution strategies. Evolutionary Computation, 2(4):369-380.
42. Parker, G., and Blumenthal, H. (2004). Varying sample sizes for the co-evolution of heterogeneous agents. In Proceedings of the Congress on Evolutionary Computation (CEC 2004), pp. 766-771.
43. SATLIB. (2010). Online repository of satisfiability problems. Available at http://www.satlib.org
44. Schaffer, J., and Morishima, A. (1987). An adaptive crossover distribution mechanism for genetic algorithms. In J. Grefenstette (Ed.), Proceedings of the 2nd International Conference on Genetic Algorithms and Their Applications, pp. 36-40.
45. Schwefel, H. P. (1981). Numerical optimisation of computer models. New York: Wiley.
46. Serpell, M., and Smith, J. (2010). Self-adaption of mutation operator and probability for permutation representations in genetic algorithms. Evolutionary Computation, 18(3):491-514.
47. Smith, J. (2001). Modelling GAs with self-adaptive mutation rates. In L. Spector, E. Goodman, A. Wu, W. Langdon, H. M. Voight, M. Gen, S. Sen, M. Dorigon, S. Pezeshk, M. Garzon, and E. Burke (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO2011), pp. 599-606.
48. Smith, J. (2002a). Co-evolution of memetic algorithms: Initial investigations. In J. M. Guervos, P. Adamis, J. L. Fernandez-Villacanas, and H. P. Schwefel (Eds.), Proceedings of the 7th Conference on Parallel Problem Solving from Nature. Lecture Notes in Computer Science, Vol. 2439, pp. 537-548.
49. Smith, J. (2002b). On appropriate adaptation levels for the learning of gene linkage. Journal of Genetic Programming and Evolvable Machines, 3(2):129-155.
50. Smith, J. (2003a). Co-evolving memetic algorithms: A learning approach to robust scalable optimisation. In Proceedings of the 2003 Congress on Evolutionary Computation (CEC 2003), pp. 498-505.
51. Smith, J. (2003b). Parameter perturbation mechanisms in binary coded gas with self-adaptive mutation. In Proceedings of Foundations of Genetic Algorithms, 7, pp. 329-346.
52. Smith, J. (2003c). Protein structure prediction with co-evolving memetic algorithms. In Proceedings of the 2003 Congress on Evolutionary Computation (CEC 2003), pp. 2346-2353.
53. Smith, J. (2004). The co-evolution of memetic algorithms for protein structure prediction. In W. Hart, N. Krasnogor, and J. Smith (Eds.), Recent advances in memetic algorithms (pp. 105-128). Berlin: Springer.
54. Smith, J. (2007a). Co-evolving memetic algorithms: A review and progress report. IEEE Transactions in Systems, Man and Cybernetics, Part B, 37(1):6-17.
55. Smith, J. (2007b). Credit assignment in adaptive memetic algorithms. In Proceedings of GECCO, the ACM-SIGEVO Conference on Evolutionary Computation, pp. 1412-1419.
56. Smith, J. (2010). Meme fitness and memepool sizes in coevolutionary memetic algorithms. Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1-8.
57. Smith, J., and Fogarty, T. (1996a). Adaptively parameterised evolutionary systems: Self adaptive recombination and mutation in a genetic algorithm. In H. M. Voigt, W. Ebeling, I. Rechenberg, and H. P. Schwefel (Eds.), Proceedings of the 4th Conference on Parallel Problem Solving from Nature. Lecture Notes in Computer Science, Vol. 1141. (pp. 441-450). Berlin: Springer.
58. Smith, J., and Fogarty, T. (1996b). Recombination strategy adaptation via evolution of gene linkage. In Proceedings of the 1998 IEEE Conference on Evolutionary Computation, pp. 826-831.
59. Smith, J., and Fogarty, T. (1996c). Self adaptation of mutation rates in a steady state genetic algorithm. In Proceedings of the 1998 IEEE Conference on Evolutionary Computation, pp. 318-323.
60. Smith, J., and Fogarty, T. (1997). Operator and parameter adaptation in genetic algorithms. Soft Computing, 1(2):81-87.
61. Stone, C., and Smith, J. (2002). Strategy parameter variety in self-adaption. In W. Langdon, E. Cant ú-Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M. Potter, A. Schultz, J. Miller, E. Burke, and N. Jonoska (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2002), pp. 586-593.
62. Thierens, D. (2007). Adaptive strategies for operator allocation. In F. Lobo, C. Lima, and Z. Michalewicz (Eds.), Parameter setting in evolutionary algorithms, pp. 77-90.
63. Ting, C., Zeng, W., and Lin, T. (2010). Linkage discovery through data mining. Computational Intelligence Magazine, 5:10-13.
64. Whitacre, J. M., Pham, T. Q., and Sarker, R. A. (2006). Credit assignment in adaptive evolutionary algorithms. In Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 1353-1360.
65. Whitacre, J. M., Sarker, R. A., and Pham, Q. T. (2008). The self-organization of interaction networks for nature-inspired optimization. IEEE Transactions on Evolutionary Computation, 12(2):220-230.
66. Wiegand, R., Liles, W., and Jong, K. D. (2001). An empirical analysis of collaboration methods in cooperative coevolutionary algorithms. In L. Spector, E. Goodman, A. Wu, W. Langdon, H. M. Voight, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. Garzon, and E. Burke (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2011), pp. 1235-1245.