By Topic

A new search algorithm for discrete stochastic optimization

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

2 Author(s)
Alrefaei, M.H. ; Dept. of Ind. Eng., Wisconsin Univ., Madison, WI, USA ; Andradottir, S.

We present a new method for finding a global optimal solution to a discrete stochastic optimization problem. This method resembles the simulated annealing method for discrete deterministic optimization. However, in our method the annealing schedule (the cooling temperature) is kept fixed, and the mechanism for estimating the optimal solution is different from that used in the original simulated annealing method. We state a convergence result that shows that our method converges almost surely to a global optimal solution under mild conditions. We also present empirical results that illustrate the performance of the proposed approach on a simple example

Published in:

Simulation Conference Proceedings, 1995. Winter

Date of Conference:

3-6 Dec 1995