Constrained ordinal optimization -- a feasibility model based approach

DOI10.1007/s10626-006-8137-5zbMath1104.93058OpenAlexW2171122588MaRDI QIDQ859742

Yu-Chi Ho, Chen Song, Qian-Chuan Zhao, XiaoHong Guan

Publication date: 18 January 2007

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-006-8137-5

zbMATH Keywords

Subset selectionSimulation-based optimizationAlignment probabilityConstrained ordinal optimizationOrdinal optimization

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65)

Related Items (1)

Genetic-algorithm-based simulation optimization considering a single stochastic constraint

Cites Work

• Universal alignment probabilities and subset selection for ordinal optimization
• Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems
• Vector ordinal optimization
• Constraint ordinal optimization
• An explanation of ordinal optimization: Soft computing for hard problems
• Feature Article: Optimization for simulation: Theory vs. Practice
• Introduction to Stochastic Search and Optimization
• Explanation of goal softening in ordinal optimization
• The no free lunch theorems: complexity and security
• Universal alignment probability revisited

This page was built for publication: Constrained ordinal optimization -- a feasibility model based approach