The equivalence between ordinal optimization in deterministic complex problems and in stochastic simulation problems
From MaRDI portal
Publication:2256885
DOI10.1007/s10626-006-9329-8zbMath1306.93080MaRDI QIDQ2256885
Yu-Chi Ho, Qing-Shan Jia, Qian-Chuan Zhao
Publication date: 23 February 2015
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10626-006-9329-8
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ordinal optimization of DEDS
- Universal alignment probabilities and subset selection for ordinal optimization
- Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems
- An explanation of ordinal optimization: Soft computing for hard problems
- Dynamics and convergence rate of ordinal comparison of stochastic discrete-event systems
- Explanation of goal softening in ordinal optimization
- Universal alignment probability revisited