Handling stochastic constraints in discrete optimization via simulation
- Title
- Handling stochastic constraints in discrete optimization via simulation
- Author
- 박철진
- Keywords
- Optimization; Partitioning algorithms; Indexes; Search problems; Numerical models; Convergence; History
- Issue Date
- 2011-12
- Publisher
- IEEE
- Citation
- Institute of Electrical and Electronics Engineers, Dec 2011, P.4212-4221
- Abstract
- 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.
- URI
- https://dl.acm.org/citation.cfm?id=2432021https://repository.hanyang.ac.kr/handle/20.500.11754/70542
- ISSN
- 0891-7736
- Appears in Collections:
- COLLEGE OF ENGINEERING[S](공과대학) > INDUSTRIAL ENGINEERING(산업공학과) > Articles
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML