Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/94140
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | en_US |
dc.creator | Chen, X | en_US |
dc.creator | Yan, R | en_US |
dc.creator | Wu, S | en_US |
dc.creator | Liu, Z | en_US |
dc.creator | Mo, H | en_US |
dc.creator | Wang, S | en_US |
dc.date.accessioned | 2022-08-11T01:07:22Z | - |
dc.date.available | 2022-08-11T01:07:22Z | - |
dc.identifier.issn | 0308-8839 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/94140 | - |
dc.language.iso | en | en_US |
dc.publisher | Routledge, Taylor & Francis Group | en_US |
dc.rights | © 2022 Informa UK Limited, trading as Taylor & Francis Group | en_US |
dc.rights | This is an Accepted Manuscript of an article published by Taylor & Francis in Maritime policy and management on 31 Dec 2021 (Published online), available online: http://www.tandfonline.com/10.1080/03088839.2021.2017042. | en_US |
dc.subject | Fleet deployment | en_US |
dc.subject | Maritime rescue | en_US |
dc.subject | Minimal covering time | en_US |
dc.subject | Mixed-integer programming problem | en_US |
dc.title | A fleet deployment model to minimise the covering time of maritime rescue missions | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 724 | en_US |
dc.identifier.epage | 749 | en_US |
dc.identifier.volume | 50 | en_US |
dc.identifier.issue | 6 | en_US |
dc.identifier.doi | 10.1080/03088839.2021.2017042 | en_US |
dcterms.abstract | This paper investigates a covering time minimisation problem of the maritime rescue missions that arise in practical rescue operations in the context of Hong Kong waters. In this problem, a fleet of heterogeneous vessels is deployed at marine police bases to deal with emergencies. Once an emergency rescue request is received, the marine police should send sufficient vessels to arrive at the incident site as soon as possible to provide critical medical service to the injured or the sick. A basic question to the rescue missions is that what is the minimal covering time that marine police could promise to arrive at any incident site. The shorter time the water district can be covered, the more likely lives and properties can be saved and the better the rescue service is. To address this problem, this paper formulates a mixed-integer programming model. Considering the expensive computational cost, a two-stage method is proposed. Extensive numerical experiments and a case study are performed to demonstrate the efficiency of the proposed algorithm and illustrate how our model can be applied to solve practical problems. Our study contributes to the stream of research on maritime rescue problem that is gaining increasing concern in recent years. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Maritime policy and management, 2023, v. 50, no, 6, p. 724-749 | en_US |
dcterms.isPartOf | Maritime policy and management | en_US |
dcterms.issued | 2023 | - |
dc.identifier.scopus | 2-s2.0-85122508620 | - |
dc.identifier.eissn | 1464-5254 | en_US |
dc.description.validate | 202208 bcrc | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | a1613 | - |
dc.identifier.SubFormID | 45617 | - |
dc.description.fundingSource | Others | en_US |
dc.description.fundingText | National Natural Science Foundation of China [Grant Numbers 72071173, 71831008, 71922007 and 71771050] | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Chen_Fleet_Deployment_Model.pdf | Pre-Published version | 1.47 MB | Adobe PDF | View/Open |
Page views
56
Last Week
1
1
Last month
Citations as of May 12, 2024
Downloads
52
Citations as of May 12, 2024
SCOPUSTM
Citations
11
Citations as of May 17, 2024
WEB OF SCIENCETM
Citations
7
Citations as of May 16, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.