11 research outputs found
Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition
Environmental, social and economic concerns motivate the operation of closed-
loop supply chain networks (CLSCN) in many industries. We propose a novel profit
maximization model for CLSCN design as a mixed-integer linear program in which there is flexibility in covering the proportions of demand satisfied and returns collected based on the firm\u27s policies. Our major contribution is to develop a novel hybrid robust-stochastic programming (HRSP) approach to simultaneously model two different types of uncertainties by including stochastic scenarios for transportation costs and polyhedral uncertainty sets for demands and returns. Transportation cost scenarios are generated using a Latin Hypercube Sampling method and scenario reduction is applied to consolidate them. An accelerated stochastic Benders decomposition algorithm is proposed for solving this model. To speed up the convergence of this algorithm, valid inequalities are introduced to improve the quality of lower bound, and also a Pareto-optimal cut generation scheme is used to strengthen the Benders optimality cuts.
Numerical studies are performed to verify our mathematical formulation and also demonstrate the benefits of the HRSP approach. The performance improvements achieved by the valid inequalities and Pareto-optimal cuts are demonstrated in randomly generated instances
Personalized Data-Driven Learning and Optimization: Theory and Applications to Healthcare
This dissertation is broadly about developing new personalized data-driven learning and optimization methods with theoretical performance guarantees for three important applications in healthcare operations management and medical decision-making. In these research problems, we are dealing with longitudinal settings, where the decision-maker needs to make multi-stage personalized decisions while collecting data in-between stages. In each stage, the decision-maker incorporates the newly observed data in order to update his current system's model or belief, thereby making better decisions next. This new class of data-driven learning and optimization methods indeed learns from data over time so as to make efficient and effective decisions for each individual in real-time under dynamic, uncertain environments. The theoretical contributions lie in the design and analysis of these new predictive and prescriptive learning and optimization methods and proving theoretical performance guarantees for them. The practical contributions are to apply these methods to resolve unmet real-world needs in healthcare operations management and medical decision-making so as to yield managerial and practical insights and new functionality.PHDIndustrial & Operations EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/167949/1/keyvan_1.pd
Contextual Bandits with Budgeted Information Reveal
Contextual bandit algorithms are commonly used in digital health to recommend
personalized treatments. However, to ensure the effectiveness of the
treatments, patients are often requested to take actions that have no immediate
benefit to them, which we refer to as pro-treatment actions. In practice,
clinicians have a limited budget to encourage patients to take these actions
and collect additional information. We introduce a novel optimization and
learning algorithm to address this problem. This algorithm effectively combines
the strengths of two algorithmic approaches in a seamless manner, including 1)
an online primal-dual algorithm for deciding the optimal timing to reach out to
patients, and 2) a contextual bandit learning algorithm to deliver personalized
treatment to the patient. We prove that this algorithm admits a sub-linear
regret bound. We illustrate the usefulness of this algorithm on both synthetic
and real-world data
Resource planning strategies for healthcare systems during a pandemic
We study resource planning strategies, including the integrated healthcare resourcesâ allocation and sharing as well as patientsâ transfer, to improve the response of health systems to massive increases in demand during epidemics and pandemics. Our study considers various types of patients and resources to provide access to patient care with minimum capacity extension. Adding new resources takes time that most patients don't have during pandemics. The number of patients requiring scarce healthcare resources is uncertain and dependent on the speed of the pandemic's transmission through a region. We develop a multi-stage stochastic program to optimize various strategies for planning limited and necessary healthcare resources. We simulate uncertain parameters by deploying an agent-based continuous-time stochastic model, and then capture the uncertainty by a forward scenario tree construction approach. Finally, we propose a data-driven rolling horizon procedure to facilitate decision-making in real-time, which mitigates some critical limitations of stochastic programming approaches and makes the resulting strategies implementable in practice. We use two different case studies related to COVID-19 to examine our optimization and simulation tools by extensive computational results. The results highlight these strategies can significantly improve patient access to care during pandemics; their significance will vary under different situations. Our methodology is not limited to the presented setting and can be employed in other service industries where urgent access matters
Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition
Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition
Environmental, social and economic concerns motivate the operation of closed-
loop supply chain networks (CLSCN) in many industries. We propose a novel profit
maximization model for CLSCN design as a mixed-integer linear program in which there is flexibility in covering the proportions of demand satisfied and returns collected based on the firm's policies. Our major contribution is to develop a novel hybrid robust-stochastic programming (HRSP) approach to simultaneously model two different types of uncertainties by including stochastic scenarios for transportation costs and polyhedral uncertainty sets for demands and returns. Transportation cost scenarios are generated using a Latin Hypercube Sampling method and scenario reduction is applied to consolidate them. An accelerated stochastic Benders decomposition algorithm is proposed for solving this model. To speed up the convergence of this algorithm, valid inequalities are introduced to improve the quality of lower bound, and also a Pareto-optimal cut generation scheme is used to strengthen the Benders optimality cuts.
Numerical studies are performed to verify our mathematical formulation and also demonstrate the benefits of the HRSP approach. The performance improvements achieved by the valid inequalities and Pareto-optimal cuts are demonstrated in randomly generated instances.</p
Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition
Environmental, social and economic concerns motivate the operation of closed-loop supply chain networks (CLSCN) in many industries. We propose a novel profit maximization model for CLSCN design as a mixed-integer linear program in which there is flexibility in covering the proportions of demand satisfied and returns collected based on the firm's policies. Our major contribution is to develop a novel hybrid robust-stochastic programming (HRSP) approach to simultaneously model two different types of uncertainties by including stochastic scenarios for transportation costs and polyhedral uncertainty sets for demands and returns. Transportation cost scenarios are generated using a Latin Hypercube Sampling method and scenario reduction is applied to consolidate them. An accelerated stochastic Benders decomposition algorithm is proposed for solving this model. To speed up the convergence of this algorithm, valid inequalities are introduced to improve the lower bound quality, and also a Pareto-optimal cut generation scheme is used to strengthen the Benders optimality cuts. Numerical studies are performed to verify our mathematical formulation and also demonstrate the benefits of the HRSP approach. The performance improvements achieved by the valid inequalities and Pareto-optimal cuts are demonstrated in randomly generated instances.NOTICE: this is the authorâs version of a work that was accepted for publication in European Journal of Operational Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in European Journal of Operational Research, 249, issue 1, (2016): doi: 10.1016/j.ejor.2015.08.028</p
Coordinated and Priorityâbased Surgical Care: An Integrated Distributionally Robust Stochastic Optimization Approach
We study a Coordinated clinic and surgery Appointment Scheduling (CAS) problem for in-advance scheduling of surgical patients. Our models seek to provide timely access to care by coordinating clinic and surgery appointments to ensure that patients can see a surgeon in the clinic and (if needed) schedule their surgery within a maximum wait time target based on patient classes. There are different types of uncertainty including the number of appointment requests, whether a patient requires surgery, and surgery durations. We develop an Integrated Multi-stage Stochastic and Distributionally Robust Optimization (IMSDRO) approach to determine the optimal clinic and surgery dates for patients such that the access target constraints are satisfied, and the clinical and surgical overtimes are minimized. The IMSDRO approach synergizes multi-stage stochastic optimization with distributionally robust optimization to simultaneously incorporate multiple types of uncertainties by including stochastic scenarios for appointment request arrivals and ambiguity sets for surgery durations. Several new transformations are introduced to turn the nonlinear model derived from the IMSDRO approach to a tractable one, and a constraint generation algorithm is developed to solve it efficiently. We propose a data-driven Rolling Horizon Procedure (RHP) to facilitate implementation. We use case data to assess the performance of our policies. The results suggest that our policy can significantly improve surgical access delay times compared to the current practice. Our methodology is not limited to a particular setting and can be applied to other service industries where access delay matters