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