Ordinal Optimization

One of Dr. Chen's Research Subjects

Email: cchen9@gmu.edu


Traditional optimization approaches focus on iteratively searching the design universe and converging to the best one. However, these approaches can be time consuming. Even the simulation of a single design can be expensive because accurately estimating performance measures usually requires long simulation. Thus, finding the best design is often infeasible for large discrete-event systems.

Instead of insisting on picking the best design, Ordinal Optimization concentrates on finding good, or better, designs and reduces the required simulation time dramatically. Ordinal Optimization has been applied on a 10-node network, where it is shown that we can isolate a good design with high probability with relatively short simulations, instead of long simulations. They also demonstrate many orders of magnitude of speedup.

A crucial issue to apply Ordinal Optimization is the ability of knowing when we are confident or satisfied enough with the ordinal results, e.g., a good subset has been determined with high probability. To fully utilize the advantages of ordinal Optimization, in this subject, we are developing effective approaches to quantify the simulation confidence level, particularly for large discrete-event systems.

A highly recommended wet site for ordinal optimization is the one developed by the inventor, Professor Yu-Chi (Larry) Ho at Harvard University.


Selected Publications


Back to Professor Chun-Hung Chen's Page