An epsilon-constraint method for integer-ordered bi-objective simulation optimization. Cooper, K., Hunter, S. R., & Nagaraj, K. In Chan, W. K. V., D'Ambrogio, A., Zacharewicz, G., Mustafee, N., Wainer, G., & Page, E., editors, Proceedings of the 2017 Winter Simulation Conference, pages 2303–2314, Piscataway, NJ, 2017. Institute of Electrical and Electronics Engineers, Inc.. ![An epsilon-constraint method for integer-ordered bi-objective simulation optimization [pdf]](https://bibbase.org/img/filetypes/pdf.svg "pdf")
Paper doi abstract bibtex Consider the context of integer-ordered bi-objective simulation optimization, in which the feasible region is a finite subset of the integer lattice. We propose a retrospective approximation (RA) framework to identify a local Pareto set that involves solving a sequence of sample-path bi-objective optimization problems at increasing sample sizes. We apply the epsilon-constraint method to each sample-path bi-objective optimization problem, thus solving a sequence of constrained single-objective problems in each RA iteration. We solve each constrained single-objective optimization problem using the SPLINE algorithm, thus exploiting gradient-based information. In early RA iterations, when sample sizes are small and standard errors are relatively large, we provide only a rough characterization of the Pareto set by making the number of epsilon-constraint problems a function of the standard error. As the RA algorithm progresses, the granularity of the characterization increases until we solve as many epsilon-constraint problems as there are points in the (finite) image of the local Pareto set. Our algorithm displays promising numerical performance.
@inproceedings{2017coohunnagWSC,
Year = {2017},
Author = {K. Cooper and S. R. Hunter and K. Nagaraj},
Title = {An epsilon-constraint method for integer-ordered bi-objective simulation optimization},
Booktitle = {Proceedings of the 2017 Winter Simulation Conference},
Editor = {W. K. V. Chan and A. {D'Ambrogio} and G. Zacharewicz and N. Mustafee and G. Wainer and E. Page},
Publisher = {Institute of Electrical and Electronics Engineers, Inc.},
Address = {Piscataway, NJ},
doi = {10.1109/WSC.2017.8247961},
pages = {2303--2314},
url = {http://web.ics.purdue.edu/~hunter63/PAPERS/pre2017coohunnagWSC.pdf},
abstract = {Consider the context of integer-ordered bi-objective simulation optimization, in which the feasible region is a finite subset of the integer lattice. We propose a retrospective approximation (RA) framework to identify a local Pareto set that involves solving a sequence of sample-path bi-objective optimization problems at increasing sample sizes. We apply the epsilon-constraint method to each sample-path bi-objective optimization problem, thus solving a sequence of constrained single-objective problems in each RA iteration. We solve each constrained single-objective optimization problem using the SPLINE algorithm, thus exploiting gradient-based information. In early RA iterations, when sample sizes are small and standard errors are relatively large, we provide only a rough characterization of the Pareto set by making the number of epsilon-constraint problems a function of the standard error. As the RA algorithm progresses, the granularity of the characterization increases until we solve as many epsilon-constraint problems as there are points in the (finite) image of the local Pareto set. Our algorithm displays promising numerical performance.},
keywords = {simulation optimization > multi-objective > integer-ordered}}
Downloads: 0
{"_id":"MgvTr8jyQzbK5fMDC","bibbaseid":"cooper-hunter-nagaraj-anepsilonconstraintmethodforintegerorderedbiobjectivesimulationoptimization-2017","author_short":["Cooper, K.","Hunter, S. R.","Nagaraj, K."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","year":"2017","author":[{"firstnames":["K."],"propositions":[],"lastnames":["Cooper"],"suffixes":[]},{"firstnames":["S.","R."],"propositions":[],"lastnames":["Hunter"],"suffixes":[]},{"firstnames":["K."],"propositions":[],"lastnames":["Nagaraj"],"suffixes":[]}],"title":"An epsilon-constraint method for integer-ordered bi-objective simulation optimization","booktitle":"Proceedings of the 2017 Winter Simulation Conference","editor":[{"firstnames":["W.","K.","V."],"propositions":[],"lastnames":["Chan"],"suffixes":[]},{"firstnames":["A."],"propositions":[],"lastnames":["D'Ambrogio"],"suffixes":[]},{"firstnames":["G."],"propositions":[],"lastnames":["Zacharewicz"],"suffixes":[]},{"firstnames":["N."],"propositions":[],"lastnames":["Mustafee"],"suffixes":[]},{"firstnames":["G."],"propositions":[],"lastnames":["Wainer"],"suffixes":[]},{"firstnames":["E."],"propositions":[],"lastnames":["Page"],"suffixes":[]}],"publisher":"Institute of Electrical and Electronics Engineers, Inc.","address":"Piscataway, NJ","doi":"10.1109/WSC.2017.8247961","pages":"2303–2314","url":"http://web.ics.purdue.edu/~hunter63/PAPERS/pre2017coohunnagWSC.pdf","abstract":"Consider the context of integer-ordered bi-objective simulation optimization, in which the feasible region is a finite subset of the integer lattice. We propose a retrospective approximation (RA) framework to identify a local Pareto set that involves solving a sequence of sample-path bi-objective optimization problems at increasing sample sizes. We apply the epsilon-constraint method to each sample-path bi-objective optimization problem, thus solving a sequence of constrained single-objective problems in each RA iteration. We solve each constrained single-objective optimization problem using the SPLINE algorithm, thus exploiting gradient-based information. In early RA iterations, when sample sizes are small and standard errors are relatively large, we provide only a rough characterization of the Pareto set by making the number of epsilon-constraint problems a function of the standard error. As the RA algorithm progresses, the granularity of the characterization increases until we solve as many epsilon-constraint problems as there are points in the (finite) image of the local Pareto set. Our algorithm displays promising numerical performance.","keywords":"simulation optimization > multi-objective > integer-ordered","bibtex":"@inproceedings{2017coohunnagWSC,\n\tYear = {2017},\n\tAuthor = {K. Cooper and S. R. Hunter and K. Nagaraj},\n\tTitle = {An epsilon-constraint method for integer-ordered bi-objective simulation optimization},\n\tBooktitle = {Proceedings of the 2017 Winter Simulation Conference},\n\tEditor = {W. K. V. Chan and A. {D'Ambrogio} and G. Zacharewicz and N. Mustafee and G. Wainer and E. Page},\n\tPublisher = {Institute of Electrical and Electronics Engineers, Inc.},\n Address = {Piscataway, NJ},\n\tdoi = {10.1109/WSC.2017.8247961},\n\tpages = {2303--2314},\n\turl = {http://web.ics.purdue.edu/~hunter63/PAPERS/pre2017coohunnagWSC.pdf},\n\tabstract = {Consider the context of integer-ordered bi-objective simulation optimization, in which the feasible region is a finite subset of the integer lattice. We propose a retrospective approximation (RA) framework to identify a local Pareto set that involves solving a sequence of sample-path bi-objective optimization problems at increasing sample sizes. We apply the epsilon-constraint method to each sample-path bi-objective optimization problem, thus solving a sequence of constrained single-objective problems in each RA iteration. We solve each constrained single-objective optimization problem using the SPLINE algorithm, thus exploiting gradient-based information. In early RA iterations, when sample sizes are small and standard errors are relatively large, we provide only a rough characterization of the Pareto set by making the number of epsilon-constraint problems a function of the standard error. As the RA algorithm progresses, the granularity of the characterization increases until we solve as many epsilon-constraint problems as there are points in the (finite) image of the local Pareto set. Our algorithm displays promising numerical performance.},\n\tkeywords = {simulation optimization > multi-objective > integer-ordered}}\n\n","author_short":["Cooper, K.","Hunter, S. R.","Nagaraj, K."],"editor_short":["Chan, W. K. V.","D'Ambrogio, A.","Zacharewicz, G.","Mustafee, N.","Wainer, G.","Page, E."],"key":"2017coohunnagWSC","id":"2017coohunnagWSC","bibbaseid":"cooper-hunter-nagaraj-anepsilonconstraintmethodforintegerorderedbiobjectivesimulationoptimization-2017","role":"author","urls":{"Paper":"http://web.ics.purdue.edu/~hunter63/PAPERS/pre2017coohunnagWSC.pdf"},"keyword":["simulation optimization > multi-objective > integer-ordered"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://web.ics.purdue.edu/~hunter63/PAPERS/srhunterweb.bib","dataSources":["ZEwmdExPMCtzAbo22","PkcXzWbdqPvM6bmCx"],"keywords":["simulation optimization > multi-objective > integer-ordered"],"search_terms":["epsilon","constraint","method","integer","ordered","objective","simulation","optimization","cooper","hunter","nagaraj"],"title":"An epsilon-constraint method for integer-ordered bi-objective simulation optimization","year":2017}