The facility location problem with Bernoulli demands

This paper presents the facility location problem with Bernoulli demands. In this capacitated discrete location stochastic problem the goal is to define an a priori solution for the locations of the facilities and for the allocation of customers to the operating facilities that minimizes the sum of the fixed costs of the open facilities plus the expected value of the recourse function. The problem is formulated as a two-stage stochastic program and two different recourse actions are considered. For each of them, a closed form is presented for the recourse function and a deterministic equivalent formulation is obtained for the case in which the probability of demand is the same for all customers. Numerical results from computational experiments are presented and analyzed.     

Power of One-Sample Location Tests Under Distributions with Equal Lévy Distance

In this article, we study the power of one-sample location tests under classical distributions and two supermodels which include the normal distribution as a special case. The distributions of the supermodels are chosen in such a way that they have equal distance to the normal as the logistic, uniform, double exponential, and the Cauchy, respectively. As a measure of distance we use the Lévy metric. The tests considered are two parametric tests, the t-test and a trimmed t-test, and two nonparametric tests, the sign test and the Wilcoxon signed-rank tests. It turns out that the power of the tests, first of all, does not depend on the Lévy distance but on the special chosen supermodel.     

D-Optimal Two-Level Fractional Factorial Designs of Resolution III with Two Dispersion Factors

The problem of finding D-optimal designs, with two dispersion factors, for the estimation of all location main effects is investigated in the class of regular unreplicated two-level fractional factorial designs of resolution III. Designs having length three words involving both of the dispersion factors in the defining relation are shown to be inferior in terms of D-optimality. Tables of factors that are named as the two dispersion factors so that the resulting design is either D-optimal or has the largest determinant of the information matrix are provided. Rank-order of designs is studied when the number of length three words involving either one of the dispersion factors and the number of length four words involving both of the dispersion factors are fixed. Rank-order of designs when the numbers of aforementioned words are less than or equal to ten is given.     

Best linear unbiased and invariant estimation in location-scale families based on double-ranked set sampling

Abstract

In this article, we propose the best linear unbiased estimators (BLUEs) and best linear invariant estimators (BLIEs) for the unknown parameters of location-scale family of distributions based on double-ranked set sampling (DRSS) using perfect and imperfect rankings. These estimators are then compared with the BLUEs and BLIEs based on ranked set sampling (RSS). It is shown that under perfect ranking, the proposed estimators are uniformly better than the BLUEs and BLIEs obtained via RSS. We also propose the best linear unbiased quantile (BLUQ) and the best linear invariant quantile (BLIQ) estimators for normal distribution under DRSS. It is observed that the proposed quantile estimators are more efficient than the BLUQ and BLIQ estimators based on RSS for both perfect and imperfect orderings.     

The studentized location linear discriminant function

The location linear discriminant function is used in a two-population classification problem when the available data are generated from both binary and continuous random variables. Asymptotic distribution of the studentized location linear discriminant function is derived directly without the inversion of the corresponding characteristic function. The resulting plug-in estimate of the overall error of misclassification consists of the estimate based on the limiting distribution of the discriminant plus a correction term up to the second order. By comparison, our estimate avoids exact knowledge of the Mahalanobis distances which is necessary when the expansions of Vlachonikolis (1985) are used in the case of an arbitrary cut-off point. An example is re-examined and analysed in the present context.     

Robust Positioning of Service Units

In this paper, we address the problem of locating mobile service units to cover random incidents. The model does not assume complete knowledge of the probability distribution of the location of the incident to be covered. Instead, only the mean value of that distribution is known. We propose the minimization of the maximum expected response time as an effectiveness measure for the model. Thus, the solution obtained is robust with respect to any probability distribution. The cases of one and two service units under the nearest allocation rule are studied in the paper. For both problems, the optimal solutions are shown to be degenerate distributions for the servers.     

A multi-stage stochastic supply network design problem with financial decisions and risk management

In this paper, a multi-period supply chain network design problem is addressed. Several aspects of practical relevance are considered such as those related with the financial decisions that must be accounted for by a company managing a supply chain. The decisions to be made comprise the location of the facilities, the flow of commodities and the investments to make in alternative activities to those directly related with the supply chain design. Uncertainty is assumed for demand and interest rates, which is described by a set of scenarios. Therefore, for the entire planning horizon, a tree of scenarios is built. A target is set for the return on investment and the risk of falling below it is measured and accounted for. The service level is also measured and included in the objective function. The problem is formulated as a multi-stage stochastic mixed-integer linear programming problem. The goal is to maximize the total financial benefit. An alternative formulation which is based upon the paths in the scenario tree is also proposed. A methodology for measuring the value of the stochastic solution in this problem is discussed. Computational tests using randomly generated data are presented showing that the stochastic approach is worth considering in these types of problems.     

Applying demographic analysis to store site selection

This case study illustrates how applied demographic analysis can help structure business decisionmaking. We screened every one of several thousand square miles within metropolitan Southern California to identify the 10 best locations for a large supermarket catering to onestop shoppers. Locations were selected based on potential sales volume (irrespective of nearby competitors), future stability of the resident consumer base, and specific demographic factors likely to enhance sales potential among target shoppers (e.g., dual-earner families). The client placed as much importance on how the results were derived as on our recommendations. As a result, our analytic framework for comparing high-potential locations played a central role in structuring the client's thinking. This framework, together with the empirical analysis, illustrate how applied demographers can operationalize business questions about consumer markets and guide a client toward a more systematic way of reaching decisions.This article is based on a paper presented at the 1987 Population Association of America Meetings, Chicago, USA.     

基于价值链的农地整治项目选址阶段效率测度模型研究

针对当前农地整治项目选址具有一定的随意性和盲目性,效益发挥受到限制等情况,本文基于农地整治项目选址工作实施过程,根据利益相关者的价值需求分析,确定选址阶段各项工作的价值目标,构建了基于模糊模式识别方法下的效率评价模型,并以湖北省孝南区为例对其进行验证,以期指导农地整治项目选址工作.研究结果表明,该效率测度模型可有效探寻选址工作的不足,并有利于其改进及效率提升；同时,该模型效率测度指标体系较为全面、客观且非兼容性强,其应用较为广泛,具有较强的灵活性.     

Stable estimation of location parameter -nonasymptotic approach

Let X₁:, X₂:, …, X_n be iidrv's with cdf F?, F?(x)=F (x-θ), R. Let T be an equivariant median-unbiased estimator of θ. Let πε(F)={G = (1 -ε) F+εH, H any cdf} and let M(G, T) be a median of T if X₁ has cdf G. The oscillation of the bias of T, defined as

Bε(T)=sup (M(G₁ T) :G₁,G₂:∈π_σ:(F)} ,is considered and the estimator with the smallest B$epsi;(T) is explicitly constructed