Decision, Operations & Information Technologies Research Works

Permanent URI for this collectionhttp://hdl.handle.net/1903/1588

Browse

Search Results

Now showing 1 - 10 of 17
  • Thumbnail Image
    Item
    Estimating the Tour Length for the Close Enough Traveling Salesman Problem
    (MDPI, 2021-04-12) Roy, Debdatta Sinha; Golden, Bruce; Wang, Xingyin; Wasil, Edward
    We construct empirically based regression models for estimating the tour length in the Close Enough Traveling Salesman Problem (CETSP). In the CETSP, a customer is considered visited when the salesman visits any point in the customer’s service region. We build our models using as many as 14 independent variables on a set of 780 benchmark instances of the CETSP and compare the estimated tour lengths to the results from a Steiner zone heuristic. We validate our results on a new set of 234 instances that are similar to the 780 benchmark instances. We also generate results for a new set of 72 larger instances. Overall, our models fit the data well and do a very good job of estimating the tour length. In addition, we show that our modeling approach can be used to accurately estimate the optimal tour lengths for the CETSP.
  • Thumbnail Image
    Item
    Individual differences in regulatory mode moderate the effectiveness of a pilot mHealth trial for diabetes management among older veterans
    (PLoS (Public Library of Science), 2018-03-07) Dugas, Michelle; Crowley, Kenyon; Gao, Guodong Gordon; Xu, Timothy; Agarwal, Ritu; Kruglanski, Arie W.; Steinle, Nanette
    mHealth tools to help people manage chronic illnesses have surged in popularity, but evidence of their effectiveness remains mixed. The aim of this study was to address a gap in the mHealth and health psychology literatures by investigating how individual differences in psychological traits are associated with mHealth effectiveness. Drawing from regulatory mode theory, we tested the role of locomotion and assessment in explaining why mHealth tools are effective for some but not everyone. A 13-week pilot study investigated the effectiveness of an mHealth app in improving health behaviors among older veterans (n = 27) with poorly controlled Type 2 diabetes. We developed a gamified mHealth tool (DiaSocial) aimed at encouraging tracking of glucose control, exercise, nutrition, and medication adherence. Important individual differences in longitudinal trends of adherence, operationalized as points earned for healthy behavior, over the course of the 13-week study period were found. Specifically, low locomotion was associated with unchanging levels of adherence during the course of the study. In contrast, high locomotion was associated with generally stronger adherence although it exhibited a quadratic longitudinal trend. In addition, high assessment was associated with a marginal, positive trend in adherence over time while low assessment was associated with a marginal, negative trend. Next, we examined the relationship between greater adherence and improved clinical outcomes, finding that greater adherence was associated with greater reductions in glycated hemoglobin (HbA1c) levels. Findings from the pilot study suggest that mHealth technologies can help older adults improve their diabetes management, but a “one size fits all” approach may yield suboptimal outcomes.
  • Thumbnail Image
    Item
    Online Appendix for “Gradient-Based Myopic Allocation Policy: An Efficient Sampling Procedure in a Low-Confidence Scenario”
    (2017) Peng, Yijie; Chen, Chun-Hung; Fu, Michael; Hu, Jian-Qiang
    This is the online appendix, which includes theoretical and numerical supplements containing some technical details and three additional numerical examples, which could not fit in the main body due to page limits by the journal for a technical note. The abstract for the main body is as follows: In this note, we study a simulation optimization problem of selecting the alternative with the best performance from a finite set, or a so-called ranking and selection problem, in a special low-confidence scenario. The most popular sampling allocation procedures in ranking and selection do not perform well in this scenario, because they all ignore certain induced correlations that significantly affect the probability of correct selection in this scenario. We propose a gradient-based myopic allocation policy (G-MAP) that takes the induced correlations into account, reflecting a trade-off between the induced correlation and the two factors (mean-variance) found in the optimal computing budget allocation formula. Numerical experiments substantiate the efficiency of the new procedure in the low-confidence scenario.
  • Thumbnail Image
    Item
    Online Appendix for “Ranking and Selection as Stochastic Control”
    (2017-04) Peng, Yijie; Chong, Edwin K. P.; Chen, Chun-Hung; Fu, Michael C.
  • Thumbnail Image
    Item
    Online Supplement to ‘Myopic Allocation Policy with Asymptotically Optimal Sampling Rate’
    (2016) Peng, Yijie; Fu, Michael
    In this online appendix, we test the performance of the AOMAP (asymptotically optimal myopic allocation policy) algorithm under the unknown variances scenario and compare it with EI (expected improvement) and OCBA (optimal computing budget allocation).
  • Thumbnail Image
    Item
    Instances for the Generalized Regenerator Location Problem
    (2015) Chen, Si; Ljubic, Ivana; Raghavan, S.
  • Thumbnail Image
    Item
    Instances for the Recoverable Robust Two-Level Network Design Problem
    (2014) Alvarez-Miranda, Eduardo; Ljubic, Ivana; Raghavan, S.; Toth, Paolo
    We provide the instances used in the paper "The Recoverable Robust Two-Level Network Design Problem", by E. Alvarez-Miranda, I. Ljubic, S. Raghavan and P. Toth, accepted for publication in the INFORMS J. on Computing, 2014 (http://dx.doi.org/10.1287/ijoc.2014.0606). This repository contains both the instances used in the paper as well as the results obtained by the proposed algorithm.
  • Thumbnail Image
    Item
    Online Supplement to `Efficient Simulation Resource Sharing and Allocation for Selecting the Best'
    (2012) Peng, Yijie; Chen, Chun-Hung; Fu, Michael; Hu, Jian-Qiang
    This is the online supplement to the article by the same authors, "Efficient Simulation Resource Sharing and Allocation for Selecting the Best," published in the IEEE Transactions on Automatic Control.
  • Thumbnail Image
    Item
    Note: An Application of the EOQ Model with Nonlinear Holding Cost to Inventory Management of Perishables
    (2005-07-19T20:53:40Z) Souza, Gilvan; Ferguson, Mark; Jayaraman, Vaidy
    We consider a variation of the economic order quantity (EOQ) model where cumulative holding cost is a nonlinear function of time. This problem has been studied by Weiss (1982), and we here show how it is an approximation of the optimal order quantity for perishable goods, such as milk, and produce, sold in small to medium size grocery stores where there are delivery surcharges due to infrequent ordering, and managers frequently utilize markdowns to stabilize demand as the product’s expiration date nears. We show how the holding cost curve parameters can be estimated via a regression approach from the product’s usual holding cost (storage plus capital costs), lifetime, and markdown policy. We show in a numerical study that the model provides significant improvement in cost vis-à-vis the classic EOQ model, with a median improvement of 40%. This improvement is more significant for higher daily demand rate, lower holding cost, shorter lifetime, and a markdown policy with steeper discounts.
  • Thumbnail Image
    Item
    A Large Deviations Analysis of Quantile Estimation with Application to Value at Risk
    (2005-07-01T12:31:49Z) Jin, Xing; Fu, Michael C.
    Quantile estimation has become increasingly important, particularly in the financial industry, where Value-at-Risk has emerged as a standard measurement tool for controlling portfolio risk. In this paper we apply the theory of large deviations to analyze various simulation-based quantile estimators. First, we show that the coverage probability of the standard quantile estimator converges to one exponentially fast with sample size. Then we introduce a new quantile estimator that has a provably faster convergence rate. Furthermore, we show that the coverage probability for this new estimator can be guaranteed to be 100% with sufficiently large, but finite, sample size. Numerical experiments on a VaR example illustrate the potential for dramatic variance reduction.