A Multiobjective Metaheuristic for Spatial-based Redistricting
نویسنده
چکیده
This study has developed and evaluated a multiobjective metaheuristic for redistricting to draw territory lines for geographical zones for the purpose of space control. The proposed multiobjective metaheuristic is briefly explained to shows its components and functionality. The redistricting problem definition is discussed, followed by the metaheuristic and the multiobjective decision rules. Then, an experiment is conducted in Geographic Information System (GIS) to shows its performances especially in term of its quality of result. The focus of the experiment is on the performance analysis of the coverage of the approximately non-dominated solution set and the number of objectives defined. The result of the experiment has demonstrated an improvement.
منابع مشابه
BARD: Better Automated Redistricting
BARD is the first (and at time of writing, only) open source software package for general redistricting and redistricting analysis. BARD provides methods to create, display, compare, edit, automatically refine, evaluate, and profile political districting plans. BARD aims to provide a framework for scientific analysis of redistricting plans and to facilitate wider public participation in the cre...
متن کاملSSPMO: A Scatter Search Procedure for Non-Linear Multiobjective Optimization
We describe the development and testing of a metaheuristic procedure, based on the scatter search methodology, for the problem of approximating the efficient frontier of nonlinear multiobjective optimization problems with continuous variables. Recent applications of scatter search have shown its merit as a global optimization technique for single-objective problems. However, the application of ...
متن کاملApplying Fuzzy Sets to the SemanticWeb: The Problem of Retranslation
A method to enhance the 'possibilistic C-means with repulsion' algorithm based on cluster validity index p. 77 Design centering and tolerancing with utilization of evolutionary techniques p. 91 Curve fitting with NURBS using simulated annealing p. 99 Multiobjective adaptive representation evolutionary algorithm (MAREA)-a new evolutionary algorithm for multiobjective optimization p. 113 Adapting...
متن کاملTwo Metaheuristics for Multiobjective Stochastic Combinatorial Optimization
Two general-purpose metaheuristic algorithms for solving multiobjective stochastic combinatorial optimization problems are introduced: SP-ACO (based on the Ant Colony Optimization paradigm) which combines the previously developed algorithms S-ACO and P-ACO, and SPSA, which extends Pareto Simulated Annealing to the stochastic case. Both approaches are tested on random instances of a TSP with tim...
متن کاملMultiobjective cuckoo search for design optimization
Many design problems in engineering are typically multiobjective, under complex nonlinear constraints. The algorithms needed to solve multiobjective problems can be significantly different from the methods for single objective optimization. Computing effort and the number of function evaluations may often increase significantly for multiobjective problems. Metaheuristic algorithms start to show...
متن کامل