Cart (Loading....) | Create Account
Close category search window

Computing efforts allocation for ordinal optimization and discrete event simulation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hsiao-Chang Chen ; Dept. of Syst. Eng., Pennsylvania Univ., Philadelphia, PA, USA ; Chun-Hung Chen ; Yucesan, E.

Ordinal optimization has emerged as an efficient technique for simulation and optimization. Exponential convergence rates can be achieved in many cases. In this paper, we present a new approach that can further enhance the efficiency of ordinal optimization. Our approach intelligently determines the optimal number of simulation replications (or samples) and significantly reduces the total simulation cost. Numerical illustrations are included. The results indicate that our approach can obtain an additional 74% computation time reduction above and beyond the reduction obtained through the use of ordinal optimization for a 10-design example

Published in:

Automatic Control, IEEE Transactions on  (Volume:45 ,  Issue: 5 )

Date of Publication:

May 2000

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.