A Patrol Car Allocation Model: Capabilities and Algorithms

DOI10.1287/MNSC.24.12.1291MaRDI QIDQ4168772zbMATH OpenOpenAlexFDO

Authors J. M. Chaiken, Peter Dormont

Publication date 1978

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.24.12.1291

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Operations research and management science (90B99) Sensitivity, stability, parametric optimization (90C31) Applications of mathematical programming (90C90)

Cited in

(13)

• A queueing-location model with expected service time dependent queueing disciplines
• A 0-1 nonlinear programming model for coast guard fisheries law enforcement aircraft patrols
• Nonlinear goal programming model for the development of metropolitan police patrol units
• Heuristic methods and applications: A categorized survey
• 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
• Location-allocation models for traffic police patrol vehicles on an interurban network
• Technical note -- Optimal patrol of a perimeter
• A simulated annealing approach to police district design
• Police service district planning
• Simulative assessment of patrol car allocation and response time
• Data-driven dynamic police patrolling: an efficient Monte Carlo tree search
• Scheduling bodyguards

This page was built for publication: A Patrol Car Allocation Model: Capabilities and Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4168772)