Ship Scheduling Algorithm Based on Markov-Modulated Fluid Priority Queues

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 a...

Full description

Saved in:
Bibliographic Details
Main Authors: Jianzhi Deng, Shuilian Lv, Yun Li, Liping Luo, Yishan Su, Xiaolin Wang, Xinzhi Liu
Format: Article
Language:English
Published: MDPI AG 2025-07-01
Series:Algorithms
Subjects:
Online Access:https://www.mdpi.com/1999-4893/18/7/421
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849714587749842944
author Jianzhi Deng
Shuilian Lv
Yun Li
Liping Luo
Yishan Su
Xiaolin Wang
Xinzhi Liu
author_facet Jianzhi Deng
Shuilian Lv
Yun Li
Liping Luo
Yishan Su
Xiaolin Wang
Xinzhi Liu
author_sort Jianzhi Deng
collection DOAJ
description 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.
format Article
id doaj-art-b5bc93cbd8c3470ab4ec7d2b29512d80
institution DOAJ
issn 1999-4893
language English
publishDate 2025-07-01
publisher MDPI AG
record_format Article
series Algorithms
spelling doaj-art-b5bc93cbd8c3470ab4ec7d2b29512d802025-08-20T03:13:39ZengMDPI AGAlgorithms1999-48932025-07-0118742110.3390/a18070421Ship Scheduling Algorithm Based on Markov-Modulated Fluid Priority QueuesJianzhi Deng0Shuilian Lv1Yun Li2Liping Luo3Yishan Su4Xiaolin Wang5Xinzhi Liu6College of Physics and Electronic Information Engineering, Guilin University of Technology, Guilin 541006, ChinaComputer Science and Engineering, Guilin University of Technology, Guilin 541006, ChinaSchool of Physics and Electronic Information, Guangxi Minzu University, Nanning 530006, ChinaSchool of Physics and Electronic Information, Guangxi Minzu University, Nanning 530006, ChinaSchool of Electrical and Automation Engineering, Tianjin University, Tianjin 300074, ChinaGuangxi Datengxia Water Control Project Development Co., Ltd., Nanning 530021, ChinaGuangxi Datengxia Water Control Project Development Co., Ltd., Nanning 530021, ChinaAs 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.https://www.mdpi.com/1999-4893/18/7/421ship anchorageMarkov-modulated fluid queuepriority schedulingcontinuous-time Markov chain
spellingShingle Jianzhi Deng
Shuilian Lv
Yun Li
Liping Luo
Yishan Su
Xiaolin Wang
Xinzhi Liu
Ship Scheduling Algorithm Based on Markov-Modulated Fluid Priority Queues
Algorithms
ship anchorage
Markov-modulated fluid queue
priority scheduling
continuous-time Markov chain
title Ship Scheduling Algorithm Based on Markov-Modulated Fluid Priority Queues
title_full Ship Scheduling Algorithm Based on Markov-Modulated Fluid Priority Queues
title_fullStr Ship Scheduling Algorithm Based on Markov-Modulated Fluid Priority Queues
title_full_unstemmed Ship Scheduling Algorithm Based on Markov-Modulated Fluid Priority Queues
title_short Ship Scheduling Algorithm Based on Markov-Modulated Fluid Priority Queues
title_sort ship scheduling algorithm based on markov modulated fluid priority queues
topic ship anchorage
Markov-modulated fluid queue
priority scheduling
continuous-time Markov chain
url https://www.mdpi.com/1999-4893/18/7/421
work_keys_str_mv AT jianzhideng shipschedulingalgorithmbasedonmarkovmodulatedfluidpriorityqueues
AT shuilianlv shipschedulingalgorithmbasedonmarkovmodulatedfluidpriorityqueues
AT yunli shipschedulingalgorithmbasedonmarkovmodulatedfluidpriorityqueues
AT lipingluo shipschedulingalgorithmbasedonmarkovmodulatedfluidpriorityqueues
AT yishansu shipschedulingalgorithmbasedonmarkovmodulatedfluidpriorityqueues
AT xiaolinwang shipschedulingalgorithmbasedonmarkovmodulatedfluidpriorityqueues
AT xinzhiliu shipschedulingalgorithmbasedonmarkovmodulatedfluidpriorityqueues