A Solution Method for the Maritime Pilot Scheduling Problem with Working Hour Regulations

Xiao, Liyang; Wang, Zhengpei; Tan, Zheyi; Wang, Chenghao

doi:10.1142/s0217595920400151

Cited by 3 publications

(4 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The re-scheduling problem extends the basic model by considering the recovery-type nature in the real scenario to minimize the cost of possible changes. Xiao et al [8] study a maritime pilot scheduling problem with working hour regulations. The established MIP model aims to minimize the total operating cost and is solved by a variable neighborhood search algorithm.…”

Section: Literature Reviewmentioning

confidence: 99%

“…After that, ship 1 goes back to Tokyo from day 9 to day 13 and is located at Tokyo on day 14. ), (H, [8,8]), (I, [13,13])] 4…”

Section: Experimental Designmentioning

confidence: 99%

“…[(D, [1, 1]), (H, [8,8]), (D, [14,14])] 19 [(H, [1, 3]), (S, [8,10])] 10 [(T, [1, 2]), (S, [7,8]), (D, [12,13])] 20 [(D, [1, 1]), (H, [8,8]), (D, [14,14])]…”

Section: Experimental Designmentioning

confidence: 99%

“…The corresponding problem can be defined as the FSCO routing and scheduling problem (FSCORSP), which can be classified as the personnel scheduling and routing problem (PSRP). The existing literature studying the PSRP in maritime transportation mainly focuses on the scheduling of personnel, including crews [5][6][7], pilots [8][9][10], and so on. However, very few of these works study the scheduling of inspectors [11][12][13].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Optimal Routing and Scheduling of Flag State Control Officers in Maritime Transportation

Qiao,

Yang,

Guo

et al. 2024

Mathematics

View full text Add to dashboard Cite

Maritime transportation plays a pivotal role in the global merchandise trade. To improve maritime safety and protect the environment, every state must effectively control ships flying its flag, which is called flag state control (FSC). However, the existing FSC system is so inefficient that it cannot perform its intended function. In this study, we adopt an optimization method to tackle this problem by constructing an integer programming (IP) model to solve the FSC officer routing and scheduling problem, which aims to maximize the total weight of inspected ships with limited budget and human resources. Then we prove that the IP model can be reformulated into a partially relaxed IP model with the guarantee of the result optimality. Finally, we perform a case study using the Hong Kong port as an example. The results show that our model can be solved to optimality within one second at different scales of the problem, with the ship number ranging from 20 to 1000. Furthermore, our study can be extended by considering the arrangement of working timetables with finer granularity and the fatigue level of personnel.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

“…After that, ship 1 goes back to Tokyo from day 9 to day 13 and is located at Tokyo on day 14. ), (H, [8,8]), (I, [13,13])] 4…”

Section: Experimental Designmentioning

confidence: 99%

“…[(D, [1, 1]), (H, [8,8]), (D, [14,14])] 19 [(H, [1, 3]), (S, [8,10])] 10 [(T, [1, 2]), (S, [7,8]), (D, [12,13])] 20 [(D, [1, 1]), (H, [8,8]), (D, [14,14])]…”

Section: Experimental Designmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Optimal Routing and Scheduling of Flag State Control Officers in Maritime Transportation

Qiao,

Yang,

Guo

et al. 2024

Mathematics

View full text Add to dashboard Cite

show abstract

Optimizing Pilotage Efficiency with Autonomous Surface Vehicle Assistance

Chu,

Zheng

2024

Electronics

View full text Add to dashboard Cite

Efficient pilotage planning is essential, particularly due to the increasing demand for skilled pilots amid frequent vessel traffic. Addressing pilot shortages and ensuring navigational safety, this study presents an innovative pilot-ASV scheduling strategy. This approach utilizes autonomous surface vehicles (ASVs) to assist or replace junior pilots in specific tasks, thereby alleviating pilot resource constraints and upholding safety standards. We develop a comprehensive mathematical model that accommodates pilot work time windows, various pilot levels, and ASV battery limitations. An improved artificial bee colony algorithm is proposed to solve this model effectively, integrating breadth-first and depth-first search strategies to enhance solution quality and efficiency uniquely. Extensive numerical experiments corroborate the model’s effectiveness, showing that our integrated optimization approach decreases vessel waiting times by an average of 9.18% compared to traditional methods without ASV integration. The findings underscore the potential of pilot-ASV scheduling to significantly improve both the efficiency and safety of vessel pilotages.

show abstract

Ship Selection and Inspection Scheduling in Inland Waterway Transport

Qiao,

Yang,

Pang

et al. 2024

Mathematics

View full text Add to dashboard Cite

Inland waterway transport is considered a critical component of sustainable maritime transportation and is subject to strict legal regulations on fuel quality. However, crew members often prefer cheaper, inferior fuels for economic reasons, making government inspections crucial. To address this issue, we formulate the ship selection and inspection scheduling problem into an integer programming model under a multi-inspector and multi-location scenario, alongside a more compact symmetry-eliminated model. The two models are developed based on ship itinerary information and inspection resources, aiming to maximize the total weight of the inspected ships. Driven by the unique property of the problem, a customized heuristic algorithm is also designed to solve the problem. Numerical experiments are conducted using the ships sailing on the Yangtze River as a case study. The results show that, from the perspective of the computation time, the compact model is 102.07 times faster than the original model. Compared with the optimal objectives value, the gap of the solution provided by our heuristic algorithm is 0.37% on average. Meanwhile, our algorithm is 877.19 times faster than the original model, demonstrating the outstanding performance of the proposed algorithm in solving efficiency.

show abstract

A Solution Method for the Maritime Pilot Scheduling Problem with Working Hour Regulations

Cited by 3 publications

References 14 publications

Optimal Routing and Scheduling of Flag State Control Officers in Maritime Transportation

Optimal Routing and Scheduling of Flag State Control Officers in Maritime Transportation

Optimizing Pilotage Efficiency with Autonomous Surface Vehicle Assistance

Ship Selection and Inspection Scheduling in Inland Waterway Transport

Contact Info

Product

Resources

About