Estimating meme fitness in adaptive memetic algorithms for combinatorial problems

Article English OPEN
Smith, J. (2012)

Among the most promising and active research areas in heuristic optimisation is the field of adaptive memetic algorithms (AMAs). These gain much of their reported robustness by adapting the probability with which each of a set of local improvement operators is applied, according to an estimate of their current value to the search process. This paper addresses the issue of how the current value should be estimated. Assuming the estimate occurs over several applications of a meme, we consider whether the extreme or mean improvements should be used, and whether this aggregation should be global, or local to some part of the solution space. To investigate these issues, we use the well-established COMA framework that coevolves the specification of a population of memes (representing different local search algorithms) alongside a population of candidate solutions to the problem at hand. Two very different memetic algorithms are considered: the first using adaptive operator pursuit to adjust the probabilities of applying a fixed set of memes, and a second which applies genetic operators to dynamically adapt and create memes and their functional definitions. For the latter, especially on combinatorial problems, credit assignment mechanisms based on historical records, or on notions of landscape locality, will have limited application, and it is necessary to estimate the value of a meme via some form of sampling. The results on a set of binary encoded combinatorial problems show that both methods are very effective, and that for some problems it is necessary to use thousands of variables in order to tease apart the differences between different reward schemes. However, for both memetic algorithms, a significant pattern emerges that reward based on mean improvement is better than that based on extreme improvement. This contradicts recent findings from adapting the parameters of operators involved in global evolutionary search. The results also show that local reward schemes outperform global reward schemes in combinatorial spaces, unlike in continuous spaces. An analysis of evolving meme behaviour is used to explain these findings.
  • References (65)
    65 references, page 1 of 7

    Ba¨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.

    Ba¨ck, T., Fogel, D., and Michalewicz, Z. (Eds.). (1997). Handbook of evolutionary computation. Bristol, UK: Institute of Physics Publishing.

    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.

    Bull, L. (1995). Artificial symbiology. PhD thesis, University of the West of England.

    Bull, L. (1997). Evolutionary computing in multi agent environments: Partners. In T. Ba¨ck (Ed.), Proceedings of the 7th International Conference on Genetic Algorithms, pp. 370-377.

    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.

    Burke, E., and Smith, A. (2000). Hybrid evolutionary techniques for the maintenance scheduling problem. IEEE Transactions on Power Systems, 15(1):122-128

    Burke, E., Kendall, G., and Soubeiga, E. (2003). A TABU search hyperheuristic for timetabling and rostering. Journal of Heuristics, 9(6):451-470.

    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.

    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.

  • Metrics
    0
    views in OpenAIRE
    0
    views in local repository
    31
    downloads in local repository

    The information is available from the following content providers:

    From Number Of Views Number Of Downloads
    UWE Research Repository - IRUS-UK 0 31
Share - Bookmark