| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Logistics and Maritime Studies | - |
| dc.creator | Zhang, W | - |
| dc.creator | Wang, K | - |
| dc.creator | Wang, S | - |
| dc.creator | Laporte, G | - |
| dc.date.accessioned | 2021-05-13T08:31:57Z | - |
| dc.date.available | 2021-05-13T08:31:57Z | - |
| dc.identifier.issn | 0894-069X | - |
| dc.identifier.uri | http://hdl.handle.net/10397/89876 | - |
| dc.language.iso | en | en_US |
| dc.publisher | John Wiley & Sons | en_US |
| dc.subject | Clustered coverage orienteering problem | en_US |
| dc.subject | Exact algorithm | en_US |
| dc.subject | Unmanned surface vehicle | en_US |
| dc.subject | Water sampling | en_US |
| dc.title | Clustered coverage orienteering problem of unmanned surface vehicles for water sampling | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.spage | 353 | - |
| dc.identifier.epage | 367 | - |
| dc.identifier.volume | 67 | - |
| dc.identifier.issue | 5 | - |
| dc.identifier.doi | 10.1002/nav.21906 | - |
| dcterms.abstract | This study investigates a clustered coverage orienteering problem (CCOP), which is a generalization of the classical orienteering problem. The problem is widely motivated by the emerging unmanned techniques (eg, unmanned surface vehicles and drones) applied to environmental monitoring. Specifically, the unmanned surface vehicles (USVs) are used to monitor reservoir water quality by collecting samples. In the CCOP, the water sampling sites (ie, the nodes) are grouped into clusters, and a minimum number of nodes must be visited in each cluster. With each node representing a certain coverage area of the water, the objective of the CCOP is to monitor as much as possible the total coverage area in one tour of the USV, considering that overlapping areas provide no additional information. An integer programming model is first formulated through a linearization procedure that captures the overlapping feature. A two-stage exact algorithm is proposed to obtain an optimal solution to the problem. The efficiency and effectiveness of the two-stage exact algorithm are demonstrated through experiments on randomly generated instances. The algorithm can effectively solve instances with up to 60 sampling sites. | - |
| dcterms.accessRights | embargoed access | - |
| dcterms.bibliographicCitation | Naval research logistics, Aug. 2020, v. 67, no. 5, p. 353-367 | - |
| dcterms.isPartOf | Naval research logistics | - |
| dcterms.issued | 2020-08 | - |
| dc.identifier.scopus | 2-s2.0-85084990876 | - |
| dc.identifier.eissn | 1520-6750 | - |
| dc.description.validate | 202105 bchy | - |
| dc.description.oa | Not applicable | - |
| dc.identifier.FolderNumber | a0794-n02 | - |
| dc.identifier.SubFormID | 1652 | - |
| dc.description.fundingSource | Others | - |
| dc.description.fundingText | NSFC projects | - |
| dc.description.pubStatus | Published | - |
| dc.date.embargo | 2021.08.31 | en_US |
| Appears in Collections: | Journal/Magazine Article | |
Access
View full-text via PolyU eLinks 
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.