By Topic

Handling stochastic constraints in discrete optimization via 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
$33 $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)
Chuljin Park ; Georgia Institute of Technology, 765 Ferst Dr NW, Atlanta, 30332, USA ; Seong-Hee Kim

We consider a discrete optimization via simulation problem with stochastic constraints on secondary performance measures where both objective and secondary performance measures need to be estimated by simulation. To solve the problem, we present a method called penalty function with memory (PFM), which determines a penalty value for a solution based on history of feasibility check on the solution. PFM converts a DOvS problem with stochastic constraints into a series of new optimization problems without stochastic constraints so that an existing DOvS algorithm can be applied to solve the new problem.

Published in:

Proceedings of the 2011 Winter Simulation Conference (WSC)

Date of Conference:

11-14 Dec. 2011