Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/89876
Title: | Clustered coverage orienteering problem of unmanned surface vehicles for water sampling | Authors: | Zhang, W Wang, K Wang, S Laporte, G |
Issue Date: | Aug-2020 | Source: | Naval research logistics, Aug. 2020, v. 67, no. 5, p. 353-367 | 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. | Keywords: | Clustered coverage orienteering problem Exact algorithm Unmanned surface vehicle Water sampling |
Publisher: | John Wiley & Sons | Journal: | Naval research logistics | ISSN: | 0894-069X | EISSN: | 1520-6750 | DOI: | 10.1002/nav.21906 | Rights: | © 2020 Wiley Periodicals, Inc. This is the peer reviewed version of the following article: Zhang, W, Wang, K, Wang, S, Laporte, G. Clustered coverage orienteering problem of unmanned surface vehicles for water sampling. Naval Research Logistics. 2020; 67: 353– 367, which has been published in final form at https://doi.org/10.1002/nav.21906. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions. |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Clustered_coverage_orienteering_problem.pdf | Pre-Published version | 3.32 MB | Adobe PDF | View/Open |
Page views
73
Last Week
1
1
Last month
Citations as of Apr 28, 2024
Downloads
60
Citations as of Apr 28, 2024
SCOPUSTM
Citations
21
Citations as of Apr 26, 2024
WEB OF SCIENCETM
Citations
15
Citations as of May 2, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.