8,857 research outputs found

    The Stochastics of Threshold Accepting: Analysis of an Application to the Uniform Design Problem

    Get PDF
    Threshold Accepting (TA) is a powerful optimization heuristic from the class of stochastic local search algorithms. It has been applied successfully to different optimization problems in statistics and econometrics, including the uniform design problem. Using the latter application as example, the stochastic properties of a TA implementation are analyzed. We provide a formal framework for the analysis of optimization heuristics like TA, which can be used to estimate lower bounds and to derive convergence results. It is also helpful for tuning real applications. Based on this framework, empirical results are presented for the uniform design problem. In particular, for two problem instances, the rate of convergence of the algorithm is estimated to be of the order of a power of -0.3 to -0.7 of the number of iterations. --Heuristic optimization,Threshold Accepting,Stochastic analysis of heuristics

    Optimal designs for mixed models in experiments based on ordered units

    Full text link
    We consider experiments for comparing treatments using units that are ordered linearly over time or space within blocks. In addition to the block effect, we assume that a trend effect influences the response. The latter is modeled as a smooth component plus a random term that captures departures from the smooth trend. The model is flexible enough to cover a variety of situations; for instance, most of the effects may be either random or fixed. The information matrix for a design will be a function of several variance parameters. While data will shed light on the values of these parameters, at the design stage, they are unlikely to be known, so we suggest a maximin approach, in which a minimal information matrix is maximized. We derive maximin universally optimal designs and study their robustness. These designs are based on semibalanced arrays. Special cases correspond to results available in the literature.Comment: Published in at http://dx.doi.org/10.1214/07-AOS518 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org

    Designs efficiency for non-market valuation with choice modelling: how to measure it, what to report and why

    Get PDF
    We review the basic principles for the evaluation of design efficiency in discrete choice modelling with a focus on efficiency of WTP estimates from the multinomial logit model. The discussion is developed under the realistic assumption that researchers can plausibly define a prior on the utility coefficients. Some new measures of design performance in applied studies are proposed and their rationale discussed. An empirical example based on the generation and comparison of fifteen separate designs from a common set of assumptions illustrates the relevant considerations to the context of non-market valuation, with particular emphasis placed on C-efficiency. Conclusions are drawn for the practice of reporting in non-market valuation and for future work on design research

    Comparing algorithms and criteria for designing Bayesian conjoint choice experiments.

    Get PDF
    The recent algorithm to find efficient conjoint choice designs, the RSC-algorithm developed by SƔndor and Wedel (2001), uses Bayesian design methods that integrate the D-optimality criterion over a prior distribution of likely parameter values. Characteristic for this algorithm is that the designs satisfy the minimal level overlap property provided the starting design complies with it. Another, more embedded, algorithm in the literature, developed by Zwerina et al. (1996), involves an adaptation of the modified Fedorov exchange algorithm to the multinomial logit choice model. However, it does not take into account the uncertainty about the assumed parameter values. In this paper, we adjust the modified Fedorov choice algorithm in a Bayesian fashion and compare its designs to those produced by the RSC-algorithm. Additionally, we introduce a measure to investigate the utility balances of the designs. Besides the widely used D-optimality criterion, we also implement the A-, G- and V-optimality criteria and look for the criterion that is most suitable for prediction purposes and that offers the best quality in terms of computational effectiveness. The comparison study reveals that the Bayesian modified Fedorov choice algorithm provides more efficient designs than the RSC-algorithm and that the Dand V-optimality criteria are the best criteria for prediction, but the computation time with the V-optimality criterion is longer.A-Optimality; Algorithms; Bayesian design; Bayesian modified Fedorov choice algorithm; Choice; Conjoint choice experiments; Criteria; D-Optimality; Design; Discrete choice experiments; Distribution; Effectiveness; Fashion; G-optimality; Logit; Methods; Model; Multinomial logit; Predictive validity; Quality; Research; RSC-algorithm; Studies; Time; Uncertainty; V-optimality; Value;
    • ā€¦
    corecore