Self-organization and associative memory: 3rd edition
Self-organization and associative memory: 3rd edition
Genetic Algorithms for the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
A New Approach on the Traveling Salesman Problem by 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
| Hi-index | 0.00 |
Many combinatorial optimization problems provide their data in an input space with a given dimension. Genetic algorithms for those problems can benefit by using this natural dimension for the encoding of the individuals rather than a traditional one-dimensional bit string. This is true in particular if each data point of the problem corresponds to a bit or a group of bits of the chromosome. We develop different methods for constructing a rectangular grid of near-optimal dimension for given data points, providing a natural encoding of the individuals. Our algorithms are tested with some large TSP instances.