Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Sammon's mapping using neural networks: a comparison
Pattern Recognition Letters - special issue on pattern recognition in practice V
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Genetic Algorithm and Graph Partitioning
IEEE Transactions on Computers
Hyperplane Synthesis for Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
A Nonlinear Mapping for Data Structure Analysis
IEEE Transactions on Computers
GAVEL - a new tool for genetic algorithm visualization
IEEE Transactions on Evolutionary Computation
New topologies for genetic search space
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
The Current State and Future of Search Based Software Engineering
FOSE '07 2007 Future of Software Engineering
Visualizing the search process of particle swarm optimization
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Evolving plastic neural networks with novelty search
Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems
Search based software engineering
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
| Hi-index | 0.00 |
It is a hard problem to understand the fitness landscape of a problem as well as the evolution of genetic algorithms. For the purpose, we adopt Sammon's mapping for the investigation. We demonstrate its usefulness by applying it to the graph partitioning problem which is a well-known NP-hard problem. Also, through the investigation of schema traces, we explain the genetic process and the reordering effect in the genetic algorithm.