The knapsack problem with a minimum filling constraint

We study a knapsack problem with an additional minimum filling constraint, such that the total weight of selected items cannot be less than a given threshold. The problem has several applications in shipping, e‐commerce, and transportation service procurement. When the threshold equals the knapsack capacity, even finding a feasible solution to the problem is NP‐hard. Therefore, we consider the case when the ratio α of threshold to capacity is less than 1. For this case, we develop an approximation scheme that returns a feasible solution with a total profit not less than (1 ‐ ε) times the total profit of an optimal solution for any ε > 0, and with a running time polynomial in the number of items, 1/ε, and 1/(1‐α). © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

A1 Qaeda and the radical Islamic challenge to western strategy

The September 11 global crisis prompted by the attacks on the World Trade Center and the Pentagon raises major questions concerning the nature and trajectory of terrorism in the post-Cold War global order. Hitherto, terrorism has been largely debated by analysts at the level of nation states. Terrorist and insurgent movements have also been largely anchored in nationalist and ethnic power bases even when they have sought to mobilise a transnational ideological appeal on religious or class grounds. There have been a few exceptions to this pattern such as the alliance between the German Baader-Meinhof group and the Japanese Red Army Faction, but even such international alliances as this did not, until at least the 1980s, presage anything like a global terrorist network necessitating a global strategic response. This study examines terrorism and global strategic responses.     

Bounded flexibility in days‐on and days‐off scheduling

This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013     

任务驱动下航材需求量的GA-GM-BP预测

机务保障影响着航空装备战斗力的生成,机务保障资源是任务成功率的物质支撑.基于航材需求信息的灰色性,通过采用DEMATEL方法提取影响航空备件需求量的关键影响因素,采用遗传算法优化的灰色神经网络对需求量进行了仿真预测,其预测精度较BP神经网络和灰色神经网络都高.该方法对于其他航空机务保障资源的需求预测有借鉴意义.     

基于遗传算法的多功能电子系统任务调度

雷达、通信、电子战等多功能一体化是未来作战平台电子系统的发展方向之一,任务优化调度技术是多功能电子系统的关键技术。针对多功能电子系统射频任务调度问题,在建立任务调度数学模型的基础上,采用了改进的遗传算法对模型进行了求解,提出了任务列表和随机键结合的编码方式,设计了以执行时间最短和任务丢失率最小为目标的多目标适应度函数,采用轮盘赌选择、改进型双点交叉和对称交换变异方式设计遗传操作。通过仿真实验,验证了所设计任务调度方法的有效性和优越性。     

资源约束条件下的空中兵力编组

通过对空中兵力的合理编组,实现作战资源的优化配置是提升兵力作战效能的有效途径。针对现代空战编队对抗过程的特点,从战术企图和信息优势角度提出了编队目标威胁评估方法。以编队目标为研究对象从宏观上调配己方作战资源,提出了作战资源成本和兵力调度成本2种兵力编组成本,在此基础上建立了资源约束条件下的兵力编组优化模型,并采用改进PSO算法对模型进行求解。作战想定仿真结果表明兵力编组模型能够有效解决空战兵力分配问题。     

系统可靠度的模糊分配

本文把模糊规划理论应用于系统可靠度的最优分配问题,给出两类常见的可靠度分配模型,并以实例说明解决此类问题的思想方法。     

多机协同目标与火力资源分配

在协同空战中,快速正确的空战决策是己方战机少受敌方伤害并取得战争胜利的前提。目标与火力资源分配是决策过程的重要部分。多机空战与单机空战相比有明显的不同,不同之处是面临多个敌方目标,根据我方资源最优分配作战对象和火力,基于遗传算法实现了两种算法的有人无人目标与火力资源分配。仿真结果表明,带有毁伤概率门限的算法既节省火力资源又快速有效。     

无约束自由体有限元分析中的准静态法

在对某水下无约束航行体进行有限元静力分析的时候,由于无法限定结构的自由度而使刚度矩阵奇异,从而导致求解失败。为了解决这一问题,采用强迫约束法和准静态法(惯性释放)对此航行体进行了有限元静力对比计算,结果表明:用强迫约束法对水下航行体进行静力分析时,在施加强迫约束的部位出现了严重的应力集中现象,应力最大值为1.25×106Pa,应力集中使得整个结构的应力分布与实验数据相差较大,可认为计算结果错误;采用惯性释放法对其进行静力分析时,应力最大值为3.27×105Pa,整个结构的应力分布合理,与实验数据一致,计算结果正确。     

论申博立项建设中的信息资源保障

信息资源保障是申博立项和重点学科建设的重要支撑力量。制约当前图书馆信息资源保障能力的主要因素有四个：信息资源短缺、资源共享困难、应用水平低下、重点不够突出。提升信息资源保障能力,可以采取整合各类信息资源、建立联合保障体系、创新信息服务模式、挖掘重点学科资源等对策。