A simulated annealing approach to police district design

Computers and Operations Research

Volumn 29, Issue 6, 2002, Pages 667-684

  D'Amico, Steven J ^a   Wang, Shoou Jiun ^b   Batta, Rajan ^c   Rump, Christopher M ^c  

^a Bouck and Lee Inc   (United States)

^b First USA Bank   (United States)

^c State University of New York ^*  (United States)

Author keywords

Districting; Graph partitioning; Hypercube queuing model; Patrol car allocation; Simulated annealing; Urban emergency services

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; COMPUTER SOFTWARE; LAW ENFORCEMENT; PROBLEM SOLVING;

POLICE DISTRICT DESIGN;

OPERATIONS RESEARCH;

POLICE FORCE; SIMULATED ANNEALING;

EID: 0036567952     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(01)00056-9     Document Type: Article

References (26)

1. The deployment of police, fire, and emergency medical units
2. A multiple dispatch queueing model of police patrol operations
3. Reconfiguring police reporting districts in the city of Buffalo
4. Political redistricting: A review
5. Determining New Zealand electoral districts using a network-based model
6. An optimization based heuristic for political districting
7. Optimal political districting by implicit enumeration techniques
8. Decision support system for a school districting problem
9. Solving a large scale districting problem: A case report
10. Simplified bipartisan computer redistricting
11. A tabu search heuristic for political districting
12. An objective method for establishing legislative districts
13. Solution techniques for large regional partitioning problems
14. A hypercube queuing model for facility location and redistricting in urban emergency services
15. Orlando magic
16. A patrol car allocation model: Background
17. A patrol car allocation model: Capabilities and algorithms
18. Patrol car allocation model
19. A patrol car allocation model
20. Concepts of scale in simulated annealing
21. Simulated annealing