Constrained ordinal optimization - A feasibility model based approach

Discrete Event Dynamic Systems: Theory and Applications

Volumn 16, Issue 2, 2006, Pages 279-299

  Guan, Xiaohong ^a   Song, Chen ^a   Ho, Yu Chi ^b   Zhao, Qianchuan ^c  

^a XI'AN JIAOTONG UNIVERSITY   (China)

^b TSINGHUA UNIVERSITY   (China)

^c HARVARD UNIVERSITY   (United States)

Author keywords

Alignment probability; Constrained ordinal optimization; Ordinal optimization; Simulation based optimization; Subset selection

Indexed keywords

ALGORITHMS; DISCRETE TIME CONTROL SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; SET THEORY;

ALIGNMENT PROBABILITY; CONSTRAINED ORDINAL OPTIMIZATION; ORDINAL OPTIMIZATION (OO); SIMULATION-BASED OPTIMIZATION; SUBSET SELECTION;

CONSTRAINT THEORY;

EID: 33646420905     PISSN: 09246703     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10626-006-8137-5     Document Type: Article

References (19)

1. Cassandras CG (1993). Discrete Event Systems: Modeling and Performance Analysis. Boston, Massachusetts: Aksen Associates.
2. Chen C, Donohue K, Yucesan E, Lin J (2003). Optimal computing budget allocation for Monte Carlo simulation with application to product design. Simulation Modeling Practice and Theory, 1157-74.
3. Dai L (1996). Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems, J. Optim. Theory and Appl., 91(2):363-388.
4. Fu M (2002). Optimization for simulation: theory vs. practice (feature article), INFORMS Journal on Computing, 14(3):192-215.
5. Han J, Kamber M (2002). Data Mining Concepts and Techniques. Beijing: Higher Education, ch. 3.
6. Ho YC (1994). Overview of ordinal optimization. In Proceedings of 33rd Conference on Decision and Control. Lake Buena Vista, Florida, pp. 1975-1977, December.
7. Ho YC (1999). An explanation of ordinal optimization: soft computing for hard problems. Information Sciences, 113:169-192.
8. Ho YC, Lin SY (2002). Universal alignment probability revisited, J. Optim. Theory and Appl., 113(2):399-408, May.
9. Ho YC, Sreenivas RS (1991). Ordinal optimization of discrete event dynamic systems, Journal of DEDS, 2(2):61-88.
10. Ho YC, Lee LH. Lau ETK (1999). Explanation of goal softening in ordinal optimization, IEEE Trans. Automat. Contr., 44(1):94-99.
11. Ho YC, Zhao Q, Pepyne DL (2003). The no free lunch theorems: complexity and security, IEEE Trans. Automat. Contr., 48(5). May.
12. Jia QS, Ho YC, Zhao QC (2005). Selection rules for ordinal optimization. Journal of Mathematical and Computer Modeling.
13. Lau TWE, Ho YC (1997). Universal alignment probabilities and subset selection for ordinal optimization, Journal of Optimization and Theory. 39(3).
14. Lee LH, Li WG, Ho YC (1999). Vector ordinal optimization - a new heuristic approach and its application to computer network routing design problems, Int. J. Oper. Quant. Manag., 5(3): 211-230.
15. Li D, Lee LH, Ho YC (2002). Constraint ordinal optimization, Information Sciences, 148:201-220.
16. Song C, Guan XH, Zhao QC, Ho YC (2005). Machine learning approach for determining feasible plans of a remanufacturing system, IEEE Transaction on Automation Science and Engineering, 2(3):262-275.
17. Spall JC (2003). Introduction to Stochastic Search and Optimization: Estimation Simulation and Control. Wiley, 1st edition. March.
18. Xie XL, (1998). Dynamics and convergence rate of ordinal comparison of stochastic discrete event systems, IEEE Transactions on Automatic Control.
19. Zhao QC, Ho YC, Jia OS (2005). Vector ordinal optimization, J. Optim. Theory and Appl., 125(2):259-274.