Ordinal optimization approach to stochastic simulation optimization problems and applications
檔案
本條目沒有附加檔案。
日期
2006
類型
系所
期刊名稱
Proceedings of the 15th IASTED International Conference on Applied Simulation and Modelling
卷期與頁次
頁 274–279
ISBN
0-88986-559-0
語言
英文
摘要
In this paper, we propose an ordinal optimization approach to solve for a good enough solution of the stochastic simulation optimization problem with huge decision-variable space. We apply the proposed ordinal optimization algorithm to G/G/1/K polling systems to solve for a good enough number-limited service discipline to minimize the weighting average waiting time. We have compared our results with those obtained by the existing service disciplines and found that our approach outperforms the existing ones. We have also used the genetic algorithm and simulated annealing method to solve the same stochastic simulation optimization problem, and the results show that our approach is much more superior in the aspects of computational efficiency and the quality of obtained solution.
關鍵詞
ordinal optimizationstochastic simulation optimizationneural networkgenetic algorithmpolling systemaverage waiting time所屬典藏
會議論文引用此條目
Lin, S.-Y., & Horng, S.-C. (2006). Ordinal optimization approach to stochastic simulation optimization problems and applications. Proceedings of the 15th IASTED International Conference on Applied Simulation and Modelling, 274–279. https://ir.lib.nycu.edu.tw/handle/11536/17388
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/17388