Partitioning of biweighted trees

A districting problem is formulated as a network partitioning model where each link has one weight to denote travel time and another weight to denote workload. The objective of the problem is to minimize the maximum diameter of the districts while equalizing the workload among the districts. The case of tree networks is addressed and efficient algorithms are developed when the network is to be partitioned into two or three districts. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 143–158, 2002; DOI 10.1002/nav.10003     

Duality in constrained multi‐facility location models

We consider the ??_p‐norm multi‐facility minisum location problem with linear and distance constraints, and develop the Lagrangian dual formulation for this problem. The model that we consider represents the most general location model in which the dual formulation is not found in the literature. We find that, because of its linear objective function and less number of variables, the Lagrangian dual is more useful. Additionally, the dual formulation eliminates the differentiability problem in the primal formulation. We also provide the Lagrangian dual formulation of the multi‐facility minisum location problem with the ??_pb‐norm. Finally, we provide a numerical example for solving the Lagrangian dual formulation and obtaining the optimum facility locations from the solution of the dual formulation. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 410–421, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10010     

A stochastic gradual cover location problem

Covering models assume that a point is covered if it is within a certain distance from a facility and not covered beyond that distance. In gradual cover models it is assumed that a point is fully covered within a given distance from a facility, then cover gradually declines, and the point is not covered beyond a larger distance. Gradual cover models address the discontinuity in cover which may not be the correct approach in many situations. In the stochastic gradual cover model presented in this article it is assumed that the short and long distances employed in gradual cover models are random variables. This refinement of gradual cover models provides yet a more realistic depiction of actual behavior in many situations. The maximal cover model based on the new concept is analyzed and the single facility location cover problem in the plane is solved. Computational results illustrating the effectiveness of the solution procedures are presented. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Equivalent accelerated life testing plans for log‐location‐scale distributions

Accelerated life testing (ALT) is widely used to determine the failure time distribution of a product and the associated life‐stress relationship in order to predict the product's reliability under normal operating conditions. Many types of stress loadings such as constant‐stress, step‐stress and cyclic‐stress can be utilized when conducting ALT. Extensive research has been conducted on the analysis of ALT data obtained under a specified stress loading. However, the equivalency of ALT experiments involving different stress loadings has not been investigated. In this article, a log‐location‐scale distribution under Type I censoring is considered in planning ALT. An idea is provided for the equivalency of various ALT plans involving different stress loadings. Based on this idea, general equivalent ALT plans and some special types of equivalent ALT plans are explored. For demonstration, a constant‐stress ALT and a ramp‐stress ALT for miniature lamps are presented and their equivalency is investigated. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于改进单亲遗传算法的军事物流中心选址问题研究

为了有效求解军事物流中心选址问题,在单亲遗传算法加入模拟退火选择操作,与倒位算子和非均匀变异操作相结合,构建了退火单亲遗传算法。在选择操作中,采用三复本锦标选择的方式,确保了种群的多样性。计算结果表明该方法可有效求解选址问题,取得较一般遗传算法更优的结果,算法的搜索效率和收敛概率均得到大幅度提高。     

基于遗传算法的应急物流多设施选址模型研究

在现有研究的基础上,建立了应急物流多设施选址模型。在模型建立过程中除了考虑距离这一基本要素,还考虑了流量与安全性等道路特性,并将其转换为道路的综合权值,使模型更具现实意义。采用遗传算法求解,使该问题的求解过程得到简化。最后用实例对模型进行了验证分析,说明该模型的合理性。     

The assignment of storage locations to containers for a container stack

Assigning storage locations to incoming or reshuffled containers is a fundamental problem essential to the operations efficiency of container terminals. The problem is notoriously hard for its combinatorial and dynamic nature. In this article, we minimize the number of reshuffles in assigning storage locations for incoming and reshuffled export containers. For the static problem to empty a given stack without any new container arrival, the optimum reshuffle sequence is identified by an integer program (IP). The integer program captures the evolution of stack configurations as a function of decisions and is of interest by itself. Heuristics based on the integer program are then derived. Their competitiveness in accuracy and time are established by extensive numerical runs comparing them with existing heuristics in literature and in practice as well as with extensions of the existing heuristics. Variants of the IP‐based heuristics are then applied to the dynamic problem with continual retrievals and arrivals of containers. Again, numerical runs confirm that the IP‐based heuristic is competitive. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

基于星载干涉仪测向的辐射源定位综合算法

针对卫星多次观测定位点的估计问题,提出一种不依赖于先验知识的定位点综合算法.该算法首先分析了星载干涉仪测向体制的定位精度,并基于此提出利用定位误差协方差矩阵对定位点进行加权综合的方法.仿真实验表明本文方法可以提高定位精度.     

超视距机群空战效能评估模型研究(英文)

针对超视距机群空战仿真的应用场合,建立了一种超视距机群空战的效能评估模型.该模型首先通过分析超视距空战的特点,在导弹攻击典型时间序列的基础上,对抢先发射导弹这一随机事件分三种情况进行了具体研究,得出计算飞机损失数的解析表达式.然后讨论了超视距空战中抢先情况的条件,提出了抢先概率的计算方法.最后着重对抢先发射、抢先发射区域的影响因素以及飞机机动性对空战结果的影响进行了分析.     

人员交通类场所人员荷载研究

对人员交通类场所的特点进行了分析,将人员交通类场所归纳为简单通道、复杂通道、候机（车）厅、进出港厅等组件。针对简单通道和进出港厅,采用“人员流量法”和“人员密度法”两种方法计算人员荷载;针对复杂通道,采用空间上分解为流线、时间上分解为阶段的方法计算人员荷载;针对候机（车）厅,按照设计容量确定人员荷载。并给出了一个包括国家铁路、地铁的综合交通枢纽换乘层人员荷载计算的典型案例。