ORIGINAL RESEARCH article
Front. Ind. Eng.
Sec. Industrial Informatics
Volume 3 - 2025 | doi: 10.3389/fieng.2025.1620422
This article is part of the Research TopicLearning-driven Optimization for Solving Scheduling and LogisticsView all 4 articles
Hybrid Heuristic Approach for Generalized Police Officer Patrolling Problem
Provisionally accepted- Maebashi Institute of Technology, Maebashi, Japan
Select one of your emails
You have multiple emails registered with Frontiers:
Notify me on publication
Please enter your email address:
If you already have an account, please login
You don't have a Frontiers account ? You can register here
In urban areas with many commercial facilities, patrolling by police officers or security guards is essential for crime prevention, in addition to the use of surveillance cameras. To address the challenge of planning effective patrol routes, Tohyama and Tomisawa introduced the Police Officer Patrolling Problem (POPP), an arc routing problem that allows for visual monitoring from intersections and is proven to be NP-complete. Building on this work, we propose the Generalized POPP (GPOPP), a more realistic bi-objective combinatorial optimization model. This model simultaneously minimizes the total patrol route length and maximizes the coverage of surveillance areas. The contributions of this paper are threefold: (1) we formulate the GPOPP by incorporating practical constraints, such as mandatory patrolling of high-security roads and visibility-based coverage from intersections; (2) we develop a novel hybrid heuristic method that combines a multi-objective evolutionary algorithm (MoEA-HSS) with an improved Jaya algorithm to solve the GPOPP effectively; and (3) we conduct comprehensive computational experiments using benchmark instances to evaluate the effectiveness and competitiveness of the proposed method. These contributions demonstrate the practicality and efficiency of our approach for addressing realistic urban patrolling problems.
Keywords: Arc routing problem, Police Officer Patrolling Problem, Genetic Algorithm, MoEA-HSS, Jaya algorithm
Received: 29 Apr 2025; Accepted: 09 Jul 2025.
Copyright: © 2025 Kudo, Tohyama and Tomisawa. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) or licensor are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.
* Correspondence: Masaki Tomisawa, Maebashi Institute of Technology, Maebashi, Japan
Disclaimer: All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article or claim that may be made by its manufacturer is not guaranteed or endorsed by the publisher.