\n \n \n
\n
\n\n \n \n \n \n \n \n Response Adaptivity Across Clinical Trials in Portfolios of Biomedical Innovations.\n \n \n \n \n\n\n \n Li, Z.; Chick, S. E.; and Henderson, S. G.\n\n\n \n\n\n\n 2026.\n
Submitted\n\n
\n\n
\n\n
\n\n \n \n
paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@unpublished{lichihen26,\n\tabstract = {New medical treatments are costly to develop and unlikely to successfully make their way through clinical trials, market access, and reimbursement. Moreover, new treatments for rare diseases are limited in both patient populations and reimbursement levels, further reducing their attractiveness as an investment. To increase the incentive to develop new treatments, portfolios of investments in new treatments in clinical trials have been proposed to financially de-risk drug development. We explore an important lever for further improving the incentives to develop treatments that is new in the context of biomedical portfolios: response-adaptive pilot studies in clinical trials that allow investments to be adjusted across projects as data are observed and that account for the importance of cost-effectiveness in gaining market access. We propose and analyze a model that shows that even a modest level of response adaptivity can materially improve financial outcomes from portfolios and improve the chances of new treatments making it to market, particularly when investment amounts are limited. We derive expected value of information heuristics to guide clinical trial management in the portfolio and the design of the portfolio, and use an illustrative numerical study motivated by pediatric oncology to show the value of using response-adaptive pilots for improving financial and health access outcomes.},\n\tauthor = {Zaile Li and Stephen E. Chick and Shane G. Henderson},\n\tdate-added = {2026-05-20 10:52:19 -0400},\n\tdate-modified = {2026-05-22 16:20:09 -0400},\n\tnote = {Submitted},\n\ttitle = {Response Adaptivity Across Clinical Trials in Portfolios of Biomedical Innovations},\n\turl_paper = {https://ssrn.com/abstract=6813739},\n\tyear = {2026}}\n\n\n
\n\n\n
\n New medical treatments are costly to develop and unlikely to successfully make their way through clinical trials, market access, and reimbursement. Moreover, new treatments for rare diseases are limited in both patient populations and reimbursement levels, further reducing their attractiveness as an investment. To increase the incentive to develop new treatments, portfolios of investments in new treatments in clinical trials have been proposed to financially de-risk drug development. We explore an important lever for further improving the incentives to develop treatments that is new in the context of biomedical portfolios: response-adaptive pilot studies in clinical trials that allow investments to be adjusted across projects as data are observed and that account for the importance of cost-effectiveness in gaining market access. We propose and analyze a model that shows that even a modest level of response adaptivity can materially improve financial outcomes from portfolios and improve the chances of new treatments making it to market, particularly when investment amounts are limited. We derive expected value of information heuristics to guide clinical trial management in the portfolio and the design of the portfolio, and use an illustrative numerical study motivated by pediatric oncology to show the value of using response-adaptive pilots for improving financial and health access outcomes.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Gradient-Based Optimization of Rolling-Horizon Power System Models.\n \n \n \n \n\n\n \n Gittoes, L. M.; Henderson, S. G.; and Mays, J. P.\n\n\n \n\n\n\n In Ramamohan, V.; Djanatliev, A.; Fakhimi, M.; Krejci, C.; Martin, C. R.; Onggo, B. S.; and Mustafee, N., editor(s),
Proceedings of the 2026 Winter Simulation Conference, pages Submitted, Piscataway, New Jersey, 2026. IEEE\n
\n\n
\n\n
\n\n
\n\n \n \n
paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{gitetal26,\n\tabstract = {Production cost models (PCMs) are central to the design and analysis of electricity systems, yet traditional\nformulations have shortcomings in systems with high renewable penetration and large battery storage. We\ndevelop a PCM that captures demand variability, the sequential revelation of uncertainty, and intertemporal\nconstraints such as battery state-of-charge dynamics, while remaining computationally tractable. The model\nuses a rolling-horizon optimization framework with a parameterized, time-varying terminal value of stored\nenergy to mitigate horizon boundary effects without prohibitively long lookahead horizons. We optimize this\nterminal-value vector using simulation optimization, with operations governed by embedded strictly convex\nquadratic programs. Expected costs are estimated via sample-average approximation and differentiated\nefficiently using infinitesimal perturbation analysis, enabling gradient-based optimization. To demonstrate\nproof of concept, we provide empirical results for a stylized high-storage power system. Our framework\nis applicable to simulation optimization of model-predictive control policies in other applications.},\n\taddress = {Piscataway, New Jersey},\n\tauthor = {Lilianna M. Gittoes and Shane G. Henderson and Jacob P. Mays},\n\tbooktitle = {Proceedings of the 2026 Winter Simulation Conference},\n\tdate-added = {2026-04-30 08:44:26 -0400},\n\tdate-modified = {2026-04-30 08:44:26 -0400},\n\teditor = {V. Ramamohan and A. Djanatliev and M. Fakhimi and C. Krejci and C. Ruiz Martin and B. S. Onggo and N. Mustafee},\n\tpages = {Submitted},\n\tpublisher = {IEEE},\n\ttitle = {Gradient-Based Optimization of Rolling-Horizon Power System Models},\n\turl_paper = {pubs/wsc26MPC.pdf},\n\tyear = {2026}}\n\n\n
\n\n\n
\n Production cost models (PCMs) are central to the design and analysis of electricity systems, yet traditional formulations have shortcomings in systems with high renewable penetration and large battery storage. We develop a PCM that captures demand variability, the sequential revelation of uncertainty, and intertemporal constraints such as battery state-of-charge dynamics, while remaining computationally tractable. The model uses a rolling-horizon optimization framework with a parameterized, time-varying terminal value of stored energy to mitigate horizon boundary effects without prohibitively long lookahead horizons. We optimize this terminal-value vector using simulation optimization, with operations governed by embedded strictly convex quadratic programs. Expected costs are estimated via sample-average approximation and differentiated efficiently using infinitesimal perturbation analysis, enabling gradient-based optimization. To demonstrate proof of concept, we provide empirical results for a stylized high-storage power system. Our framework is applicable to simulation optimization of model-predictive control policies in other applications.\n
\n\n\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Optimizing Portfolios of Multiple Treatments for One Indication.\n \n \n \n \n\n\n \n Li, Z.; Chick, S. E.; and Henderson, S. G.\n\n\n \n\n\n\n In Ramamohan, V.; Djanatliev, A.; Fakhimi, M.; Krejci, C.; Martin, C. R.; Onggo, B. S.; and Mustafee, N., editor(s),
Proceedings of the 2026 Winter Simulation Conference, pages Submitted, Piscataway, New Jersey, 2026. IEEE\n
\n\n
\n\n
\n\n
\n\n \n \n
paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{lietal26,\n\tabstract = {We consider a variation on ranking and selection that is motivated by the management of portfolios of biomedical projects. There are multiple new treatments for a single medical indication, and the goal is to maximize the probability of getting at least one treatment to succeed in a confirmatory trial. Subject to an overall budget constraint, the decision maker must decide which projects, if any, to explore with a costly pilot study before selecting a subset of projects for even costlier confirmatory trials. We study tradeoffs regarding which type of pilot to run (none, fixed-sample-size, adaptive) and the acquisition costs of projects. Pilots are shown to be helpful, especially adaptive designs that optimize the expected value of information.},\n\taddress = {Piscataway, New Jersey},\n\tauthor = {Zaile Li and Stephen E. Chick and Shane G. Henderson},\n\tbooktitle = {Proceedings of the 2026 Winter Simulation Conference},\n\tdate-added = {2026-04-12 09:52:12 -0400},\n\tdate-modified = {2026-04-30 08:47:09 -0400},\n\teditor = {V. Ramamohan and A. Djanatliev and M. Fakhimi and C. Krejci and C. Ruiz Martin and B. S. Onggo and N. Mustafee},\n\tpages = {Submitted},\n\tpublisher = {IEEE},\n\ttitle = {Optimizing Portfolios of Multiple Treatments for One Indication},\n\turl_paper = {pubs/wsc26Portfolios.pdf},\n\tyear = {2026}}\n\n\n
\n\n\n
\n We consider a variation on ranking and selection that is motivated by the management of portfolios of biomedical projects. There are multiple new treatments for a single medical indication, and the goal is to maximize the probability of getting at least one treatment to succeed in a confirmatory trial. Subject to an overall budget constraint, the decision maker must decide which projects, if any, to explore with a costly pilot study before selecting a subset of projects for even costlier confirmatory trials. We study tradeoffs regarding which type of pilot to run (none, fixed-sample-size, adaptive) and the acquisition costs of projects. Pilots are shown to be helpful, especially adaptive designs that optimize the expected value of information.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Flock Management for Solar Grazing.\n \n \n \n \n\n\n \n Slaugh, V.; Xin, L.; and Henderson, S. G.\n\n\n \n\n\n\n 2026.\n
Submitted\n\n
\n\n
\n\n
\n\n \n \n
paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@unpublished{slaxinhen25,\n\tauthor = {Vincent Slaugh and Linwei Xin and Shane G. Henderson},\n\tdate-added = {2025-04-26 10:08:23 -0400},\n\tdate-modified = {2026-03-10 09:26:09 -0400},\n\tnote = {Submitted},\n\ttitle = {Flock Management for Solar Grazing},\n\turl_paper = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=5231313},\n\tyear = {2026}}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Learning to Dispatch Volunteers to Out-of-Hospital Cardiac Arrests.\n \n \n \n \n\n\n \n van den Berg , P. L.; Fourmentraux, O.; Henderson, S. G.; Jagtenberg, C. J.; and Li, H.\n\n\n \n\n\n\n
Health Care Management Science,To appear. 2026.\n
\n\n
\n\n
\n\n
\n\n \n \n
paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{beretal24b,\n\tabstract = {Survival for out-of-hospital cardiac arrest can be significantly improved through volunteer efforts. To shorten the time to good-quality cardiopulmonary resuscitation, some emergency call centers use mobile phone technology to rapidly locate and alert nearby trained volunteers. Some such community first responder systems use phased alerts: notifying increasingly many volunteers with built-in time delays. The policy that defines the phasing of alerts affects both response times, which have a direct relation to survival, and the burden on volunteers. \n\nWe aim to optimize this policy, which involves trading off these two metrics. The policy may depend on real-time information: where the volunteers are observed in relation to the patient and how long triage took. A direct approach using dynamic programming yields some insights, but is too slow for real-time use. Our contribution lies in recasting this problem as a multi-class classification problem and solving it using empirical data from Auckland, New Zealand's community first response system. This case study shows that phasing the alerts \nbased on real-time information provides important improvements relative to a competitive baseline that is indicative of current practice.},\n\tauthor = {Pieter L. {van den Berg} and Oc{\\'e}ane Fourmentraux and Shane G. Henderson and Caroline J. Jagtenberg and Hemeng Li},\n\tdate-added = {2024-01-29 12:10:51 +1300},\n\tdate-modified = {2026-04-25 08:57:08 -0400},\n\tjournal = {Health Care Management Science},\n\tpages = {To appear},\n\ttitle = {Learning to Dispatch Volunteers to Out-of-Hospital Cardiac Arrests.},\n\turl_paper = {pubs/HCMS_Dispatching.pdf},\n\tyear = {2026},\n\tbdsk-url-1 = {https://doi.org/10.1007/s11134-022-09752-z}}\n\n\n
\n\n\n
\n Survival for out-of-hospital cardiac arrest can be significantly improved through volunteer efforts. To shorten the time to good-quality cardiopulmonary resuscitation, some emergency call centers use mobile phone technology to rapidly locate and alert nearby trained volunteers. Some such community first responder systems use phased alerts: notifying increasingly many volunteers with built-in time delays. The policy that defines the phasing of alerts affects both response times, which have a direct relation to survival, and the burden on volunteers. We aim to optimize this policy, which involves trading off these two metrics. The policy may depend on real-time information: where the volunteers are observed in relation to the patient and how long triage took. A direct approach using dynamic programming yields some insights, but is too slow for real-time use. Our contribution lies in recasting this problem as a multi-class classification problem and solving it using empirical data from Auckland, New Zealand's community first response system. This case study shows that phasing the alerts based on real-time information provides important improvements relative to a competitive baseline that is indicative of current practice.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Simulation of phased alerting of community first responders for cardiac arrest.\n \n \n \n \n\n\n \n van den Berg , P. L.; Henderson, S. G.; Li, H.; Dicker, B.; and Jagtenberg, C. J.\n\n\n \n\n\n\n
PLOS ONE. 2026.\n
To appear\n\n
\n\n
\n\n
\n\n \n \n
Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{beretal24,\n\tabstract = {Objective: Community First Responders (CFRs) are commonly used for out-of-hospital cardiac arrests,\nand advanced systems send so-called phased alerts: notifications with built-in time delays. The pol-\nicy that defines these delays affects both response times and volunteer fatigue: we help CFR system\nmanagers identify a good policy that balances the two.\nMethods: We compare policies by Monte Carlo Simulation, estimating patient survival, coverage, num-\nber of alerts and redundant CFR arrivals. We bootstrap acceptance probabilities and response delays\nfrom 29,307 rows of historical data covering all GoodSAM alerts in New Zealand between 1-12-2017\nand 30-11-2020. We simulate distances between the patient and CFRs by assuming that CFRs are\nlocated uniformly at random in a 1 km circle around the patient, for different CFR densities. Our\nsimulated CFRs travel with a distance-dependent speed that was estimated by linear regression on\nobserved speeds among those responders in the above-mentioned data set that eventually reached the\npatient.\nResults: The alerting policy has a large impact on the four metrics above. We show how this impact\ndepends on CFR density and for each density, we identify a policy that improves New Zealand's current\npolicy on all metrics.},\n\tauthor = {Pieter L. {van den Berg} and Shane G. Henderson and Hemeng Li and Bridget Dicker and Caroline J. Jagtenberg},\n\tdate-added = {2023-03-20 16:14:33 -0400},\n\tdate-modified = {2026-02-11 09:17:45 -0500},\n\tjournal = {{PLOS ONE}},\n\tnote = {To appear},\n\ttitle = {Simulation of phased alerting of community first responders for cardiac arrest.},\n\turl = {https://www.medrxiv.org/content/10.1101/2024.01.17.24301457v1},\n\tyear = {2026},\n\tbdsk-url-1 = {https://doi.org/10.1007/s11134-022-09752-z}}\n\n\n
\n\n\n
\n Objective: Community First Responders (CFRs) are commonly used for out-of-hospital cardiac arrests, and advanced systems send so-called phased alerts: notifications with built-in time delays. The pol- icy that defines these delays affects both response times and volunteer fatigue: we help CFR system managers identify a good policy that balances the two. Methods: We compare policies by Monte Carlo Simulation, estimating patient survival, coverage, num- ber of alerts and redundant CFR arrivals. We bootstrap acceptance probabilities and response delays from 29,307 rows of historical data covering all GoodSAM alerts in New Zealand between 1-12-2017 and 30-11-2020. We simulate distances between the patient and CFRs by assuming that CFRs are located uniformly at random in a 1 km circle around the patient, for different CFR densities. Our simulated CFRs travel with a distance-dependent speed that was estimated by linear regression on observed speeds among those responders in the above-mentioned data set that eventually reached the patient. Results: The alerting policy has a large impact on the four metrics above. We show how this impact depends on CFR density and for each density, we identify a policy that improves New Zealand's current policy on all metrics.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Large Language Models Can Invent Solvers Autonomously.\n \n \n \n\n\n \n Cen, W.; Eckman, D. J.; Henderson, S. G.; and Shashaani, S.\n\n\n \n\n\n\n In Ramamohan, V.; Djanatliev, A.; Fakhimi, M.; Krejci, C.; Martin, C. R.; Onggo, B. S.; and Mustafee, N., editor(s),
Proceedings of the 2026 Winter Simulation Conference, pages Submitted, Piscataway, New Jersey, 2026. IEEE\n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{cenetal26,\n\tabstract = {Designing efficient solvers for simulation optimization problems is labor intensive, requiring deep expertise\nin theory, algorithmic insight, and substantial engineering effort. We investigate a question that once seemed\nfar-fetched: can large language models (LLMs) invent solvers autonomously from a high-level algorithmic\nidea? We propose LISA, a framework in which LLM agents autonomously research, implement, evaluate,\nand refine simulation optimization solvers with limited human intervention. LISA has four stages: human\nproblem specification, literature synthesis by a research agent, iterative solver construction by a coding\nagent in an edit-run-evaluate loop, and post-hoc analysis of the resulting solver. As a case study, we\napply LISA to discrete simulation optimization, using the SimOpt library as a feedback environment, and\ndevelop DASTRO-DF, which extends ASTRO-DF's trust-region and adaptive sampling ideas to integer-\nvalued decision spaces. Preliminary results indicate that DASTRO-DF outperforms established solvers on\nbenchmark problems, demonstrating the promise of LLM-designed algorithms in simulation optimization.\n \n},\n\taddress = {Piscataway, New Jersey},\n\tauthor = {Wang Cen and David J. Eckman and Shane G. Henderson and Sara Shashaani},\n\tbooktitle = {Proceedings of the 2026 Winter Simulation Conference},\n\tdate-added = {2016-01-10 16:07:54 +0000},\n\tdate-modified = {2026-04-12 09:56:15 -0400},\n\teditor = {V. Ramamohan and A. Djanatliev and M. Fakhimi and C. Krejci and C. Ruiz Martin and B. S. Onggo and N. Mustafee},\n\tpages = {Submitted},\n\tpublisher = {IEEE},\n\ttitle = {Large Language Models Can Invent Solvers Autonomously},\n\tyear = {2026}}\n\n\n
\n\n\n
\n Designing efficient solvers for simulation optimization problems is labor intensive, requiring deep expertise in theory, algorithmic insight, and substantial engineering effort. We investigate a question that once seemed far-fetched: can large language models (LLMs) invent solvers autonomously from a high-level algorithmic idea? We propose LISA, a framework in which LLM agents autonomously research, implement, evaluate, and refine simulation optimization solvers with limited human intervention. LISA has four stages: human problem specification, literature synthesis by a research agent, iterative solver construction by a coding agent in an edit-run-evaluate loop, and post-hoc analysis of the resulting solver. As a case study, we apply LISA to discrete simulation optimization, using the SimOpt library as a feedback environment, and develop DASTRO-DF, which extends ASTRO-DF's trust-region and adaptive sampling ideas to integer- valued decision spaces. Preliminary results indicate that DASTRO-DF outperforms established solvers on benchmark problems, demonstrating the promise of LLM-designed algorithms in simulation optimization. \n
\n\n\n
\n\n\n\n\n\n