A comparative study of population-based algorithms for a political districting problem

Purpose This paper aims to propose comparing the performance of three algorithms based on different population-based heuristics, particle swarm optimization (PSO), artificial bee colony (ABC) and method of musical composition (DMMC), for the districting problem. Design/methodology/approach In order to compare the performance of the proposed algorithms, they were tested on eight instances drawn from the Mexican electoral institute database, and their respective performance levels were compared. In addition, a simulated annealing-based (simulated annealing – SA) algorithm was used as reference to evaluate the proposed algorithms. This technique was included in this work because it has been used for Federal districting in Mexico since 1994. The performance of the algorithms was evaluated in terms of the quality of the approximated Pareto front and efficiency. Regarding solution quality, convergence and dispersion of the resulting non-dominated solutions were evaluated. Findings The results show that the quality and diversification of non-dominated solutions generated by population-based algorithms are better than those produced by Federal Electoral Institute’s (IFE’s) SA-based technique. More accurately, among population-based techniques, discrete adaptation of ABC and MMC outperform PSO. Originality/value The performance of three population-based techniques was evaluated for the districting problem. In this paper, the authors used the objective function proposed by the Mexican IFE, a weight aggregation function that seeks for a districting plan that represents the best balance between population equality and compactness. However, the weighting factors can be modified by political agreements; thus, the authors decided to produce a set of efficient solutions, using different weighting factors for the computational experiments. This way, the best algorithm will produce high quality solutions no matter the weighting factors used for a real districting process. The computational experiments proved that the proposed artificial bee colony and method of musical composition-based algorithms produce better quality efficient solutions than its counterparts. These results show that population-based algorithms can outperform traditional local search strategies. Besides, as far as we know, this is the first time that the method of musical composition is used for this kind of problems.

[1]  B. Grofman,et al.  Measuring Compactness and the Role of a Compactness Standard in a Test for Partisan and Racial Gerrymandering , 1990, The Journal of Politics.

[2]  Yan Zhu,et al.  An improved method of delineating rectangular management zones using a semivariogram-based technique , 2016, Comput. Electron. Agric..

[3]  G. Laporte,et al.  Decoupage Electoral Automatise: Application A L’Lle De Montreal , 1981 .

[4]  Eric Alfredo Rincón García,et al.  Adaptation of the method of musical composition for solving the multiple sequence alignment problem , 2014, Computing.

[5]  Jorge Valenzuela,et al.  Scheduling a log transport system using simulated annealing , 2014, Inf. Sci..

[6]  Isa Nakhai Kamal Abadi,et al.  An efficient population-based simulated annealing algorithm for the multi-product multi-retailer perishable inventory routing problem , 2016, Comput. Ind. Eng..

[7]  José Luiz de Medeiros,et al.  Optimal determination of chemical plant layout via minimization of risk to general public using Monte Carlo and Simulated Annealing techniques , 2016 .

[8]  C. J. Vidal,et al.  A Home Health Care Districting Problem in a Rapid-Growing City , 2015 .

[9]  Bruno Simeone,et al.  Local search algorithms for political districting , 2008, Eur. J. Oper. Res..

[10]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[11]  Eric Alfredo Rincón García,et al.  Adaptation of the musical composition method for solving constrained optimization problems , 2014, Soft Comput..

[12]  R. J. Kuo,et al.  Application of metaheuristics-based clustering algorithm to item assignment in a synchronized zone order picking system , 2016, Appl. Soft Comput..

[13]  Andrea Scozzari,et al.  Political Districting: from classical models to recent approaches , 2013, Annals of Operations Research.

[14]  W. Vickrey On the Prevention of Gerrymandering , 1961 .

[15]  Charles R. Hampton,et al.  Practical application of district compactness , 1993 .

[16]  H. Young Measuring the Compactness of Legislative Districts , 1988 .

[17]  Michelle H Browdy Simulated Annealing: An Improved Computer Model for Political Redistricting , 1990 .

[18]  Quan-Ke Pan,et al.  An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time , 2016, Expert Syst. Appl..

[19]  Wei Chen,et al.  Artificial bee colony algorithm for constrained possibilistic portfolio optimization problem , 2015 .

[20]  Gilbert Laporte,et al.  A tabu search heuristic and adaptive memory procedure for political districting , 2003, Eur. J. Oper. Res..

[21]  Saman Aminbakhsh,et al.  Discrete particle swarm optimization method for the large-scale discrete time-cost trade-off problem , 2016, Expert Syst. Appl..

[22]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[23]  Mauro Birattari,et al.  Tuning Metaheuristics - A Machine Learning Perspective , 2009, Studies in Computational Intelligence.

[24]  Pedro Lara-Velázquez,et al.  A Multiobjective Algorithm for Redistricting , 2013 .

[25]  Federico Liberatore,et al.  A multi-criteria Police Districting Problem for the efficient and effective design of patrol sector , 2015, Eur. J. Oper. Res..

[26]  Dervis Karaboga,et al.  A comprehensive survey: artificial bee colony (ABC) algorithm and applications , 2012, Artificial Intelligence Review.

[27]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[28]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops , 2011, Inf. Sci..

[29]  Antonin Ponsich,et al.  A DISCRETE PARTICLE SWARM OPTIMIZATION ALGORITHM FOR DESIGNING ELECTORAL ZONES , 2012 .

[30]  Tao Zhang,et al.  Dynamic design of sales territories , 2015, Comput. Oper. Res..

[31]  Narendra Agrawal,et al.  Management of Multi-Item Retail Inventory Systems with Demand Substitution , 2000, Oper. Res..

[32]  Eric Alfredo Rincón García,et al.  An optimization algorithm inspired by musical composition , 2014, Artificial Intelligence Review.

[33]  G. Nemhauser,et al.  An Optimization Based Heuristic for Political Districting , 1998 .

[34]  Gilbert Laporte,et al.  Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm , 2016, Comput. Oper. Res..

[35]  Micah Altman,et al.  Is automation the answer: the computational complexity of automated redistricting , 1997 .

[36]  Yudong Zhang,et al.  A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications , 2015 .

[37]  Zhiheng Li,et al.  Optimize Traffic Police Arrangement in Easy Congested Area based on Improved Particle Swarm Optimization , 2014 .

[38]  G. Nemhauser,et al.  Optimal Political Districting by Implicit Enumeration Techniques , 1970 .

[39]  Yan-Feng Liu,et al.  A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem , 2013, Appl. Soft Comput..

[40]  Chung-I Chou A Knowledge-based Evolution Algorithm approach to political districting problem , 2011, Comput. Phys. Commun..

[41]  R. Sørensen After the immigration shock: The causal effect of immigration on electoral preferences , 2016 .

[42]  Emanuele Bracco Optimal districting with endogenous party platforms , 2013 .

[43]  Yu-Ting Hsu,et al.  Risk-based spatial zone determination problem for stage-based evacuation operations , 2014 .

[44]  Chang Wook Ahn,et al.  Linkage artificial bee colony for solving linkage problems , 2016, Expert Syst. Appl..

[45]  Sara Ceschia,et al.  Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem , 2014, Comput. Oper. Res..

[46]  Jiafu Tang,et al.  A mixed integer programming formulation and solution for traffic analysis zone delineation considering zone amount decision , 2014, Inf. Sci..

[47]  J. Weaver,et al.  Nonpartisan Political Redistricting by Computer , 1965 .