A Cooperative Iterated Greedy Algorithm for Multi-District Police Dispatching and Path Planning
Open Access
Abstract
Efficient cross-district police dispatching is vital for timely emergency response, yet it faces complex constraints involving coupled inter-district routing, task sequencing, escort capacities, and mandatory transfers at makeshift police posts. This study formulates the Multi-district Police Dispatching and Path Planning Problem (MDPDPP) with makespan minimization. To address the problem’s hierarchical structure, we propose a Cooperative Iterated Greedy (CIG) algorithm. The problem is decomposed into district-level routing and capacity-constrained intra-district task scheduling, which are jointly optimized through a cooperative search mechanism. A capacity-aware decoding and local search strategy is further developed to capture the non-linear effects of escort capacity dynamics and mandatory detours. Computational experiments on a wide range of instances show that the proposed CIG algorithm consistently outperforms several state-of-the-art metaheuristics in terms of solution quality and robustness. Friedman statistical tests further confirm the statistical significance of the observed performance improvements, demonstrating the effectiveness of the proposed approach for complex multi-district police dispatching systems.Keywords
This publication has 42 references indexed in Scilit:
- A metaheuristic approach for the multi-objective sustainable vehicle routing problemAnnals of Operations Research, 2025
- Ambulance routing optimization based on emergency medical service availabilityDiscover Artificial Intelligence, 2025
- A decomposition-based multi-objective evolutionary algorithm using infinitesimal methodApplied Soft Computing, 2024
- Recent dynamic vehicle routing problems: A surveyComputers & Industrial Engineering, 2021
- A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problemComputers & Operations Research, 2021
- DJAYA: A discrete Jaya algorithm for solving traveling salesman problemApplied Soft Computing, 2021
- A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variantsComputers & Industrial Engineering, 2020
- Tasks assigning and sequencing of multiple AGVs based on an improved harmony search algorithmJournal of Ambient Intelligence and Humanized Computing, 2018
- Workforce scheduling and routing problems: literature survey and computational studyAnnals of Operations Research, 2014
- A hypercube queuing model for facility location and redistricting in urban emergency servicesComputers & Operations Research, 1974