A reactive GRASP for a commercial territory design problem with multiple balancing requirements
Computers and Operations Research
A Complex Networks Approach to Demographic Zonification
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Multiobjective evolutionary algorithm for redesigning sales territories
ICCL'11 Proceedings of the Second international conference on Computational logistics
A computational approach to unbiased districting
Mathematical and Computer Modelling: An International Journal
Proceedings of the 14th annual conference on Genetic and evolutionary computation
An AZP-ACO method for region-building
SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications
Hi-index | 0.00 |
Genetic algorithms (GA) have been found to provide global near optimal solutions in a wide range of complex problems. In this paper genetic algorithms have been used to deal with the complex problem of zone design. The zone design problem comprises a large number of geographical tasks, from which electoral districting is probably the most well known. The electoral districting problem is described and formalized mathematically. Different problem encodings, suited to GA optimization, are presented, together with different objective functions. A practical real world example is given and tests performed in order to evaluate the effectiveness of the GA approach.