Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于任务和角色的工作流系统权限控制

工作流系统权限管理的权限控制是工作流的重要因素.对传统的访问控制权限进行改进,在基于角色和任务的工作流权限管理系统中将任务与组织、时间进行关联,并使用Petri网来对工作流进行建模,在工作流推进的不同时段,采用不同的存取权限表来实现权限控制,为工作流的权限管理提出一种新的思路.     

二维弹道修正弹修正方法

为提高弹箭密集度,采用阻力修正原理进行纵向距离修正;增设阻尼片,调节炮弹的极阻尼力矩来改变炮弹旋转速度,进而调节偏流大小来实现侧向弹道修正,是一种低成本的二维弹道修正技术。基于牛顿流理论、经验公式和风洞实验数据提出了组合式二维修正机构弹道修正弹的扩增阻力系数和扩增极阻尼力矩系数计算方法,对不同阻力环、阻尼片结构的气动力进行了数值计算分析。分析了组合式二维弹道修正弹的侧向弹道修正原理,建立了其飞行弹道数学模型,对阻力环、阻尼片机构在飞行弹道上不同位置处作用对应的射程修正量、侧向弹道修正能力和动态飞行稳定性进行了数值计算。结果表明:该二维弹道修正技术可以满足对弹道纵向和侧向偏差修正的需求,且不影响炮弹的飞行稳定性。     

空地制导武器发展的核心理念

文章研究为了在未来空地作战中占据优势,空地制导武器正朝着远程化、精准化、小型化、高能化和网络化的方向发展。远程化可以确保战机实施有效的"防区外攻击";精准化可以确保"首发命中",提高战机生存能力;小型化可以提高战机的载弹量,同时减少爆炸后的附带损伤,降低负面效应;高能化可以确保"小炸弹具有大威力";网络化则使弹药在发射后其制导信息仍然能够随着目标的变化而及时得到更新,确保命中目标。     

无标度网络理论在网络中心战中的应用

根据无标度网络理论对军事信息网络进行分析,认为军事信息网的逻辑层应为符合幂指数分布的无标度网络,传统的以泊松分布为理论基础的随机网络分析方法已不再适用,并通过构建随机网络和无标度网络的实例进行了对比分析,进一步论证了这个结论.根据无标度网络理论,对军事信息网的抗毁性特点进行了分析,得出了"对随机攻击鲁棒性强,对智能攻击脆弱性高"的结论,并提出了以网络连通性为标准,判定节点重要性的一般方法.参照国外的先进网络应用经验,针对军事信息网节点间非常不均衡的无标度特性,给出了"关键节点热备份"和"物理节点分散配置"的抗毁策略.     

国防科技工业质量与可靠性信息共享机制研究与思考

信息共享机制的缺失已经成为质量与可靠性信息工作的瓶颈,严重制约了信息的分析与利用深度。根据质量与可靠性信息工作的新需求,应用现代质量管理理论及系统工程方法,阐述了国防科技工业质量与可靠性信息共享的内涵、目的、总体框架、实施框架与建设措施,为开展质量与可靠性信息共享研究与实践提供方法指导。     

防空导弹武器系统射击次数的建模方法*

为评估防空导弹武器系统射击效能,在一定假设条件下,通过对防空导弹武器系统射击过程的分析,对单目标通道建立了射击次数模型.该模型考虑了目标的航路捷径和飞行高度.单目标通道射击次数模型经适当变换可求出第一个目标通道的射击次数,并根据一个射击循环中可用目标通道数受遭遇时间的限制,分三种情况对多目标通道防空导弹武器系统建立了射击次数模型.最后举例进行了仿真计算,得到了不同T值下的射击次数和遭遇点.计算结果符合实际,表明该模型具有较好的适用性.     

一种BP神经网络算法的改进模型

首先对BP网络的结构和算法进行了分析,针对BP网络收敛速度慢,容易陷入局部极小等问题,提出了一种改进的BP网络模型,并对该模型算法进行了改进,通过激活函数的选择,网络的初始化,学习率的调整和训练样本数据的处理等方法,可实现加快网络的收敛速度,并且较好的解决局部最优问题.     

某型光电头盔瞄准具原理误差的校正

就某型光电头盔瞄准具扫描部件光学系统具体结构 ,分析研究了其头位测量中十棱镜反射面非共面定轴转动所致原理误差 ,导出了基线校正、测角校正两种校正公式。前者与原技术资料所给出的结果完全吻合 ,后者已成功应用在改型的光电头盔瞄准具中。     

Optimal outbound dispatch policies: Modeling inventory and cargo capacity

In this paper, we present an optimization model for coordinating inventory and transportation decisions at an outbound distribution warehouse that serves a group of customers located in a given market area. For the practical problems which motivated this paper, the warehouse is operated by a third party logistics provider. However, the models developed here may be applicable in a more general context where outbound distribution is managed by another supply chain member, e.g., a manufacturer. We consider the case where the aggregate demand of the market area is constant and known per period (e.g., per day). Under an immediate delivery policy, an outbound shipment is released each time a demand is realized (e.g., on a daily basis). On the other hand, if these shipments are consolidated over time, then larger (hence more economical) outbound freight quantities can be dispatched. In this case, the physical inventory requirements at the third party warehouse (TPW) are determined by the consolidated freight quantities. Thus, stock replenishment and outbound shipment release policies should be coordinated. By optimizing inventory and freight consolidation decisions simultaneously, we compute the parameters of an integrated inventory/outbound transportation policy. These parameters determine: (i) how often to dispatch a truck so that transportation scale economies are realized and timely delivery requirements are met, and (ii) how often, and in what quantities, the stock should be replenished at the TPW. We prove that the optimal shipment release timing policy is nonstationary, and we present algorithms for computing the policy parameters for both the uncapacitated and finite cargo capacity problems. The model presented in this study is considerably different from the existing inventory/transportation models in the literature. The classical inventory literature assumes that demands should be satisfied as they arrive so that outbound shipment costs are sunk costs, or else these costs are covered by the customer. Hence, the classical literature does not model outbound transportation costs. However, if a freight consolidation policy is in place then the outbound transportation costs can no longer be ignored in optimization. Relying on this observation, this paper models outbound transportation costs, freight consolidation decisions, and cargo capacity constraints explicitly. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 531–556, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10030