Statistical search methods for lotsizing problems
نویسندگان
چکیده
منابع مشابه
Statistical search methods for lotsizing problems
This paper reports on our experiments with statistical search methods for solving lotsizing problems in production planning. In lotsizing problems the main objective is to generate a minimum cost production and inventory schedule, such that (i) customer demand is satisfied, and (ii) capacity restrictions imposed on production resources are not violated. We discuss our experiences in solving the...
متن کاملEfficient Search Methods for Statistical Dependency Rules
Dependency analysis is one of the central problems in bioinformatics and all empirical science. In genetics, for example, an important problem is to find which gene alleles are mutually dependent or which alleles and diseases are dependent. In ecology, a similar problem is to find dependencies between different species or groups of species. In both cases a classical solution is to consider all ...
متن کاملNonlinear methods for inverse statistical problems
In the uncertainty treatment framework considered in this paper, the intrinsic variability of the inputs of a physical simulation model is modelled by a multivariate probability distribution. The objective is to identify this probability distribution the dispersion of which is independent of the sample size since intrinsic variability is at stake based on observation of some model outputs. More...
متن کاملIterative Inversion Methods for Statistical Inverse Problems
In this paper we discuss general regularization estimators. This class includes Tikhonov type and spectral cut-off estimators as well as iterative methods, such as ν-methods and the Landweber iteration. The latter estimators achieve the same (optimal) convergence rates as spectral cut-off, but do not require explicit spectral information on the operator and are often much faster to compute than...
متن کاملHybrid Probabilistic Search Methods for Simulation Optimization
Discrete-event simulation based optimization is the process of finding the optimum design of a stochastic system when the performance measure(s) could only be estimated via simulation. Randomness in simulation outputs often challenges the correct selection of the optimum. We propose an algorithm that merges Ranking and Selection procedures with a large class of random search methods for continu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 1993
ISSN: 0254-5330,1572-9338
DOI: 10.1007/bf02023005