Search results for "optimization"
showing 10 items of 2824 documents
Bayesian hierarchical models in manufacturing bulk service queues
2006
In this paper, Queueing Theory and Bayesian statistical tools are used to analyze the congestion of various manufacturing bulk service queues with the same characteristics that are working independently of one another and in equilibrium. Hierarchical models are discussed in order to develop the whole inferential process for the parameters governing the system. Markov Chain Monte Carlo methods and numerical inversion of transforms are addressed to compute the posterior predictive distributions of the usual measures of performance in practice.
Bayesian design in queues: An application to aeronautic maintenance
2007
We exploit Bayesian criteria for designing M/M/c//r queueing systems with spares. For illustration of our approach we use a real problem from aeronautic maintenance, where the numbers of repair crews and spare planes must be sufficiently large to meet the necessary operational capacity. Bayesian guarantees for this to happen can be given using predictive or posterior distributions.
An Adaptive Parallel Tempering Algorithm
2013
Parallel tempering is a generic Markov chainMonteCarlo samplingmethod which allows good mixing with multimodal target distributions, where conventionalMetropolis- Hastings algorithms often fail. The mixing properties of the sampler depend strongly on the choice of tuning parameters, such as the temperature schedule and the proposal distribution used for local exploration. We propose an adaptive algorithm with fixed number of temperatures which tunes both the temperature schedule and the parameters of the random-walk Metropolis kernel automatically. We prove the convergence of the adaptation and a strong law of large numbers for the algorithm under general conditions. We also prove as a side…
On surrogating 0–1 knapsack constraints
1999
In this note, we present a scheme for tightening 0–1 knapsack constraints based on other knapsack constraints surrogating.
Investigation of Simulated Trading — A multi agent based trading system for optimization purposes
2010
Abstract Some years ago, Bachem, Hochstattler, and Malich proposed a heuristic algorithm called Simulated Trading for the optimization of vehicle routing problems. Computational agents place buy-orders and sell-orders for customers to be handled at a virtual financial market, the prices of the orders depending on the costs of inserting the customer in the tour or for his removal. According to a proposed rule set, the financial market creates a buy-and-sell graph for the various orders in the order book, intending to optimize the overall system. Here I present a thorough investigation for the application of this algorithm to the traveling salesman problem.
A tabu search algorithm for assigning teachers to courses
2002
In this paper we deal with the problem of assigning teachers to courses in a secondary school. The problem appears when a timetable is to be built and the teaching assignments are not fixed. We have developed a tabu search algorithm to solve the problem. The parameters involved in the algorithm have been estimated by using multiple regression techniques. The computational results, obtained on a set of Spanish secondary schools, show that the solutions obtained by this automatic procedure can be favourably compared with the solutions proposed by the experts.
A decision support system methodology for forecasting of time series based on soft computing
2006
Exponential procedures are widely used as forecasting techniques for inventory control and business planning. A number of modifications to the generalized exponential smoothing (Holt-Winters) approach to forecasting univariate time series is presented, which have been adapted into a tool for decision support systems. This methodology unifies the phases of estimation and model selection into just one optimization framework which permits the identification of robust solutions. This procedure may provide forecasts from different versions of exponential smoothing by fitting the updated formulas of Holt-Winters and selects the best method using a fuzzy multicriteria approach. The elements of the…
Adaptive Modifications of Hypotheses After an Interim Analysis
2001
It is investigated how one can modify hypotheses in a trial after an interim analysis such that the type I error rate is controlled. If only a global statement is desired, a solution was given by Bauer (1989). For a general multiple testing problem, Kieser, Bauer and Lehmacher (1999) and Bauer and Kieser (1999) gave solutions, by means of which the initial set of hypotheses can be reduced after the interim analysis. The same techniques can be applied to obtain more flexible strategies, as changing weights of hypotheses, changing an a priori order, or even including new hypotheses. It is emphasized that the application of these methods requires very careful planning of a trial as well as a c…
Misinterpretation risks of global stochastic optimisation of kinetic models revealed by multiple optimisation runs
2016
Abstract One of use cases for metabolic network optimisation of biotechnologically applied microorganisms is the in silico design of new strains with an improved distribution of metabolic fluxes. Global stochastic optimisation methods (genetic algorithms, evolutionary programing, particle swarm and others) can optimise complicated nonlinear kinetic models and are friendly for unexperienced user: they can return optimisation results with default method settings (population size, number of generations and others) and without adaptation of the model. Drawbacks of these methods (stochastic behaviour, undefined duration of optimisation, possible stagnation and no guaranty of reaching optima) cau…
Achieving Unbounded Resolution inFinitePlayer Goore Games Using Stochastic Automata, and Its Applications
2012
Abstract This article concerns the sequential solution to a distributed stochastic optimization problem using learning automata and the Goore game (also referred to as the Gur game in the related literature). The amazing thing about our solution is that, unlike traditional methods, which need N automata (where N determines the degree of accuracy), in this article, we show that we can obtain arbitrary accuracy by recursively using only three automata. To be more specific, the Goore game (GG) introduced in Tsetlin (1973) has the fascinating property that it can be resolved in a completely distributed manner with no inter-communication between the players. The game has recently found applicati…