OPTIMIZATION OF QUEUES USING AN INFINITESIMAL PERTURBATION ANALYSIS-BASED STOCHASTIC ALGORITHM WITH GENERAL UPDATE TIMES

被引:40
作者
CHONG, EKP [1 ]
RAMADGE, PJ [1 ]
机构
[1] PRINCETON UNIV,DEPT ELECT ENGN,PRINCETON,NJ 08544
关键词
PERTURBATION ANALYSIS; STOCHASTIC APPROXIMATION; QUEUING;
D O I
10.1137/0331032
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Convergence (with probability one) of a stochastic optimization algorithm for a single server queue is proved. The parameter to be optimized is updated using an infinitesimal perturbation analysis estimate of the gradient of the performance measure, and the updates are performed at general times. First, an algorithm in which the parameter is updated before each customer begins service is considered. Then it is shown how this analysis can be extended to an algorithm that updates at certain stopping times. The analysis suggests that the sample path behavior of the algorithm is similar to that of an algorithm that updates at the start of every busy period.
引用
收藏
页码:698 / 732
页数:35
相关论文
共 17 条
[1]  
Bartle R. G., 1966, ELEMENTS INTEGRATION
[2]  
Chong E. K. P., 1992, Discrete Event Dynamic Systems: Theory & Applications, V1, P339
[3]  
CHONG EKP, 1990, 28TH P ALL C COMM CO, P658
[4]   CONVERGENCE OF A STOCHASTIC-APPROXIMATION ALGORITHM FOR THE GI/G/1 QUEUE USING INFINITESIMAL PERTURBATION ANALYSIS [J].
FU, MC .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1990, 65 (01) :149-160
[5]  
FU MC, 1988, WIN P SIM C, P509
[6]  
Glynn P. W., 1986, 1986 Winter Simulation Conference Proceedings, P52, DOI 10.1145/318242.318260
[7]  
GUT A, 1988, STOPPED RANDOM WALKS
[8]  
KONSTANTOPOULOS P, 1990, INRIA1315 ANT RAPP R
[9]  
MEKETON MS, 1987, 1987 P WINT SIM C AT, P87
[10]   APPLICATIONS OF A KUSHNER AND CLARK LEMMA TO GENERAL CLASSES OF STOCHASTIC ALGORITHMS [J].
METIVIER, M ;
PRIOURET, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1984, 30 (02) :140-151