DocumentCode
2196298
Title
Search space reduction in ordinal optimization for performance evaluation of DEDS
Author
Park, Kyung-Joan ; Choi, Chong-Ho
Author_Institution
Sch. of Electr. Eng. & Comput. Sci., Seoul Nat. Univ., South Korea
Volume
5
fYear
2001
fDate
2001
Firstpage
4541
Abstract
Simulation plays a vital role in analyzing DEDS. However, using simulation to analyze complex systems can be time-consuming and expensive. Particularly, in the case of precise performance evaluation, computing budget, time constraint, and pseudo-random number generator limitations can become prohibitive. Ordinal optimization is an effective approach for improving the efficiency of simulation and optimization of DEDS. However, the ordinal optimization approach does not pay much attention to the problem of large search space. In the paper, for the reduction of search space, we propose a combined approach, ordinal optimization with orthogonal arrays. With this approach, the problem of large search space in stochastic optimization can become more manageable. Consequently, the proposed method can be more efficient for the reduction of simulation burden compared to the conventional ordinal optimization method
Keywords
discrete event systems; optimisation; queueing theory; search problems; DEDS; combined approach; ordinal optimization; orthogonal arrays; performance evaluation; queueing networks; search space reduction; Analytical models; Calculus; Computational modeling; Computer simulation; Differential equations; Optimization methods; Performance analysis; Stochastic processes; System performance; Time factors;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 2001. Proceedings of the 40th IEEE Conference on
Conference_Location
Orlando, FL
Print_ISBN
0-7803-7061-9
Type
conf
DOI
10.1109/.2001.980919
Filename
980919
Link To Document