An explanation of ordinal optimization: Soft computing for hard problems
From MaRDI portal
Publication:1818951
DOI10.1016/S0020-0255(98)10056-7zbMath0931.90072WikidataQ126322766 ScholiaQ126322766MaRDI QIDQ1818951
Publication date: 5 January 2000
Published in: Information Sciences (Search for Journal in Brave)
90C90: Applications of mathematical programming
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
Related Items
Simulation optimization: a review of algorithms and applications, Quantifying heuristics in the ordinal optimization framework, Embedding evolutionary strategy in ordinal optimization for hard optimization problems, Constrained ordinal optimization -- a feasibility model based approach, Demonstration of probabilistic ordinal optimization concepts for continuous-variable optimization under uncertainty, Ordinal optimization and quantification of heuristic designs, Ordinal optimization of \(G/G/1/K\) polling systems with \(k\)-limited service discipline, Simple explanation of the no-free-lunch theorem and its implications, Constraint ordinal optimization, A probabilistic solution-generator for simulation, The equivalence between ordinal optimization in deterministic complex problems and in stochastic simulation problems, Multi-objective ordinal optimization for simulation optimization problems, Comparison of selection rules for ordinal optimization, A new approach to discrete stochastic optimization problems, An ordinal optimization based evolution strategy to schedule complex make-to-order products
Cites Work
- 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
- Rates of convergence of ordinal comparison for dependent discrete event dynamic systems
- Dynamics and convergence rate of ordinal comparison of stochastic discrete-event systems
- Explanation of goal softening in ordinal optimization
- Motion planning of walking robots in environments with uncertainty
