A Comparison of Local Search Methods for the Multicriteria Police Districting Problem on Graph

In the current economic climate, law enforcement agencies are facing resource shortages. The effective and efficient use of scarce resources is therefore of the utmost importance to provide a high standard public safety service. Optimization models specifically tailored to the necessity of police agencies can help to ameliorate their use. The Multicriteria Police Districting Problem (MC-PDP) on a graph concerns the definition of sound patrolling sectors in a police district. The objective of this problem is to partition a graph into convex and continuous subsets, while ensuring efficiency and workload balance among the subsets. The model was originally formulated in collaboration with the Spanish National Police Corps. We propose for its solution three local search algorithms: a Simple Hill Climbing, a Steepest Descent Hill Climbing, and a Tabu Search. To improve their diversification capabilities, all the algorithms implement a multistart procedure, initialized by randomized greedy solutions. The algorithms are empirically tested on a case study on the Central District of Madrid. Our experiments show that the solutions identified by the novel Tabu Search outperform the other algorithms. Finally, research guidelines for future developments on the MC-PDP are given

A Comparison of Local Search Methods for the Multicriteria Police Districting Problem on Graph

In the current economic climate, law enforcement agencies are facing resource shortages. The effective and efficient use of scarce resources is therefore of the utmost importance to provide a high standard public safety service. Optimization models specifically tailored to the necessity of police agencies can help to ameliorate their use. The Multicriteria Police Districting Problem (MC-PDP) on a graph concerns the definition of sound patrolling sectors in a police district. The objective of this problem is to partition a graph into convex and continuous subsets, while ensuring efficiency and workload balance among the subsets. The model was originally formulated in collaboration with the Spanish National Police Corps. We propose for its solution three local search algorithms: a Simple Hill Climbing, a Steepest Descent Hill Climbing, and a Tabu Search. To improve their diversification capabilities, all the algorithms implement a multistart procedure, initialized by randomized greedy solutions. The algorithms are empirically tested on a case study on the Central District of Madrid. Our experiments show that the solutions identified by the novel Tabu Search outperform the other algorithms. Finally, research guidelines for future developments on the MC-PDP are given

Police districting problem: literature review and annotated bibliography

The police districting problem concerns the efficient and effective design of patrol sectors in terms of performance attributes. Effectiveness is particularly important as it directly influences the ability of police agencies to stop and prevent crime. However, in this problem, a homogeneous distribution of workload is also desirable to guarantee fairness to the police agents and an increase in their satisfaction. This chapter provides a systematic review of the literature related to the police districting problem, whose history dates back to almost 50 years ago. Contributions are categorized in terms of attributes and solution methodology adopted. Also, an annotated bibliography that presents the most relevant elements of each research is given

How real-world data can facilitate the development of precision medicine treatment in psychiatry

Precision medicine has the ambition to improve treatment response and clinical outcomes through patient stratification, and holds great potential in mental disorders. However, several important factors are needed to transform current practice into a “precision psychiatry” framework. Most important are (1) the generation of accessible large real-world training and test data including genomic data integrated from multiple sources, (2) the development and validation of advanced analytical tools for stratification and prediction, and (3) the development of clinically useful management platforms for patient monitoring that can be integrated into healthcare systems in real-life settings. This narrative review summarizes strategies for obtaining the key elements – well-powered samples from large biobanks, integrated with electronic health records and health registry data using novel artificial intelligence algorithms – to predict outcomes in severe mental disorders and translate these models into clinical management and treatment approaches. Key elements are massive mental health data and novel artificial intelligence algorithms. For the clinical translation of these strategies, we discuss a precision medicine platform for improved management of mental disorders. We include use cases to illustrate how precision medicine interventions could be brought into psychiatry to improve the clinical outcomes of mental disorders

A decision support system for predictive police patrolling

In the current economic climate, many police agencies have reduced resources, especially personnel, with a consequential increase in workload and deterioration in public safety. A Decision Support System (DSS) can help to optimize effective use of the scarce human resources available. In this paper we present a DSS that merges predictive policing capabilities with a patrolling districting model, for the design of predictive patrolling areas. The proposed DSS, developed in close collaboration with the Spanish National Police Corps (SNPC), defines partitions of the territory under the jurisdiction of a district that are efficient and balanced at the same time, according to the preferences of a decision maker. To analyze the crime records provided by the SNPC, a methodology for the description of spatially and temporally indeterminate crime events has been developed. The DSS has been tested with a case study in the Central District of Madrid. The results of the experiments show that the proposed DSS clearly outperforms the patrolling area definitions currently in use by the SNPC. To compare the solutions in terms of efficiency loss, we discuss how to build an operational envelope for the problem considered, which can be used to identify the range of performances associated with different patrolling strategies

A multi-criteria Police Districting Problem for the efficient and effective design of patrol sector

The Police Districting Problem (PDP) concerns the efficient and effective design of patrol sectors in terms of performance attributes such as workload, response time, etc. A balanced definition of the patrol sector is desirable as it results in crime reduction and in better service. In this paper, a multi-criteria Police Districting Problem defined in collaboration with the Spanish National Police Corps is presented. This is the first model for the PDP that considers the attributes of area, risk, compactness, and mutual support. The decision-maker can specify his/her preferences on the attributes, on workload balance, and efficiency. The model is solved by means of a heuristic algorithm that is empirically tested on a case study of the Central District of Madrid. The solutions identified by the model are compared to patrol sector configurations currently in use and their quality is evaluated by public safety service coordinators. The model and the algorithm produce designs that significantly improve on the current ones

AnaLog: Testing Analytical and Deductive Logic Learnability in Language Models

We investigate the extent to which pre-trained language models acquire analytical and deductive logical reasoning capabilities as a side effect of learning word prediction. We present AnaLog, a natural language inference task designed to probe models for these capabilities, controlling for different invalid heuristics the models may adopt instead of learning the desired generalisations. We test four languagemodels on AnaLog, finding that they have all learned, to a different extent, to encode information that is predictive of entailment beyond shallow heuristics such as lexical overlap and grammaticality. We closely analyse the best performing language model and show that while it performs more consistently than other language models across logical connectives and reasoning domains, it still is sensitive to lexical and syntactic variations in the realisation of logical statements

Ontology Completion Using Graph Convolutional Networks.

International audienc