Self-adaptation of mutation operator and probability for permutation representations in genetic algorithms

Serpell, Martin; Smith, Jim

Abstract

The choice of mutation rate is a vital factor in the success of any genetic algorithm (GA), and for permutation representations this is compounded by the availability of several alternative mutation operators. It is now well understood that there is no one "optimal choice"; rather, the situation changes per problem instance and during evolution. This paper examines whether this choice can be left to the processes of evolution via selfadaptation, thus removing this nontrivial task fromtheGAuser and reducing the risk of poor performance arising from (inadvertent) inappropriate decisions. Self-adaptation has been proven successful for mutation step sizes in the continuous domain, and for the probability of applying bitwise mutation to binary encodings; here we examine whether this can translate to the choice and parameterisation of mutation operators for permutation encodings. We examine one method for adapting the choice of operator during runtime, and several different methods for adapting the rate at which the chosen operator is applied. In order to evaluate these algorithms, we have used a range of benchmark TSP problems. Of course this paper is not intended to present a state of the art in TSP solvers; rather, we use this well known problem as typical of many that require a permutation encoding, where our results indicate that self-adaptation can prove beneficial. The results show that GAs using appropriate methods to self-adapt their mutation operator and mutation rate find solutions of comparable or lower cost than algorithms with "static" operators, even when the latter have been extensively pretuned. Although the adaptive GAs tend to need longer to run, we show that is a price well worth paying as the time spent finding the optimal mutation operator and rate for the nonadaptive versions can be considerable. Finally, we evaluate the sensitivity of the self-adaptive methods to changes in the implementation, and to the choice of other genetic operators and population models. The results show that the methods presented are robust, in the sense that the performance benefits can be obtained in a wide range of host algorithms. © 2010 by the Massachusetts Institute of Technology.

Citation

Serpell, M., & Smith, J. (2010). Self-adaptation of mutation operator and probability for permutation representations in genetic algorithms. Evolutionary Computation, 18(3), 491-514. https://doi.org/10.1162/EVCO_a_00006

• Journal Article Type: Article
• Publication Date: Sep 17, 2010
• Deposit Date: Feb 18, 2013
• Publicly Available Date: Feb 10, 2016
• Journal: Evolutionary Computation
• Print ISSN: 1063-6560
• Electronic ISSN: 1530-9304
• Publisher: Massachusetts Institute of Technology Press (MIT Press)
• Peer Reviewed: Peer Reviewed
• Volume: 18
• Issue: 3
• Pages: 491-514
• DOI: https://doi.org/10.1162/EVCO_a_00006
• Keywords: self-adaptation, mutation operator, probability, permutation representations, genetic algorithms
• Public URL: https://uwe-repository.worktribe.com/output/975827
• Publisher URL: http://dx.doi.org/10.1162/EVCO_a_00006
• Additional Information: Additional Information : Serpell, Martin and Smith, Jim (2010) Self-adaption of mutation operator and probability for permutation representations in genetic algorithms. Evolutionary Computation, 18 (3). pp. 419-514. ISSN 1063-6560 © 2010 by the Massachusetts Institute of Technology. Available from http://www.mitpressjournals.org/loi/evco