Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/89856
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Wu, L | - |
dc.creator | Jia, S | - |
dc.creator | Wang, S | - |
dc.date.accessioned | 2021-05-13T08:31:48Z | - |
dc.date.available | 2021-05-13T08:31:48Z | - |
dc.identifier.issn | 0377-2217 | - |
dc.identifier.uri | http://hdl.handle.net/10397/89856 | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.rights | © 2020 Elsevier B.V. All rights reserved. | en_US |
dc.subject | Branch-and-price | en_US |
dc.subject | Column generation | en_US |
dc.subject | Pilotage planning | en_US |
dc.subject | Port operations | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Sea pilot | en_US |
dc.title | Pilotage planning in seaports | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 90 | - |
dc.identifier.epage | 105 | - |
dc.identifier.volume | 287 | - |
dc.identifier.issue | 1 | - |
dc.identifier.doi | 10.1016/j.ejor.2020.05.009 | - |
dcterms.abstract | Vessel pilotage is compulsory in most seaports around the world. When traveling into or out of the terminal of a seaport, vessels should be navigated by sea pilots in order to follow correct and safe waterways. This paper studies a pilotage planning problem that involves decisions of scheduling the vessel traffic in a seaport, assigning work shifts to pilots, and scheduling the pilots in each work shift for vessel navigation. We formulate the problem as a linear mixed-integer programming (MIP) model that aims at minimizing the cost incurred by the pilotage operations, and show that the problem is strongly NP-hard. For solving the problem, we develop a branch-and-price (B&P) algorithm in which the pricing problem is solved by a novel dynamic programming algorithm. We further propose several acceleration techniques to improve the efficiency of the B&P algorithm. The computational performance of the B&P algorithm is evaluated in extensive numerical experiments. Computational results demonstrate that the B&P algorithm is able to solve problem instances of practical sizes, and that the algorithm outperforms a standard MIP solver and a solution method commonly used in practice. | - |
dcterms.accessRights | open access | - |
dcterms.bibliographicCitation | European journal of operational research, 16 Nov. 2020, v. 287, no. 1, p. 90-105 | - |
dcterms.isPartOf | European journal of operational research | - |
dcterms.issued | 2020-11-16 | - |
dc.identifier.scopus | 2-s2.0-85085350856 | - |
dc.identifier.eissn | 1872-6860 | - |
dc.description.validate | 202105 bchy | - |
dc.description.oa | Author’s Original | - |
dc.identifier.FolderNumber | a0794-n03 | - |
dc.identifier.SubFormID | 1653 | - |
dc.description.fundingSource | Others | - |
dc.description.fundingText | NSFC projects | - |
dc.description.pubStatus | Published | - |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Pilotage_Planning_in_Seaports.pdf | Preprint version | 1.12 MB | Adobe PDF | View/Open |
Page views
45
Last Week
1
1
Last month
Citations as of May 19, 2024
Downloads
98
Citations as of May 19, 2024
SCOPUSTM
Citations
25
Citations as of May 16, 2024
WEB OF SCIENCETM
Citations
20
Citations as of May 16, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.