Constrained ordinal optimization -- a feasibility model based approach

DOI10.1007/S10626-006-8137-5MaRDI QIDQ859742zbMATH OpenOpenAlexFDO

Authors Chen Song, Yu-Chi Ho, Xiaohong Guan, Qianchuan Zhao

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)

Recommendations

• Ordinal optimisation and simulation
• Constraint ordinal optimization
• Comparison of selection rules for ordinal optimization
• The equivalence between ordinal optimization in deterministic complex problems and in stochastic simulation problems
• Ordinal Optimization

Cites work

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

Cited in

(4)

• Embedding evolutionary strategy in ordinal optimization for hard optimization problems
• Ordinal optimization through multi-objective reformulation
• Genetic-algorithm-based simulation optimization considering a single stochastic constraint
• Constraint ordinal optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q859742)