Biobjective Simulation Optimization on Integer Lattices Using the Epsilon-Constraint Method in a Retrospective Approximation Framework

Kyle Cooper (), Susan R. Hunter () and Kalyani Nagaraj ()
Additional contact information
Kyle Cooper: School of Industrial Engineering, Purdue University, West Lafayette, Indiana 47907; Tata Consultancy Services, Milford, Ohio 45150;
Susan R. Hunter: School of Industrial Engineering, Purdue University, West Lafayette, Indiana 47907;
Kalyani Nagaraj: School of Industrial Engineering & Management, Oklahoma State University, Stillwater, Oklahoma 74078

INFORMS Journal on Computing, 2020, vol. 32, issue 4, 1080-1100

Abstract: We consider multiobjective simulation optimization (MOSO) problems on integer lattices, that is, nonlinear optimization problems in which multiple simultaneous objective functions can only be observed with stochastic error, for example, as output from a Monte Carlo simulation model. The solution to a MOSO problem is the efficient set, which is the set of all feasible decision points that map to nondominated points in the objective space. For problems with two objectives, we propose the retrospective partitioned epsilon-constraint with relaxed local enumeration (R-PERLE) algorithm. R-PERLE is designed for simulation efficiency and provably converges to a local efficient set under appropriate regularity conditions. It uses a retrospective approximation (RA) framework and solves each resulting biobjective sample-path problem only to an error tolerance commensurate with the sampling error. R-PERLE uses the subalgorithm RLE to certify it has found a sample-path approximate local efficient set. We also propose R-MinRLE, which is a provably convergent benchmark algorithm for problems with two or more objectives. R-PERLE performs favorably relative to R-MinRLE and the current state of the art, MO-COMPASS, in our numerical experiments. This work points to a family of RA algorithms for MOSO on integer lattices that employ RLE to certify sample-path approximate local efficient sets and for which we provide the convergence guarantees.

Keywords: multiobjective simulation optimization; retrospective approximation; epsilon-constraint (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://doi.org/10.1287/ijoc.2019.0918 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orijoc:v:32:y:4:i:2020:p:1080-1100

Access Statistics for this article

More articles in INFORMS Journal on Computing from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().