TY - JOUR
T1 - A patrol routing problem for maritime Crime-Fighting
AU - Chen, Xinyuan
AU - Wu, Shining
AU - Liu, Yannick
AU - Wu, Weiwei
AU - Wang, Shuaian
N1 - Funding Information:
This research is supported by the National Natural Science Foundation of China (grant numbers 72071173, 71831008, 71874081, U1933118), GuangDong Basic and Applied Basic Research Foundation (grant number 2019A1515011297), National Natural Science Foundation of Jiangsu Province, China (grant number BK20201296), Fundamental Research Funds for the Central Universities (grant number NS2022065).
Publisher Copyright:
© 2022 Elsevier Ltd
PY - 2022/12
Y1 - 2022/12
N2 - In this study, we investigate a patrol routing problem for fighting maritime crime that is motivated by challenges faced in actual practice. Although maritime shipping and ecosystems are critical to human well-being, shipping lanes and related natural resources are vulnerable to maritime crimes. However, the time, location, and extent of the illegal activities in these areas are largely unknown, and maritime authorities have scant resources (such as patrol boats and aircraft) to monitor them. To tackle this challenge, we propose a novel approach to identify suspicious ships and develop patrol routing methods to enhance the patrol efficiency. The problem of enhancing patrol efficiency is analyzed in three scenarios that differ according to the availability of aerial photographs. We formulate three mathematical programming models to address this problem in each scenario. The patrol route is optimally designed based on information available online. Extensive numerical experiments are conducted to validate the effectiveness and efficiency of the proposed patrol routing models. Maritime illegal activities are attracting increasing attention, and our proposed approach can be applied to various maritime crime scenarios in oceans and seas around the world.
AB - In this study, we investigate a patrol routing problem for fighting maritime crime that is motivated by challenges faced in actual practice. Although maritime shipping and ecosystems are critical to human well-being, shipping lanes and related natural resources are vulnerable to maritime crimes. However, the time, location, and extent of the illegal activities in these areas are largely unknown, and maritime authorities have scant resources (such as patrol boats and aircraft) to monitor them. To tackle this challenge, we propose a novel approach to identify suspicious ships and develop patrol routing methods to enhance the patrol efficiency. The problem of enhancing patrol efficiency is analyzed in three scenarios that differ according to the availability of aerial photographs. We formulate three mathematical programming models to address this problem in each scenario. The patrol route is optimally designed based on information available online. Extensive numerical experiments are conducted to validate the effectiveness and efficiency of the proposed patrol routing models. Maritime illegal activities are attracting increasing attention, and our proposed approach can be applied to various maritime crime scenarios in oceans and seas around the world.
KW - Integer programming
KW - Maritime crime-fighting
KW - Maritime security
KW - Patrol routing
KW - Selective traveling salesman problem
UR - http://www.scopus.com/inward/record.url?scp=85140808475&partnerID=8YFLogxK
U2 - 10.1016/j.tre.2022.102940
DO - 10.1016/j.tre.2022.102940
M3 - Journal article
AN - SCOPUS:85140808475
SN - 1366-5545
VL - 168
JO - Transportation Research Part E: Logistics and Transportation Review
JF - Transportation Research Part E: Logistics and Transportation Review
M1 - 102940
ER -