Reducing police response times: optimization and simulation of everyday police patrol

DOI10.1002/NET.22241MaRDI QIDQ6599077zbMATH OpenFDO

Authors Maite Dewinter, Caroline Jagtenberg, Christophe Vandeviver, Philipp M. Dau, Tom Vander Beken, Frank Witlox

Publication date 5 September 2024

Published in Networks (Search for Journal in Brave)

zbMATH Keywords

trade-off\(p\)-median problemdiscrete-event simulationAntwerp (Belgium)intelligence-led policing

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10)

Recommendations

• Police patrol route optimization
• Determining optimal police patrol areas with maximal covering and backup covering location models
• Location-allocation models for traffic police patrol vehicles on an interurban network
• Police service district planning
• scientific article; zbMATH DE number 5244688

Cites work

• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An analysis of \(p\)-median location problem: effects of backup service level and demand assignment policy
• Benchmarking online dispatch algorithms for emergency medical services
• From reactive to proactive planning of ambulence services
• Locating Emergency Vehicle Bases When Service Time Depends on Call Location
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
• Time-dependent stochastic vehicle routing problem with random requests: application to online police patrol management in Brussels

This page was built for publication: Reducing police response times: optimization and simulation of everyday police patrol

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