Analysis of a new vehicle scheduling and location problem

We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP‐hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst‐case and computational points of view. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001     

基于3Dmax和OGRE的某型装备视景仿真研究*

某型装备视景仿真的研制对于提高教学质量和训练水平具有重要意义.提出了一种基于3Dmax和OGRE可视类的视景仿真方法,给出了视景仿真系统的总体结构和实现过程,解决了视景仿真过程中一些视点变换、角度控制、场景变化、面板仿真等关键的技术问题.     

改进粒子群算法在导弹火力分配中的应用

粒子群优化算法是一种新兴的优化技术,思想来源于人工生命和演化计算理论.由于该算法简单易实现,可调参数少,目前已得到广泛研究和应用.在建立导弹武器火力分配数学模型的基础上,运用改进粒子群算法对模型进行了最优化求解,实例的计算结果表明该优化算法对于模型的求解具有较好的收敛性.     

导弹落点散布的序贯概率比(SPR)检验的随机模拟

本文简述了对导弹落点散布的SPR检验的随机模拟的步骤和计算公式。对于落点的标准偏差进行了序贯截尾和不截尾的随机模拟,并对所得结朱进行了初步的分析。分析表明:通过随机模拟得到的OC 函数L~*(σ)优于由近似公式计算的L(σ),而E_σ~*(n)比E_σ(n)要大,所以在选择参数α、β和λ时利用L~*(σ)和E_σ~*(n),同时参考L(σ)和E_σ(n)比较好。本文对截尾方案进行了讨论,对某些问题提出了一些看法。     

The class of mifra lifetimes and its relation to other classes

In a previous paper, the authors have introduced a class of multivariate lifetimes (MIFRA) which generalize the univariate lifetimes with increasing failure rate average (IFRA). They have also shown that this class satisfies many fundamental properties. In this paper it is shown that other concepts of multivariate IFRA do not satisfy all of these properties. Relationships between MIFRA and these other concepts are given. Finally, positive dependence implications with respect to these classes are also discussed.     

Postoptimality analysis in nonlinear integer programming: The right-hand side case

An algorithm is presented to gain postoptimality data about the family of nonlinear pure integer programming problems in which the objective function and constraints remain the same except for changes in the right-hand side of the constraints. It is possible to solve such families of problems simultaneously to give a global optimum for each problem in the family, with additional problems solved in under 2 CPU seconds. This represents a small fraction of the time necessary to solve each problem individually.     

The economic effects of inspector error on attribute sampling plans

In this paper the effects of inspector error on a cost-based quality control system are investigated. The system examined is of a single sampling plan design involving several cost components. Both type I and type II inspector errors are considered. The model employs a process distribution, thus assuming that a stochastic process of some kind governs the quality of incoming lots. Optimal plan design is investigated under both error-free and error-prone inspection procedures and some comparisons are made.     

Sequential determination of inspection epochs for reliability systems with general lifetime distributions

The problem of determining the optimal inspection epoch is studied for reliability systems in which N components operate in parallel. Lifetime distribution is arbitrary, but known. The optimization is carried with respect to two cost factors: the cost of inspecting a component and the cost of failure. The inspection epochs are determined so that the expected cost of the whole system per time unit per cycle will be minimized. The optimization process depends in the general case on the whole failure history of the system. This dependence is characterized. The cases of Weibull lifetime distributions are elaborated and illustrated numerically. The characteristics of the optimal inspection intervals are studied theoretically.     

A convex property of an ordered flow shop sequencing problem

A flow shop sequencing problem with ordered processing time matrices is considered. A convex property for the makespan sequences of such problems is discussed. On the basis of this property an efficient optimizing algorithm is presented. Although the proof of optimality has not been developed, several hundred problems were solved optimally with this procedure.