The “molecular” traveling salesman
Biological Cybernetics
A clustering algorithm using an evolutionary programming-based approach
Pattern Recognition Letters
An Optimization Based Heuristic for Political Districting
Management Science
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators
Artificial Intelligence Review
Adaptive Selection Methods for 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
Geometric algorithms for optimal airspace design and air traffic controller workload balancing
Journal of Experimental Algorithmics (JEA)
Hi-index | 0.00 |
The drawing of congressional districts by legislative bodies in the United States creates a great deal of controversy each decade as political parties and special interest groups attempt to divide states into districts beneficial to their candidates. The genetic algorithm presented in this paper attempts to find a set of compact and contiguous congressional districts of approximately equal population. This genetic algorithm utilizes a technique based on an encoding and genetic operators used to solveTraveling Salesman Problems (TSP). This encoding forces near equality of district population and uses the fitness function to promote district contiguity and compactness.A post-processing step further refines district population equality. Results are provided for three states (North Carolina, South Carolina, and Iowa) using 2000 census data.