A decomposable transshipment algorithm for a multiperiod transportation problem

A dynamic version of the transportation (Hitchcock) problem occurs when there are demands at each of n sinks for T periods which can be fulfilled by shipments from m sources. A requirement in period t₂ can be satisfied by a shipment in the same period (a linear shipping cost is incurred) or by a shipment in period t₁ < t₂ (in addition to the linear shipping cost a linear inventory cost is incurred for every period in which the commodity is stored). A well known method for solving this problem is to transform it into an equivalent single period transportation problem with mT sources and nT sinks. Our approach treats the model as a transshipment problem consisting of T, m source — n sink transportation problems linked together by inventory variables. Storage requirements are proportional to T² for the single period equivalent transportation algorithm, proportional to T, for our algorithm without decomposition, and independent of T for our algorithm with decomposition. This storage saving feature enables much larger problems to be solved than were previously possible. Futhermore, we can easily incorporate upper bounds on inventories. This is not possible in the single period transportation equivalent.     

Heuristics for the multi‐resource generalized assignment problem

The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001     

Resource allocation with lumpy demand: To speed or not to speed?

In the classical EPQ model with continuous and constant demand, holding and setup costs are minimized when the production rate is no larger than the demand rate. However, the situation may change when demand is lumpy. We consider a firm that produces multiple products, each having a unique lumpy demand pattern. The decision involves determining both the lot size for each product and the allocation of resources for production rate improvements among the products. We find that each product's optimal production policy will take on only one of two forms: either continuous production or lot‐for‐lot production. The problem is then formulated as a nonlinear nonsmooth knapsack problem among products determined to be candidates for resource allocation. A heuristic procedure is developed to determine allocation amounts. The procedure decomposes the problem into a mixed integer program and a nonlinear convex resource allocation problem. Numerical tests suggest that the heuristic performs very well on average compared to the optimal solution. Both the model and the heuristic procedure can be extended to allow the company to simultaneously alter both the production rates and the incoming demand lot sizes through quantity discounts. Extensions can also be made to address the case where a single investment increases the production rate of multiple products. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

C~4ISR系统军事需求模型并行开发与一致性检验

介绍了C4ISR系统军事需求模型的概念、特点及其开发的并行性,并根据我军联合作战指挥信息系统的需求开发实践需要,针对C4ISR系统军事需求模型的模块划分以及分组建模过程进行分析,在此基础上给出了一个C4ISR系统军事需求模型并行开发过程的参考模型,并探讨了并行开发过程在系统需求周期内的一致性检验问题,包括了需求模型的语法、语义和语用一致性检验的过程和方法.     

舰船装备健康状态评估方法

结合可靠性和维修性的概念,对舰船健康状态评估的相关概念进行了分析,并对健康状态和健康度的概念进行了探讨和改进.提出了单个舰载装备和由多个装备组成的装备系统的健康状态评估方法,引入了"任务健康度"的概念.最后,根据舰船执行不同任务的实际需求,将全舰健康状态的概念引入到舰船的使用和维修保障中,提出了舰船各系统的健康状态标准...     

基于光流传感器的四旋翼飞行器悬停校正

由于低成本的惯性测量单元存在较大漂移,四旋翼飞行器难以稳定地悬停在固定区域,基于此,提出了一种基于光流传感器的四旋翼飞行器悬停校正方法。将光流传感器安装在四旋翼飞行器底部,利用光流信息检测四旋翼飞行器相对地面的水平移动速度,对姿态估计进行补偿,实现悬停校正。试验结果表明:该方法能够有效地提高四旋翼飞行器的悬停稳定性,从而保证飞行器能够执行战场侦察、校正射击、干扰敌人等多种军事任务。     

Do Distinct (National) Operational Styles of Conflict Resolution Exist?

This article contains a reply to a previously published paper on the use and abuse of the so-called Dutch approach to counterinsurgency. In addition to commenting on this paper, the article constitutes an argument to initiate more comparative studies in the field of military and strategic studies. Only comparative studies will help to better understand the effectiveness of military force in preventing, containing and solving violent conflicts.     

Book Reviews

The purpose of this article is to analyse British strategic nuclear targeting between 1974 and 1979, prior to the successful completion of the sophisticated modification to Polaris submarine-missile system codenamed Chevaline. It will use as its starting point the parameters for UK strategic nuclear targeting, and the foundation of the ‘Moscow Criterion’, prior to the deployment of Britain's Polaris submarines which began in 1968. It will then discuss the recommendation by the Chiefs of Staff to retarget Polaris in 1975/76 and the implications of that recommendation in terms of the British approach to strategic nuclear deterrence. The article will conclude with an assessment of these retargeting decisions on the decision to replace Polaris with the US Trident system in 1980.