Topological crossover for the permutation representation
暂无分享,去创建一个
[1] Raymond Lister,et al. Sorting Circular Permutations by Reversal. , 2003, WADS.
[2] David B. Fogel,et al. Evolution-ary Computation 1: Basic Algorithms and Operators , 2000 .
[3] John Paul C. Vergara,et al. Sorting by bounded permutations , 1998 .
[4] David Sankoff,et al. Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement , 1995, Algorithmica.
[5] Gilbert Syswerda,et al. Uniform Crossover in Genetic Algorithms , 1989, ICGA.
[6] Alberto Caprara,et al. Sorting by reversals is difficult , 1997, RECOMB '97.
[7] D. E. Goldberg,et al. Genetic Algorithms in Search , 1989 .
[8] B. R. Fox,et al. Genetic Operators for Sequencing Problems , 1990, FOGA.
[9] J. Davenport. Editor , 1960 .
[10] Zbigniew Michalewicz,et al. Evolutionary Computation 1 , 2018 .
[11] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[12] Jeffrey Horn,et al. Handbook of evolutionary computation , 1997 .
[13] Tayuan Huang,et al. Metrics on Permutations, a Survey , 2004 .
[14] Georges R. Harik,et al. Foundations of Genetic Algorithms , 1997 .
[15] Nicholas J. Radcliffe,et al. The algebra of genetic algorithms , 1994, Annals of Mathematics and Artificial Intelligence.
[16] Darrell Whitley,et al. A genetic algorithm tutorial , 1994, Statistics and Computing.
[17] Riccardo Poli,et al. Topological Interpretation of Crossover , 2004, GECCO.