Quantifying heuristics in the ordinal optimization framework

DOI10.1007/S10626-009-0087-2MaRDI QIDQ609560zbMATH OpenOpenAlexFDO

Authors Zhen Shen, Qing-Shan Jia, Qianchuan Zhao

Publication date 1 December 2010

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

Full work available at URL https://doi.org/10.1007/s10626-009-0087-2

zbMATH Keywords

hypothesis testingheuristicordinal optimizationdiscrete event dynamic systems

Mathematics Subject Classification ID

Design techniques (robust design, computer-aided design, etc.) (93B51) Discrete event control/observation systems (93C65) Stochastic systems in control theory (general) (93E03)

Recommendations

• Ordinal optimization and quantification of heuristic designs
• Ordinal optimisation and simulation
• Ordinal optimization through multi-objective reformulation
• A decision-theoretic framework for comparing heuristics
• Comparison of selection rules for ordinal optimization
• Ordinal Optimization
• scientific article; zbMATH DE number 3845070
• Constraint ordinal optimization
• Toward unification of exact and heuristic optimization methods

Cites work

• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• A new algorithm for stochastic discrete resource allocation optimization
• An explanation of ordinal optimization: Soft computing for hard problems
• Computing efforts allocation for ordinal optimization and discrete event simulation
• Nested Partitions Method for Global Optimization
• Ordinal optimization of DEDS
• Simulation budget allocation for further enhancing the efficiency of ordinal optimization
• Universal alignment probabilities and subset selection for ordinal optimization
• Universal alignment probability revisited
• Universal alignment probability revisited
• ``Neural computation of decisions in optimization problems

Cited in

(6)

• A discussion on performance value versus performance order
• Ordinal optimization approach to rare event probability problems
• Ordinal optimization and quantification of heuristic designs
• A genetic algorithm for finding good balanced sequences in a customer assignment problem with no state information
• An explanation of ordinal optimization: Soft computing for hard problems
• Ordinal optimization of DEDS

This page was built for publication: Quantifying heuristics in the ordinal optimization framework

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