On the computational complexity of the patrol boat scheduling problem with complete coverage

Our study is primarily concerned with analyzing the computational complexity of the patrol boat scheduling problem with complete coverage (PBSPCC). This combinatorial optimization problem has important implications for maritime border protection and surveillance operations. The objective of the PBSP...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Naval research logistics Ročník 67; číslo 4; s. 289 - 299
Hlavní autoři: Surendonk, Timothy J., Chircop, Paul A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hoboken, USA John Wiley & Sons, Inc 01.06.2020
Wiley Subscription Services, Inc
Témata:
Boats
Combinatorial analysis
Completeness
Complexity
computational complexity
continuous coverage problem
Defence craft
Optimization
patrol operations
Polynomials
routing
Scheduling
ISSN:0894-069X, 1520-6750
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Our study is primarily concerned with analyzing the computational complexity of the patrol boat scheduling problem with complete coverage (PBSPCC). This combinatorial optimization problem has important implications for maritime border protection and surveillance operations. The objective of the PBSPCC is to find a minimum size patrol boat fleet to provide ongoing continuous coverage at a set of maritime patrol regions, ensuring that there is at least one vessel on station in each patrol region at any given time. This requirement is complicated by the necessity for patrol vessels to be replenished on a regular basis in order to carry out patrol operations indefinitely. We introduce the PBSPCC via an example, discuss its relationship to related but dissimilar problems in the literature and proffer a mathematical description of the problem. We then show that the PBSPCC is NP‐hard by a transformation of the Hamiltonian graph decision problem into the problem of finding a minimum cyclic covering of a patrol network. We conclude that the associated decision problem of whether a patrol network has a continuous cover is NP‐complete, subject to the requirement that patrol covering solutions are cyclic of a bounded polynomial order.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0894-069X
1520-6750
DOI:10.1002/nav.21900