A simulated annealing approach to police district design
From MaRDI portal
Publication:5959389
DOI10.1016/S0305-0548(01)00056-9zbMath0995.90609OpenAlexW1989807369WikidataQ127554556 ScholiaQ127554556MaRDI QIDQ5959389
Christopher M. Rump, Steven J. D'Amico, Shoou-Jiun Wang, Rajan Batta
Publication date: 3 April 2002
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(01)00056-9
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (26)
Towards a stochastic programming modeling framework for districting ⋮ An overview of graph covering and partitioning ⋮ Determining optimal police patrol areas with maximal covering and backup covering location models ⋮ A multi-criteria police districting problem for the efficient and effective design of patrol sector ⋮ Dynamic design of sales territories ⋮ Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm ⋮ Designing delivery districts for the vehicle routing problem with stochastic demands ⋮ Districting for Arc Routing ⋮ An optimization-based approach for the healthcare districting under uncertainty ⋮ The coastal seaspace patrol sector design and allocation problem ⋮ 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 ⋮ Tabu search with strategic oscillation for improving collection assignment plans of waste electric and electronic equipment ⋮ Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations ⋮ Vertex covering with capacitated trees ⋮ Redistricting without gerrymandering, utilizing the convexity ratio, and other applications to business and industry ⋮ Solving continuous location-districting problems with Voronoi diagrams ⋮ Multiple criteria districting problemsthe public transportation network pricing system of the Paris region ⋮ A multiple server location-allocation model for service system design ⋮ 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 ⋮ A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization ⋮ Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning ⋮ A multiplicatively-weighted Voronoi diagram approach to logistics districting ⋮ Service allocation equity in location coverage analytics ⋮ Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
Cites Work
- Solving a large scale districting problem: A case report
- Some experiments with simulated annealing techniques for packing problems
- A tabu search heuristic and adaptive memory procedure for political districting
- An Optimization Based Heuristic for Political Districting
- A Multiple Dispatch Queueing Model of Police Patrol Operations
- A Patrol Car Allocation Model: Capabilities and Algorithms
- Optimal Political Districting by Implicit Enumeration Techniques
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A simulated annealing approach to police district design
