Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems
Journal of Optimization Theory and Applications
On the convergence of generalized hill climbing algorithms
Discrete Applied Mathematics
A class of convergent generalized hill climbing algorithms
Applied Mathematics and Computation
| Hi-index | 0.00 |
Thispaper introduces ordinal hill climbing algorithms for addressingdiscrete manufacturing process design optimization problems usingcomputer simulation models. Ordinal hill climbing algorithmscombine the search space reduction feature of ordinal optimizationwith the global search feature of generalized hill climbing algorithms.By iteratively applying the ordinal optimization strategy withinthe generalized hill climbing algorithm framework, the resultinghybrid algorithm can be applied to intractable discrete optimizationproblems. Computational results on an integrated blade rotormanufacturing process design problem are presented to illustratethe application of the ordinal hill climbing algorithm. The relationshipbetween ordinal hill climbing algorithms and genetic algorithmsis also discussed. This discussion provides a framework for howthe ordinal hill climbing algorithm fits into currently appliedalgorithms, as well as to introduce a bridge between the twoalgorithms.