Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (6)

Search Parameters:
Keywords = nonstationary queuing system

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
30 pages, 5003 KiB  
Article
A Novel Truck Appointment System for Container Terminals
by Fatima Bouyahia, Sara Belaqziz, Youssef Meliani, Saâd Lissane Elhaq and Jaouad Boukachour
Sustainability 2025, 17(13), 5740; https://doi.org/10.3390/su17135740 - 22 Jun 2025
Viewed by 462
Abstract
Due to increased container traffic, the problems of congestion at terminal gates generate serious air pollution and decrease terminal efficiency. To address this issue, many terminals are implementing a truck appointment system (TAS) based on several concepts. Our work addresses gate congestion at [...] Read more.
Due to increased container traffic, the problems of congestion at terminal gates generate serious air pollution and decrease terminal efficiency. To address this issue, many terminals are implementing a truck appointment system (TAS) based on several concepts. Our work addresses gate congestion at a container terminal. A conceptual model was developed to identify system components and interactions, analyzing container flow from both static and dynamic perspectives. A truck appointment system (TAS) was modeled to optimize waiting times using a non-stationary approach. Compared to existing methods, our TAS introduces a more adaptive scheduling mechanism that dynamically adjusts to fluctuating truck arrivals, reducing peak congestion and improving resource utilization. Unlike traditional static appointment systems, our approach helps reduce truckers’ dissatisfaction caused by the deviation between the preferred time and the assigned one, leading to smoother operations. Various genetic algorithms were tested, with a hybrid genetic–tabu search approach yielding better results by improving solution stability and reducing computational time. The model was applied and adapted to the Port of Casablanca using real-world data. The results clearly highlight a significant potential to enhance sustainability, with an annual reduction of 785 tons of CO2 emissions from a total of 1281 tons. Regarding trucker dissatisfaction, measured by the percentage of trucks rescheduled from their preferred times, only 7.8% of arrivals were affected. This improvement, coupled with a 62% decrease in the maximum queue length, further promotes efficient and sustainable operations. Full article
(This article belongs to the Special Issue Innovations for Sustainable Multimodality Transportation)
Show Figures

Figure 1

15 pages, 448 KiB  
Article
Ergodicity and Related Bounds for One Particular Class of Markovian Time—Varying Queues with Heterogeneous Servers and Customer’s Impatience
by Yacov Satin, Rostislav Razumchik, Ivan Kovalev and Alexander Zeifman
Mathematics 2023, 11(9), 1979; https://doi.org/10.3390/math11091979 - 22 Apr 2023
Cited by 3 | Viewed by 1254
Abstract
We consider a non-standard class of Markovian time: varying infinite capacity queues with possibly heterogeneous servers and impatience. We assume that during service time, a customer may switch to the faster server (with no delay), when such a server becomes available and no [...] Read more.
We consider a non-standard class of Markovian time: varying infinite capacity queues with possibly heterogeneous servers and impatience. We assume that during service time, a customer may switch to the faster server (with no delay), when such a server becomes available and no other customers are waiting. As a result, customers in the queue may become impatient and leave it. Under this setting and with certain restrictions on the intensity functions, the quantity of interest, the total number of customers in the system, is the level-dependent birth-and-death process (BPD). In this paper, for the first time in the literature, explicit upper bounds for the distance between two probability distributions of this BDP are obtained. Using the obtained ergodicity bounds in combination with the sensitivity bounds, we assess the stability of BDP under perturbations. Truncation bounds are also given, which allow for numerical solutions with guaranteed truncation errors. Finally, we provide numerical results to support the findings. Full article
Show Figures

Figure 1

19 pages, 748 KiB  
Article
Non-Stationary Characteristics of AQM Based on the Queue Length
by Andrzej Chydzinski
Sensors 2023, 23(1), 485; https://doi.org/10.3390/s23010485 - 2 Jan 2023
Cited by 7 | Viewed by 1845
Abstract
We performed a non-stationary analysis of a class of buffer management schemes for TCP/IP networks, in which the arriving packets were rejected randomly, with probability depending on the queue length. In particular, we derived formulas for the packet waiting time (queuing delay) and [...] Read more.
We performed a non-stationary analysis of a class of buffer management schemes for TCP/IP networks, in which the arriving packets were rejected randomly, with probability depending on the queue length. In particular, we derived formulas for the packet waiting time (queuing delay) and the intensity of packet losses as functions of time. These results allow us to observe how the evolution of the waiting time and losses depend on initial conditions (e.g., the full buffer) and system parameters (e.g., dropping probabilities, load, packet size distribution). As side results, the stationary waiting time and packet loss probability were obtained. Numerical examples demonstrate applicability of the theoretical results. Full article
(This article belongs to the Section Communications)
Show Figures

Figure 1

14 pages, 10980 KiB  
Article
A Queuing Network Model of a Multi-Airport System Based on Point-Wise Stationary Approximation
by Xifan Zhao, Yanjun Wang, Lishuai Li and Daniel Delahaye
Aerospace 2022, 9(7), 390; https://doi.org/10.3390/aerospace9070390 - 19 Jul 2022
Cited by 13 | Viewed by 3410
Abstract
A multiple-airport system (MAS) consists of more than two airports in a metropolitan area under a large block of terminal airspace that is managed by one or two air traffic control units. When the capacity of an airport or of the terminal airspace [...] Read more.
A multiple-airport system (MAS) consists of more than two airports in a metropolitan area under a large block of terminal airspace that is managed by one or two air traffic control units. When the capacity of an airport or of the terminal airspace drops, flight delays occur in the MAS system. A quick estimation and predication of traffic congestion in the MAS is important yet challenging. This paper aims to develop a queuing network model of MAS using point-wise stationary queues. The model analyzes the changes of non-stationary queues under the principle of flow conservation to capture flight delay propagation in the system. Regression analyses are performed to examine the relationship between the arrival and departure efficiencies of different airports. The model is validated with the data of Guangdong–Hong Kong–Macao Greater Bay Area airports. Simulation results show that the model can effectively estimate flight delays in the MAS. Full article
(This article belongs to the Collection Air Transportation—Operations and Management)
Show Figures

Figure 1

16 pages, 668 KiB  
Article
Convergence Bounds for Limited Processor Sharing Queue with Impatience for Analyzing Non-Stationary File Transfer in Wireless Network
by Irina Kochetkova, Yacov Satin, Ivan Kovalev, Elena Makeeva, Alexander Chursin and Alexander Zeifman
Mathematics 2022, 10(1), 30; https://doi.org/10.3390/math10010030 - 22 Dec 2021
Cited by 2 | Viewed by 2457
Abstract
The data transmission in wireless networks is usually analyzed under the assumption of non-stationary rates. Nevertheless, they strictly depend on the time of day, that is, the intensity of arrival and daily workload profiles confirm this fact. In this article, we consider the [...] Read more.
The data transmission in wireless networks is usually analyzed under the assumption of non-stationary rates. Nevertheless, they strictly depend on the time of day, that is, the intensity of arrival and daily workload profiles confirm this fact. In this article, we consider the process of downloading a file within a single network segment and unsteady speeds—for arrivals, file sizes, and losses due to impatience. To simulate the scenario, a queuing system with elastic traffic with non-stationary intensity is used. Formulas are given for the main characteristics of the model: the probability of blocking a new user, the average number of users in service, and the queue. A method for calculating the boundaries of convergence of the model is proposed, which is based on the logarithmic norm of linear operators. The boundaries of the rate of convergence of the main limiting characteristics of the queue length process were also established. For clarity of the influence of the parameters, a numerical analysis was carried out and presented. Full article
(This article belongs to the Special Issue Stability Problems for Stochastic Models: Theory and Applications II)
Show Figures

Figure 1

16 pages, 2466 KiB  
Article
Transient Behavior of the MAP/M/1/N Queuing System
by Vladimir Vishnevsky, Konstantin Vytovtov, Elizaveta Barabanova and Olga Semenova
Mathematics 2021, 9(20), 2559; https://doi.org/10.3390/math9202559 - 13 Oct 2021
Cited by 13 | Viewed by 2384
Abstract
This paper investigates the characteristics of the MAP/M/1/N queuing system in the transient mode. The matrix method for solving the Kolmogorov equations is proposed. This method makes it possible, in general, to obtain the main characteristics of the considered queuing system in a [...] Read more.
This paper investigates the characteristics of the MAP/M/1/N queuing system in the transient mode. The matrix method for solving the Kolmogorov equations is proposed. This method makes it possible, in general, to obtain the main characteristics of the considered queuing system in a non-stationary mode: the probability of losses, the time of the transient mode, the throughput, and the number of customers in the system at time t. The developed method is illustrated by numerical calculations of the characteristics of the MAP/M/1/3 system in the transient mode. Full article
(This article belongs to the Section E: Applied Mathematics)
Show Figures

Figure 1

Back to TopTop