On the stability of the travelling salesman problem algorithm of Hopfield and Tank
Biological Cybernetics
An explanation of ordinal optimization: soft computing for hard problems
Information Sciences: an International Journal
Noisy Local Optimization with Evolution Strategies
Noisy Local Optimization with Evolution Strategies
Ordinal Optimization: Soft Computing for Hard Problems (International Series on Discrete Event Dynamic Systems)
Introduction to Discrete Event Systems
Introduction to Discrete Event Systems
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Quantifying Heuristics in the Ordinal Optimization Framework
Discrete Event Dynamic Systems
Brief An ordinal optimization approach to optimal control problems
Automatica (Journal of IFAC)
Evolutionary algorithm for stochastic job shop scheduling with random processing time
Expert Systems with Applications: An International Journal
Ordinal optimization based approach to the optimal resource allocation of grid computing system
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
This paper focuses on the performance evaluation of complex man-made systems, such as assembly lines, electric power grid, traffic systems, and various paper processing bureaucracies, etc. For such problems, applying the traditional optimization tool of mathematical programming and gradient descent procedures of continuous variables optimization are often inappropriate or infeasible, as the design variables are usually discrete and the accurate evaluation of the system performance via a simulation model can take too much calculation. General search type and heuristic methods are the only two methods to tackle the problems. However, the "goodness" of heuristic methods is generally difficult to quantify while search methods often involve extensive evaluation of systems at many design choices in a large search space using a simulation model resulting in an infeasible computation burden. The purpose of this paper is to address these difficulties simultaneously by extending the recently developed methodology of Ordinal Optimization (OO). Uniform samples are taken out from the whole search space and evaluated with a crude but computationally easy model when applying OO. And, we argue, after ordering via the crude performance estimates, that the lined-up uniform samples can be seen as an approximate ruler. By comparing the heuristic design with such a ruler, we can quantify the heuristic design, just as we measure the length of an object with a ruler. In a previous paper we showed how to quantify a heuristic design for a special case but we did not have the OO ruler idea at that time. In this paper we propose the OO ruler idea and extend the quantifying method to the general case and the multiple independent results case. Experimental results of applying the ruler are also given to illustrate the utility of this approach.