Genetic Cost Optimization of the GI/M/1/N Finite-Buffer Queue with a Single Vacation Policy
被引:0
|
作者:
Gabryel, Marcin
论文数: 0引用数: 0
h-index: 0
机构:
Czestochowa Tech Univ, Inst Computat Intelligence, Al Armii Krajowej 36, PL-42200 Czestochowa, PolandCzestochowa Tech Univ, Inst Computat Intelligence, Al Armii Krajowej 36, PL-42200 Czestochowa, Poland
Gabryel, Marcin
[1
]
Nowicki, Robert K.
论文数: 0引用数: 0
h-index: 0
机构:
Czestochowa Tech Univ, Inst Computat Intelligence, Al Armii Krajowej 36, PL-42200 Czestochowa, PolandCzestochowa Tech Univ, Inst Computat Intelligence, Al Armii Krajowej 36, PL-42200 Czestochowa, Poland
Nowicki, Robert K.
[1
]
Wozniak, Marcin
论文数: 0引用数: 0
h-index: 0
机构:
Silesian Tech Univ, Inst Math, PL-44100 Gliwice, PolandCzestochowa Tech Univ, Inst Computat Intelligence, Al Armii Krajowej 36, PL-42200 Czestochowa, Poland
Wozniak, Marcin
[2
]
Kempa, Wojciech M.
论文数: 0引用数: 0
h-index: 0
机构:
Silesian Tech Univ, Inst Math, PL-44100 Gliwice, PolandCzestochowa Tech Univ, Inst Computat Intelligence, Al Armii Krajowej 36, PL-42200 Czestochowa, Poland
Kempa, Wojciech M.
[2
]
机构:
[1] Czestochowa Tech Univ, Inst Computat Intelligence, Al Armii Krajowej 36, PL-42200 Czestochowa, Poland
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.