IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v168y2022ics1366554522003179.html
   My bibliography  Save this article

A patrol routing problem for maritime Crime-Fighting

Author

Listed:
  • Chen, Xinyuan
  • Wu, Shining
  • Liu, Yannick
  • Wu, Weiwei
  • Wang, Shuaian

Abstract

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.

Suggested Citation

  • Chen, Xinyuan & Wu, Shining & Liu, Yannick & Wu, Weiwei & Wang, Shuaian, 2022. "A patrol routing problem for maritime Crime-Fighting," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    • Handle: RePEc:eee:transe:v:168:y:2022:i:c:s1366554522003179
    DOI: 10.1016/j.tre.2022.102940
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554522003179
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2022.102940?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Basso, Rafael & Kulcsár, Balázs & Sanchez-Diaz, Ivan & Qu, Xiaobo, 2022. "Dynamic stochastic electric vehicle routing with safe reinforcement learning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    2. Thibaut Vidal & Nelson Maculan & Luiz Satoru Ochi & Puca Huachi Vaz Penna, 2016. "Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits," Transportation Science, INFORMS, vol. 50(2), pages 720-734, May.
    3. Dewil, R. & Vansteenwegen, P. & Cattrysse, D. & Van Oudheusden, D., 2015. "A minimum cost network flow model for the maximum covering and patrol routing problem," European Journal of Operational Research, Elsevier, vol. 247(1), pages 27-36.
    4. Wei Zhang & Kai Wang & Shuaian Wang & Gilbert Laporte, 2020. "Clustered coverage orienteering problem of unmanned surface vehicles for water sampling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(5), pages 353-367, August.
    5. Germond, Basil, 2015. "The geopolitical dimension of maritime security," Marine Policy, Elsevier, vol. 54(C), pages 137-142.
    6. Keskin, Burcu B. & Li, Shirley (Rong) & Steil, Dana & Spiller, Sarah, 2012. "Analysis of an integrated maximum covering and patrol routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 215-232.
    7. E J Willemse & J W Joubert, 2012. "Applying min–max k postmen problems to the routing of security guards," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 63(2), pages 245-260, February.
    8. Bueger, Christian, 2015. "What is maritime security?," Marine Policy, Elsevier, vol. 53(C), pages 159-164.
    9. Liu, Xiaohan & Qu, Xiaobo & Ma, Xiaolei, 2021. "Improving flex-route transit services with modular autonomous vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    10. Daganzo, Carlos F., 1984. "The length of tours in zones of different shapes," Transportation Research Part B: Methodological, Elsevier, vol. 18(2), pages 135-145, April.
    11. Shirley (Rong) Li & Burcu B Keskin, 2014. "Bi-criteria dynamic location-routing problem for patrol coverage," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(11), pages 1711-1725, November.
    12. Wang, Yong & Peng, Shouguo & Zhou, Xuesong & Mahmoudi, Monirehalsadat & Zhen, Lu, 2020. "Green logistics location-routing problem with eco-packages," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yan, Ran & Wang, Shuaian & Zhen, Lu, 2023. "An extended smart “predict, and optimize” (SPO) framework based on similar sets for ship inspection planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sukanya Samanta & Goutam Sen & Soumya Kanti Ghosh, 2022. "A literature review on police patrolling problems," Annals of Operations Research, Springer, vol. 316(2), pages 1063-1106, September.
    2. Timothy J. Surendonk & Paul A. Chircop, 2020. "On the computational complexity of the patrol boat scheduling problem with complete coverage," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(4), pages 289-299, June.
    3. Xiuqiao Sun & Jian Wang & Weitiao Wu & Wenjia Liu, 2018. "Genetic Algorithm for Optimizing Routing Design and Fleet Allocation of Freeway Service Overlapping Patrol," Sustainability, MDPI, vol. 10(11), pages 1-15, November.
    4. Garside, Annisa Kesy & Ahmad, Robiah & Muhtazaruddin, Mohd Nabil Bin, 2024. "A recent review of solution approaches for green vehicle routing problem and its variants," Operations Research Perspectives, Elsevier, vol. 12(C).
    5. Paul A. Chircop & Timothy J. Surendonk & Menkes H. L. van den Briel & Toby Walsh, 2022. "On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage," Annals of Operations Research, Springer, vol. 312(2), pages 723-760, May.
    6. Flynn Brendan, 2016. "The EU’s Maritime Security Strategy: a Neo-Medieval Perspective on the Limits of Soft Security?," Croatian International Relations Review, Sciendo, vol. 22(75), pages 9-37, August.
    7. Freeman, Nickolas K. & Keskin, Burcu B. & Çapar, İbrahim, 2018. "Attractive orienteering problem with proximity and timing interactions," European Journal of Operational Research, Elsevier, vol. 266(1), pages 354-370.
    8. Shoki Kosai & Hironobu Unesaki, 2016. "Conceptualizing maritime security for energy transportation security," Journal of Transportation Security, Springer, vol. 9(3), pages 175-190, December.
    9. James A. Malcolm, 2017. "‘Sustainability as Maritime Security: A Small Island Developing State Perspective?’," Global Policy, London School of Economics and Political Science, vol. 8(2), pages 237-245, May.
    10. Haughton, Michael A., 1998. "The performance of route modification and demand stabilization strategies in stochastic vehicle routing," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 551-566, November.
    11. Liwei Zeng & Sunil Chopra & Karen Smilowitz, 2019. "The Covering Path Problem on a Grid," Transportation Science, INFORMS, vol. 53(6), pages 1656-1672, November.
    12. Kim, Myungseob (Edward) & Schonfeld, Paul, 2015. "Maximizing net benefits for conventional and flexible bus services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 80(C), pages 116-133.
    13. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.
    14. Marlin W. Ulmer & Alan Erera & Martin Savelsbergh, 2022. "Dynamic service area sizing in urban delivery," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(3), pages 763-793, September.
    15. Lee, Enoch & Cen, Xuekai & Lo, Hong K., 2022. "Scheduling zonal-based flexible bus service under dynamic stochastic demand and Time-dependent travel time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    16. Kim, Myungseob (Edward) & Schonfeld, Paul, 2014. "Integration of conventional and flexible bus services with timed transfers," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 76-97.
    17. Daganzo, Carlos F. & Ouyang, Yanfeng & Yang, Haolin, 2020. "Analysis of ride-sharing with service time and detour guarantees," Transportation Research Part B: Methodological, Elsevier, vol. 140(C), pages 130-150.
    18. Jiang, Zhoutong & Lei, Chao & Ouyang, Yanfeng, 2020. "Optimal investment and management of shared bikes in a competitive market," Transportation Research Part B: Methodological, Elsevier, vol. 135(C), pages 143-155.
    19. Zhang, Jiyu & Ge, Ying-En & Tang, Chunyan & Zhong, Meisu, 2024. "Optimising modular-autonomous-vehicle transit service employing coupling–decoupling operations plus skip-stop strategy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 184(C).
    20. Pourvaziri, H. & Sarhadi, H. & Azad, N. & Afshari, H. & Taghavi, M., 2024. "Planning of electric vehicle charging stations: An integrated deep learning and queueing theory approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 186(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:168:y:2022:i:c:s1366554522003179. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.