Genetic Cost Optimization of the GI/M/1/N Finite-Buffer Queue with a Single Vacation Policy

被引:0
|
作者
Gabryel, Marcin [1 ]
Nowicki, Robert K. [1 ]
Wozniak, Marcin [2 ]
Kempa, Wojciech M. [2 ]
机构
[1] Czestochowa Tech Univ, Inst Computat Intelligence, Al Armii Krajowej 36, PL-42200 Czestochowa, Poland
[2] Silesian Tech Univ, Inst Math, PL-44100 Gliwice, Poland
关键词
Busy period; finite-buffer queue; genetic algorithm; idle time; optimization; single vacation; SERVER;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the artice, problem of the cost optimization of the GI/M/1/N-type queue with finite buffer and a single vacation policy is analyzed. Basing on the explicit representation for the joint transform of the first busy period, first idle time and the number of packets transmitted during the first busy period and fixed values of unit costs of the server's functioning an optimal set of system parameters is found for exponentially distributed vacation period and 2-Erlang distribution of inter arrival times. The problem of optimization is solved using genetic algorithm. Different variants of the load of the system are considered as well.
引用
收藏
页码:12 / +
页数:3
相关论文
共 50 条