Optimizing disaster relief: Real-time operational and tactical decision support

We introduce a real-time decision support system which uses optimization methods, simulation, and the judgement of the decision maker for operational assignment of units to tasks and for tactical allocation of units to task requirements. The system, named ARES for the Greek god of war, accommodates a high degree of detail in the logistics of unit movements during operations, yet separates the assignment and allocation activities in a fashion which naturally accommodates human intervention and judgement—ARES is designed to assist the decision maker, not to replace him. ARES is demonstrated with a hypothetical scenario constructed for 14 Engineering Battalions of the Hellenic Army which are assigned 20 tasks employing 25 resource types in repairing major damage to public works following a great earthquake. (This hypothetical data was prepared prior to the earthquake in Kalamata near Athens on 13 September, 1986, and exhibits uncanny, but coincidental, resemblance to that real situation.) ARES is designed for use in real time, and quick data preparation is aided by the provision from published sources of standard data for many foreseeable tasks; this data can be quickly accessed via visual icons on a computer screen and customized for the actual work at hand. © 1993 John Wiley & Sons, Inc.     

风扇蜗壳排气段结构优化研究

为有效降低车辆封闭式冷却风道中风扇蜗壳的空气流动阻力,提出了计算流体力学分析与遗传算法相结合的蜗壳排气段结构优化方法,建立了蜗壳结构优化模型,开发了优化算法可执行程序Control CFD.EXE。对某车辆的风扇蜗壳排气段进行了结构优化。优化后蜗壳排气段的空气流动阻力比优化前减小了10.1%,空气质量流量增大了1.70%。     

舰空导弹测试项目优化方法研究

舰空导弹测试项目设计优化的目标应是全面但最简。提出如下优化方法:用Luenberger状态观测器法提取能覆盖各方面性能的测试项目最简集合,根据可靠性预计、故障分析得到的可靠性薄弱环节筛选,最后根据各类测试的不同需求和约束条件确定测试项目集合。其思路和方法也可用于其他复杂系统。     

An analytical evaluation of optimal solution value estimation procedures

The estimation of optimal solution values for large-scale optimization problems is studied. Optimal solution value estimators provide information about the deviation between the optimal solution and the heuristic solution. Some estimation techniques combine heuristic solutions with randomly generated solutions. In particular, we examine a class of jacknife-based estimators which incorporate any heuristic solution value with the two best randomly generated solution values. The primary contribution of this article is that we provide a framework to analytically evaluate a class of optimal solution value estimators. We present closed-form results on the relationship of heuristic performance, sample size, and the estimation errors for the case where the feasible solutions are uniformly distributed. In addition, we show how to compute the estimation errors for distributions other than uniform given a specific sample size. We use a triangular and an exponential distribution as examples of other distributions. A second major contribution of this article is that, to a large extent, our analytical results confirm previous computational results. In particular, the best estimator depends on how good the heuristic is, but seems to be independent of the underlying distribution of solution values. Furthermore, there is essentially an inverse relationship between the heuristic performance and the performance of any estimator. © 1994 John Wiley & Sons, Inc.     

Estimating normal tail probabilities

The estimation problem of normal tail probabilities is considered. The form of generalized Bayes estimators is derived and the asymptotic behavior of the mean square errors is studied. This study shows that the best unbiased estimator, a formula for which is given, is superior to the maximum likelihoood estimator or to a class of generalized Bayes procedures for large parametric values, but can be significantly improved for moderate values of the parameter.     

加肋轴对称薄壳强度分析的有限元方法

加肋轴对称薄壳的强度问题,需要考虑肋骨的作用。针对该问题,采用轴对称曲边壳单元建立了肋骨单元的刚度矩阵,将该矩阵叠加到轴对称曲边壳单元的刚度矩阵中,对加肋轴对称薄壳的强度进行有限元分析。应用Fortran语言编写了有限元计算程序,对一个精车模型进行了强度计算,计算结果同模型试验结果吻合良好,表明该方法可以应用于加肋轴对称薄壳的强度分析。     

Algorithms for minimizing total cost,bottleneck time and bottleneck shipment in transportation problems

We consider the transportation problem of determining nonnegative shipments from a set of m warehouses with given availabilities to a set of n markets with given requirements. Three objectives are defined for each solution: (i) total cost, TC, (ii) bottleneck time, BT (i.e., maximum transportation time for a positive shipment), and (iii) bottleneck shipment, SB (i.e., total shipment over routes with bottleneck time). An algorithm is given for determining all efficient (pareto-optimal or nondominated) (TC, BT) solution pairs. The special case of this algorithm when all the unit cost coefficients are zero is shown to be the same as the algorithms for minimizing BT. provided by Szwarc and Hammer. This algorithm for minimizing BT is shown to be computationally superior. Transportation or assignment problems with m=n=100 average about a second on the UNIVAC 1108 computer (FORTRAN V)) to the threshold algorithm for minimizing BT. The algorithm is then extended to provide not only all the efficient (TC, BT) solution pairs but also, for each such BT, all the efficient (TC, SB) solution pairs. The algorithms are based on the cost operator theory of parametric programming for the transportation problem developed by the authors.     

Inventory models with a mixture of backorders and lost sales

This article presents several single-echelon, single-item, static demand inventory models for situations in which, during the stockout period, a fraction b of the demand is backordered and the remaining fraction 1 - b is lost forever. Both deterministic and stochastic demand are considered. although the case of stochastic demand is treated heuristically. In each situation, a mathematical model representing the average annual cost of operating the inventory system is developed. and an optimum operating policy derived. At the extremes b=1 and b=0 the models presented reduce to the usual backorders and lost sales cases, respectively.