Library Open Repository
PoD Can Mutate: A Simple Dynamic Directed Mutation Approach for Genetic Algorithms
Berry, A and Vamplew, P (2004) PoD Can Mutate: A Simple Dynamic Directed Mutation Approach for Genetic Algorithms. In: AISAT2004: International Conference on Artificial Intelligence in Science and Technology, 21-25 November 2004, Hobart, Tasmania, Australia.
PoD_AISAT_FINAL.pdf | Download (207kB)
Available under University of Tasmania Standard License.
The incorporation of contemporary directed mutation techniques into traditional genetic algorithms has shown significant potential and garnered many promising results. While such findings are important, the utility of directed mutation in a generic sense is limited by either a reliance on domain specific knowledge or an increase in complexity with respect to both parameter size and the functions required for random number generation. Thus, this paper presents a new approach to mutation that utilises a co-evolving set of simple directions for each chromosome that dictate the result of gene mutations. In addition to biasing mutation towards promising areas of the search space, the Pointed Directed (PoD) mutation technique requires no increase in a priori information about the domain, nor does it come at a significant cost to system complexity. Moreover, results show that PoD mutation offers significant advantages over gaussian mutation across a range of complex problem areas, maximising performance by utilising adaptation to tune both directions and emergent system momentum.
|Item Type:||Conference or Workshop Item (Paper)|
|Keywords:||genetic algorithms, directed mutation|
|Page Range:||pp. 200-205|
|Date Deposited:||26 Nov 2004|
|Last Modified:||18 Nov 2014 03:10|
|Item Statistics:||View statistics for this item|
Repository Staff Only (login required)
|Item Control Page|