Algorithms in C++
Adaptive Selection Methods for Genetic Algorithms
Proceedings of the 1st International Conference on Genetic Algorithms
AllelesLociand the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
Parallel Genetic Algorithms Population Genetics and Combinatorial Optimization
Proceedings of the 3rd International Conference on Genetic Algorithms
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem
IEEE Transactions on Evolutionary Computation
Genetic-based search for error-correcting graph isomorphism
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.00 |
Sorting algorithms define paths in the search space of n! permutations based on the information provided by a comparison predicate. We guide a Memetic Algorithm with a new mutation operator. Our mutation operator performs local search following the path traced by the Quicksort mechanism. The comparison predicate and the evaluation function are made to correspond and guide the evolutionary search. Our approach improves previous results for a benchmark of experiments of the Error-Correcting Graph Isomorphism. For this case study, our new Memetic Algorithm achieves a better quality vs effort trade-off and remains highly effective even when the size of the problem grows.