TY - GEN
T1 - Simulation-Based Optimization for Resource Allocation Problem in Finite-Source Queue with Heterogeneous Repair Facility
AU - Efrosinin, Dmitry
AU - Vishnevskiy, Vladimir
AU - Stepanova, Natalia
PY - 2025/2/16
Y1 - 2025/2/16
N2 - The paper deals with an optimal allocation problem in a finite-source queuing system where the repair facility consists of multiple heterogeneous servers. A threshold-based allocation policy prescribes the usage of slower servers according to given threshold levels of the queue lengths. This problem under markovian settings can be treated as a continuous-time Markov decision problem which was efficiently solved by dynamic programming algorithms. However, under conditions of uncertainty, when there is no information about the transient characteristics of the system and, in addition, the total number of states is too large, the simulation-based optimization methods must be applied. We use both the reinforcement learning methods and the random search method based on simulated annealing to solve the discrete optimization problem. Experimental results are compared with an actual solution obtained by policy iteration. Advantages and disadvantages of the methods and the peculiarities of their use for controllable queueing system are discussed.
AB - The paper deals with an optimal allocation problem in a finite-source queuing system where the repair facility consists of multiple heterogeneous servers. A threshold-based allocation policy prescribes the usage of slower servers according to given threshold levels of the queue lengths. This problem under markovian settings can be treated as a continuous-time Markov decision problem which was efficiently solved by dynamic programming algorithms. However, under conditions of uncertainty, when there is no information about the transient characteristics of the system and, in addition, the total number of states is too large, the simulation-based optimization methods must be applied. We use both the reinforcement learning methods and the random search method based on simulated annealing to solve the discrete optimization problem. Experimental results are compared with an actual solution obtained by policy iteration. Advantages and disadvantages of the methods and the peculiarities of their use for controllable queueing system are discussed.
UR - https://www.scopus.com/pages/publications/86000250041
U2 - 10.1007/978-3-031-80853-1_15
DO - 10.1007/978-3-031-80853-1_15
M3 - Conference proceedings
SN - 9783031808524
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 187
EP - 202
BT - Distributed Computer and Communication Networks
A2 - Vishnevsky, Vladimir M.
A2 - Samouylov, Konstantin E.
A2 - Kozyrev, Dmitry V.
PB - Springer Nature
ER -