Swarm based Heuristic Optimization of the Recurrent Customers and Standby Server Under General Retrial Times

As queueing theory and modeling deal with queue length, waiting time and busy period, that all affect costs for an in institution and/or a busing corporation, the optimization plays a crucial role in such models. This paper focuses on the performance modeling and optimal configuration of a single-server retrial queue with recurrent customers and a standby server, operating under Bernoulli working vacation conditions. The primary aim of the paper is to analyze the dynamics of this queueing model to achieve minimal operational costs while ensuring high performance. Using the supplementary variable technique (SVT), the probability generating functions (PGFs) and steady-state probabilities for the system's states, have been obtained enabling the development of comprehensive performance measures. These measures were rigorously validated through numerical examples. To complement the performance analysis, a cost function was formulated and optimized using advanced techniques, including the grey wolf optimizer (GWO), bat algorithm (BA), whale optimization algorithm (WOA), and cat swarm optimization (CSO). The results revealed that these algorithms successfully minimized operational costs while maintaining optimal system efficiency.

Authors

Institutions

Publication Details

Journal
International Journal of Mathematical Engineering and Management Sciences
Published
2025-04-18
DOI
https://doi.org/10.33889/ijmems.2025.10.4.045
Primary Topic
Advanced Queuing Theory Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Swarm based Heuristic Optimization of the Recurrent Customers and Standby Server Under General Retrial Times

K. Indhira, Aliakbar Montazer Haghighi, N. Micheal Mathavavisakan
International Journal of Mathematical Engineering and Management Sciences
Advanced Queuing Theory Analysis
article

Swarm based Heuristic Optimization of the Recurrent Customers and Standby Server Under General Retrial Times

K. Indhira, Aliakbar Montazer Haghighi, N. Micheal Mathavavisakan
article en

Abstract

As queueing theory and modeling deal with queue length, waiting time and busy period, that all affect costs for an in institution and/or a busing corporation, the optimization plays a crucial role in such models. This paper focuses on the performance modeling and optimal configuration of a single-server retrial queue with recurrent customers and a standby server, operating under Bernoulli working vacation conditions. The primary aim of the paper is to analyze the dynamics of this queueing model to achieve minimal operational costs while ensuring high performance. Using the supplementary variable technique (SVT), the probability generating functions (PGFs) and steady-state probabilities for the system's states, have been obtained enabling the development of comprehensive performance measures. These measures were rigorously validated through numerical examples. To complement the performance analysis, a cost function was formulated and optimized using advanced techniques, including the grey wolf optimizer (GWO), bat algorithm (BA), whale optimization algorithm (WOA), and cat swarm optimization (CSO). The results revealed that these algorithms successfully minimized operational costs while maintaining optimal system efficiency.

International Journal of Mathematical Engineering and Management SciencesVol. 10(4)
Prairie View A&M University (US), Vellore Institute of Technology University (IN)
Openalex Percentile: Top 88%
Advanced Queuing Theory Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.