A study of permutation crossover operators on the traveling salesman problem
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Uniform crossover in genetic algorithms
Proceedings of the third international conference on Genetic algorithms
Proceedings of the third international conference on Genetic algorithms
Journal of Computational Physics
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Annals of Operations Research - Special issue on Tabu search
The evolution of evolvability in genetic programming
Advances in genetic programming
Intelligent scheduling
Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
Convergence characteristics of keep-best reproduction
Proceedings of the 1999 ACM symposium on Applied computing
A combinatorial evolution strategy for dynamic channel assignment in cellular radio
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Using a genetic algorithm to find good linear error-correcting codes
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Keep-best reproduction: a selection strategy for genetic algorithms
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Job Shop Scheduling with Genetic Algorithms
Proceedings of the 1st International Conference on Genetic Algorithms
Genetic Algorithms for the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
AllelesLociand the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator
Proceedings of the 3rd International Conference on Genetic Algorithms
Crossover versus Mutation: Fueling the Debate: TGA versus GIGA
Proceedings of the 5th International Conference on Genetic Algorithms
Parallel Genetic Algorithms for Constrained Ordering Problems
Proceedings of the Eleventh International Florida Artificial Intelligence Research Society Conference
RnaPredict—An Evolutionary Algorithm for RNA Secondary Structure Prediction
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
RNA pseudoknot prediction via an evolutionary algorithm
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part II
A permutation-based genetic algorithm for predicting RNA secondary structure—a practicable approach
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part II
pEvoSAT: a novel permutation based genetic algorithm for solving the boolean satisfiability problem
Proceedings of the 15th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
This paper presents a comparison of two genetic algorithms (GAs) for constrained ordering problems. The first GA uses the standard selection strategy of roulette wheel selection and generational replacement (STDS), while the second GA uses an intermediate selection strategy in addition to STDS. This intermediate selection strategy keeps only the superior offspring and replaces the inferior offspring with the superior parent. We call this selection strategy iKeep-Best Reproduction (KBR). The effect of recombination alone, mutation alone and both together are studied. We compare the performance of the different selection strategies and discuss the environment that each selection strategy needs to flourish in. Overall, KBR is found to be the selection strategy of choice. We also present empirical evidence that suggests that KBR is more robust than STDS with regard to operator probabilities and works well with smaller population sizes.