A tabu search heuristic and adaptive memory procedure for political districting
From MaRDI portal
Publication:1869686
DOI10.1016/S0377-2217(01)00380-0zbMath1037.90535MaRDI QIDQ1869686
Erhan Erkut, Gilbert Laporte, Burçin Bozkaya
Publication date: 28 April 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Search theory (90B40) Management decision making, including multiple objectives (90B50) History, political science (91F10) Mathematical sociology (including anthropology) (91D99)
Related Items
A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem, Towards a stochastic programming modeling framework for districting, Algorithms for gerrymandering over graphs, Redistricting algorithms, Visual attractiveness in routing problems: a review, An overview of graph covering and partitioning, The mixed capacitated arc routing problem with non-overlapping routes, Inequity averse optimization in operational research, A multi-criteria police districting problem for the efficient and effective design of patrol sector, A multi-layer line search method to improve the initialization of optimization algorithms, Optimal partisan districting on planar geographies, Adaptive memory programming for the vehicle routing problem with multiple trips, Local search heuristics for sectoring routing in a household waste collection context, A mini–max spanning forest approach to the political districting problem, Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study, A redistricting problem applied to meter reading in power distribution networks, A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows, Dynamic design of sales territories, Weighted Voronoi region algorithms for political districting, Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm, Political districting: from classical models to recent approaches, Imposing Contiguity Constraints in Political Districting Models, Designing delivery districts for the vehicle routing problem with stochastic demands, Modularity maximization to design contiguous policy zones for pandemic response, A new integer linear programming formulation for the problem of political districting, Districting for Arc Routing, A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution, An optimization-based approach for the healthcare districting under uncertainty, A concise guide to existing and emerging vehicle routing problem variants, Constraint-based electoral districting using a new compactness measure: an application to Portugal, Primal and dual bounds for the vertex \(p\)-median problem with balance constraints, A sample approximation solution procedure for chance-constrained districting problems, Continuous approximation models in freight distribution management, Tabu search with strategic oscillation for improving collection assignment plans of waste electric and electronic equipment, A multi‐period multi‐criteria districting problem applied to primary care scheme with gradual assignment, A plane graph representation of triconnected graphs, New models for commercial territory design, Partitioning a weighted tree into subtrees with weights in a given range, Political districting: From classical models to recent approaches, An effective VNS for the capacitated \(p\)-median problem, Preprocessing for a map sectorization problem by means of mathematical programming, Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size, Solving continuous location-districting problems with Voronoi diagrams, Multiple criteria districting problemsthe public transportation network pricing system of the Paris region, The geo-graph in practice: creating United States congressional districts from census blocks, A reactive GRASP for a commercial territory design problem with multiple balancing requirements, Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Plans, Uniform and most uniform partitions of trees, Automated Redistricting Simulation Using Markov Chain Monte Carlo, A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem, Local search algorithms for political districting, A dual bounding scheme for a territory design problem, A practical exact algorithm for the shortest loop design problem in a block layout, A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization, Model-based capacitated clustering with posterior regularization, Simultaneous node and link districting in transportation networks: model, algorithms and railway application, A simulated annealing approach to police district design, Bisecting a 4-connected graph with three resource sets, Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning, Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems, Minmax Tree Cover in the Euclidean Space, Solving the segmentation problem for the 2010 Argentine census with integer programming, Heuristic methods for the sectoring arc routing problem, A multiplicatively-weighted Voronoi diagram approach to logistics districting, A robust algorithm for bisecting a triconnected graph with two resource sets, Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder), A scatter search heuristic for the capacitated clustering problem, Political districting to minimize cut edges
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving a large scale districting problem: A case report
- Metaheuristics: A bibliography
- Designing and reporting on computational experiments with heuristic methods
- Probabilistic diversification and intensification in local search for vehicle routing
- An Optimization Based Heuristic for Political Districting
- Combinatorial Optimization Problems with Soft and Hard Requirements
- Evaluation and Optimization of Electoral Systems
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Optimal Political Districting by Implicit Enumeration Techniques
