Browsing by Author "Golden, Bruce"
Now showing 1 - 3 of 3
Results Per Page
Sort Options
Item Estimating the Tour Length for the Close Enough Traveling Salesman Problem(MDPI, 2021-04-12) Roy, Debdatta Sinha; Golden, Bruce; Wang, Xingyin; Wasil, EdwardWe 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.Item Evaluating preferences for colorectal cancer screening in individuals under age 50 using the Analytic Hierarchy Process(Springer Nature, 2021-07-29) Hyams, Travis; Golden, Bruce; Sammarco, John; Sultan, Shahnaz; King-Marshall, Evelyn; Wang, Min Qi; Curbow, BarbaraIn 2021, the United States Preventive Services Task Force updated their recommendation, stating that individuals ages 45-49 should initiate screening for colorectal cancer. Since several screening strategies are recommended, making a shared decision involves including an individual’s preferences. Few studies have included individuals under age 50. In this study, we use a multicriteria decision analysis technique called the Analytic Hierarchy Process to explore preferences for screening strategies and evaluate whether preferences vary by age. Participants evaluated a hierarchy with 3 decision alternatives (colonoscopy, fecal immunochemical test, and computed tomography colonography), 3 criteria (test effectiveness, the screening plan, and features of the test) and 7 sub-criteria. We used the linear fit method to calculate consistency ratios and the eigenvector method for group preferences. We conducted sensitivity analysis to assess whether results are robust to change and tested differences in preferences by participant variables using chi-square and analysis of variance. Of the 579 individuals surveyed, 556 (96%) provided complete responses to the AHP portion of the survey. Of these, 247 participants gave responses consistent enough (CR < 0.18) to be included in the final analysis. Participants that were either white or have lower health literacy were more likely to be excluded due to inconsistency. Colonoscopy was the preferred strategy in those < 50 and fecal immunochemical test was preferred by those over age 50 (p = 0.002). These results were consistent when we restricted analysis to individuals ages 45-55 (p = 0.011). Participants rated test effectiveness as the most important criteria for making their decision (weight = 0.555). Sensitivity analysis showed our results were robust to shifts in criteria and sub-criteria weights. We reveal potential differences in preferences for screening strategies by age that could influence the adoption of screening programs to include individuals under age 50. Researchers and practitioners should consider at-home interventions using the Analytic Hierarchy Process to assist with the formulation of preferences that are key to shared decision-making. The costs associated with different preferences for screening strategies should be explored further if limited resources must be allocated to screen individuals ages 45-49.Item An Evolutionary Approach to the Multi-Level Capacitated Minimum Spanning Tree Problem(2002) Gamvros, Ioannis; Raghavan, S.; Golden, Bruce; ISR; CSHCNCapacitated network design is a crucial problem to telecommunications network planners. In this paper we consider the Multi-Level Capacitated Minimum Spanning Tree Problem (MLCMST), a generalization of the well-known Capacitated Minimum Spanning Tree Problem. We present a genetic algorithm, based on the notion of grouping, that is quite effective in solving large-scale problems to within 10% of optimality.