Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Computing edge-connectivity in multigraphs and capacitated graphs
SIAM Journal on Discrete Mathematics
A general framework for vertex orderings, with applications to netlist clustering
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning
IEEE Transactions on Computers
Fitness landscapes and memetic algorithm design
New ideas in optimization
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
AllelesLociand the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
Hyperplane Synthesis for Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
On Multi-Dimensional Encoding/Crossover
Proceedings of the 6th International Conference on Genetic Algorithms
Epistasis in Genetic Algorithms: An Experimental Design Perspective
Proceedings of the 6th International Conference on Genetic Algorithms
Toward More Powerful Recombinations
Proceedings of the 6th International Conference on Genetic Algorithms
A Bit-Wise Epistasis Measure for Binary Search Spaces
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
A Memetic Algorithm for University Exam Timetabling
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Selected Papers from AISB Workshop on Evolutionary Computing
Voronoi Quantizied Crossover For Traveling Salesman Problem
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
The behavior of adaptive systems which employ genetic and correlation algorithms
The behavior of adaptive systems which employ genetic and correlation algorithms
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem
IEEE Transactions on Evolutionary Computation
Toward minimal restriction of genetic encoding and crossovers for the two-dimensional Euclidean TSP
IEEE Transactions on Evolutionary Computation
New topologies for genetic search space
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Linear transformation in Pseudo-Boolean functions
Proceedings of the 10th annual conference on Genetic and evolutionary computation
A spanning tree-based encoding of the MAX CUT problem for evolutionary search
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
| Hi-index | 0.00 |
As a preprocessing for genetic algorithms, static reordering helps genetic algorithms effectively create and preserve high-quality schemata, and consequently improves the performance of genetic algorithms. In this paper, we propose a static reordering method independent of problem-specific knowledge. One of the novel features of our reordering method is that it is applicable to any problem with no information about the problem. The proposed method constructs a weighted complete graph from the gene distances calculated from solutions with relatively high fitnesses, transforms them into a gene-interaction graph, and finds a gene rearrangement. Extensive experimental results showed significant improvement for a number of applications.