Bayesian inference for a Lanchester type combat model

We undertake inference for a stochastic form of the Lanchester combat model. In particular, given battle data, we assess the type of battle that occurred and whether or not it makes any difference to the number of casualties if an army is attacking or defending. Our approach is Bayesian and we use modern computational techniques to fit the model. We illustrate our method using data from the Ardennes campaign. We compare our results with previous analyses of these data by Bracken and Fricker. Our conclusions are somewhat different to those of Bracken. Where he suggests that a linear law is appropriate, we show that the logarithmic or linear‐logarithmic laws fit better. We note however that the basic Lanchester modeling assumptions do not hold for the Ardennes data. Using Fricker's modified data, we show that although his “super‐logarithmic” law fits best, the linear, linear‐logarithmic, and logarithmic laws cannot be ruled out. We suggest that Bayesian methods can be used to make inference for battles in progress. We point out a number of advantages: Prior information from experts or previous battles can be incorporated; predictions of future casualties are easily made; more complex models can be analysed using stochastic simulation techniques. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 541–558, 2000     

Multivariate meta analysis with potentially correlated marketing study results

A univariate meta analysis is often used to summarize various study results on the same research hypothesis concerning an effect of interest. When several marketing studies produce sets of more than one effect, multivariate meta analysis can be conducted. Problems one might have with such a multivariate meta analysis are: (1) Several effects estimated in one model could be correlated to each other but their correlation is seldom published and (2) an estimated effect in one model could be correlated to the corresponding effect in the other model due to similar model specification or the data set partly shared, but their correlation is not known. Situations like (2) happen often in military recruiting studies. We employ a Monte‐Carlo simulation to evaluate how neglecting such potential correlation affects the result of a multivariate meta analysis in terms of Type I, Type II errors, and MSE. Simulation results indicate that such effect is not significant. What matters is rather the size of the variance component due to random error in multivariate effects. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 500–510, 2000.     

Adaptive importance sampling for extreme quantile estimation with stochastic black box computer models

Quantile is an important quantity in reliability analysis, as it is related to the resistance level for defining failure events. This study develops a computationally efficient sampling method for estimating extreme quantiles using stochastic black box computer models. Importance sampling has been widely employed as a powerful variance reduction technique to reduce estimation uncertainty and improve computational efficiency in many reliability studies. However, when applied to quantile estimation, importance sampling faces challenges, because a good choice of the importance sampling density relies on information about the unknown quantile. We propose an adaptive method that refines the importance sampling density parameter toward the unknown target quantile value along the iterations. The proposed adaptive scheme allows us to use the simulation outcomes obtained in previous iterations for steering the simulation process to focus on important input areas. We prove some convergence properties of the proposed method and show that our approach can achieve variance reduction over crude Monte Carlo sampling. We demonstrate its estimation efficiency through numerical examples and wind turbine case study.     

Programming challenges and impediments to reform: identifying pragmatic solutions

Using two recently published essays by the current writer that assesses the dismal record of performance of Planning, Programming, and Budgeting System in enabling communist legacy defence institutions in Central and Eastern Europe to develop viable defence plans, this essay argues the need for deep reforms in the region’s defence institutions. To guide this reform effort, pragmatic solutions are suggested to improve the ability of these organisations to produce viable defence plans. Recommended reforms are: (1) conduct conceptual and cultural “audits,” (2) make operational and financial data central to decision-making, (3) change current organisational sociology, (4) examine planning methods and practices, and (5) stress the need to adopt policy frameworks to drive the operation of defence institutions.     

Heuristic algorithms for routing yard‐side equipment for minimizing loading times in container terminals

This paper discusses a method of routing yard‐side equipment during loading operations in container terminals. Both the route of yard‐side equipment (such as transfer cranes or straddle carriers) and the number of containers picked up at each yard‐bay is determined simultaneously. The objective of the problem in this paper is to minimize the total container‐handling time in a yard. The size of the search space can be greatly reduced by utilizing inherent properties of the optimal solution. An encoding method is introduced to represent solutions in the search space. A genetic algorithm and a beam search algorithm are suggested to solve the above problem. Numerical experiments have been conducted to compare the performances of the proposed heuristic algorithms against each other and against that of the optimal solution. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 498–514, 2003