Balanced Allocation of Multi-criteria Geographic Areas by a Genetic Algorithm

The balanced partitioning of geographic space into regions is a common problem. This Territory Design Problem (TDP) of assigning smaller areas to larger regions with equal potential is a task mainly done manually. Therefore, the result becomes subjective and provides only a roughly approximated balanced result. This work presents an automated allocation of independent areas to regions using the Genetic Algorithm (GA) , which finds an optimally balanced configuration of regions based on multiple criteria. Thereby, spatial constraints are fully respected as (1) all areas remain contiguous within a region and (2) the automated allocation facilitates a compact region shape. The developed algorithm was tested on a case study in the field of sales territory planning. The target of sales territory planning is the optimal distribution of balanced and fair sales areas based on market potentials. Results of our case study demonstrate the effectiveness of our proposed technique to find an optimal structure of sales territories in a reasonable time. The distance that salesmen need to travel is 16% lower than the existing sales territory configuration. This means that the regions are more balanced and more compact. Due to the independent nature of the GA, this method demonstrates a high flexibility to the optimization problem. It can be easily altered to any objective in territory planning as well as to familiar multi-criteria spatial allocation problems in other disciplines.

[1]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[2]  A. Kai Qin,et al.  A review of population initialization techniques for evolutionary algorithms , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[3]  Stefan Nickel,et al.  Towards a unified territorial design approach — Applications, algorithms and GIS integration , 2005 .

[4]  Sven Müller,et al.  Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints , 2014, Eur. J. Oper. Res..

[5]  A. Zoltners,et al.  Sales Territory Alignment: A Review and Model , 1983 .

[6]  Sally E. Lorimer,et al.  Building a Winning Sales Force: Powerful Strategies for Driving High Performance , 2009 .

[7]  Rajan Batta,et al.  A simulated annealing approach to police district design , 2002, Comput. Oper. Res..

[8]  Peter J. Fleming,et al.  An Overview of Evolutionary Algorithms in Multiobjective Optimization , 1995, Evolutionary Computation.

[9]  Andreas Drexl,et al.  Fast Approximation Methods for Sales Force Deployment , 1999 .

[10]  D. Fogel Phenotypes, genotypes, and operators in evolutionary computation , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[11]  Elena Fernández,et al.  A reactive GRASP for a commercial territory design problem with multiple balancing requirements , 2009, Comput. Oper. Res..

[12]  Gilbert Laporte,et al.  Solving a home-care districting problem in an urban setting , 2003, J. Oper. Res. Soc..

[13]  Guoli Li,et al.  A Self-adaptive Evolutionary Algorithm for Multi-objective Optimization , 2009, ICIC.

[14]  Tomasz Pluciennik,et al.  Using Graph Database in Spatial Data Generation , 2013, ICMMI.

[15]  S. N. Sivanandam,et al.  Introduction to genetic algorithms , 2007 .