Next Article in Journal
Feature Transformation-Based Few-Shot Class-Incremental Learning
Previous Article in Journal
Comparative Analysis of BERT and GPT for Classifying Crisis News with Sudan Conflict as an Example
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Article

Ship Scheduling Algorithm Based on Markov-Modulated Fluid Priority Queues

1
College of Physics and Electronic Information Engineering, Guilin University of Technology, Guilin 541006, China
2
Computer Science and Engineering, Guilin University of Technology, Guilin 541006, China
3
School of Physics and Electronic Information, Guangxi Minzu University, Nanning 530006, China
4
School of Electrical and Automation Engineering, Tianjin University, Tianjin 300074, China
5
Guangxi Datengxia Water Control Project Development Co., Ltd., Nanning 530021, China
*
Author to whom correspondence should be addressed.
Algorithms 2025, 18(7), 421; https://doi.org/10.3390/a18070421
Submission received: 10 June 2025 / Revised: 3 July 2025 / Accepted: 7 July 2025 / Published: 8 July 2025

Abstract

As a key node in port logistics systems, ship anchorage is often faced with congestion caused by ship flow fluctuations, multi-priority scheduling imbalances and the poor adaptability of scheduling models to complex environments. To solve the above problems, this paper constructs a ship scheduling algorithm based on a Markov-modulated fluid priority queue, which describes the stochastic evolution of the anchorage operation state via a continuous-time Markov chain and abstracts the arrival and service processes of ships into a continuous fluid input and output mechanism modulated by the state. The algorithm introduces a multi-priority service strategy to achieve the differentiated scheduling of different types of ships and improves the computational efficiency and scalability based on a matrix analysis method. Simulation results show that the proposed model reduces the average waiting time of ships by more than 90% compared with the M/G/1/1 and RL strategies and improves the utilization of anchorage resources by about 20% through dynamic service rate adjustment, showing significant advantages over traditional scheduling methods in multi-priority scenarios.
Keywords: ship anchorage; Markov-modulated fluid queue; priority scheduling; continuous-time Markov chain ship anchorage; Markov-modulated fluid queue; priority scheduling; continuous-time Markov chain

Share and Cite

MDPI and ACS Style

Deng, J.; Lv, S.; Li, Y.; Luo, L.; Su, Y.; Wang, X.; Liu, X. Ship Scheduling Algorithm Based on Markov-Modulated Fluid Priority Queues. Algorithms 2025, 18, 421. https://doi.org/10.3390/a18070421

AMA Style

Deng J, Lv S, Li Y, Luo L, Su Y, Wang X, Liu X. Ship Scheduling Algorithm Based on Markov-Modulated Fluid Priority Queues. Algorithms. 2025; 18(7):421. https://doi.org/10.3390/a18070421

Chicago/Turabian Style

Deng, Jianzhi, Shuilian Lv, Yun Li, Liping Luo, Yishan Su, Xiaolin Wang, and Xinzhi Liu. 2025. "Ship Scheduling Algorithm Based on Markov-Modulated Fluid Priority Queues" Algorithms 18, no. 7: 421. https://doi.org/10.3390/a18070421

APA Style

Deng, J., Lv, S., Li, Y., Luo, L., Su, Y., Wang, X., & Liu, X. (2025). Ship Scheduling Algorithm Based on Markov-Modulated Fluid Priority Queues. Algorithms, 18(7), 421. https://doi.org/10.3390/a18070421

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop