SAGA: Demonstrating the Benefits of Commonality-Based Crossover Operators in Simulated Annealing

作者: Stephen Chen

DOI:

关键词:

摘要: The crossover operator is traditionally viewed as the distinguishing feature and primary strength of a genetic algorithm. This multi-parent can recombine useful features two parent solutions into single “super” offspring. However, new analysis suggests that benefit operators preservatio n common components. In creating an offspring solution, focus its changes on uncommon components parents. surprisingly important algorithms. To demonstrate contribution preserving to search process algorithms, this has been isolated transferred simulated annealing. Results Travelling Salesman Problem indicate preservation lead significant improvements in performance

参考文章(16)
Nicholas J. Radcliffe, Forma Analysis and Random Respectful Recombination. Proc.4th Int'l Conf.on Genetic Algorithms. pp. 222- 229 ,(1991)
Keith E. Mathias, J. David Schaffer, Larry J. Eshelman, Convergence Controlled Variation. FOGA. pp. 203- 224 ,(1996)
Kenneth Dean Boese, Models for iterative global optimization University of California at Los Angeles. ,(1996)
Colin R. Reeves, Genetic Algorithms and Neighbourhood Search artificial intelligence and the simulation of behaviour. pp. 115- 130 ,(1994) , 10.1007/3-540-58483-8_10
Stephen Chen, Stephen F. Smith, Introducing a new advantage of crossover: commonality-based selection genetic and evolutionary computation conference. pp. 122- 128 ,(1999)
S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, Optimization by Simulated Annealing Science. ,vol. 220, pp. 671- 680 ,(1983) , 10.1126/SCIENCE.220.4598.671