Finding the Kth shortest path in a time‐schedule network

We consider the problem of finding the Kth shortest path for a time‐schedule network, where each node in the network has a list of prespecified departure times, and departure from the node can take place only at one of these departure times. We develop a polynomial time algorithm independent of K for finding the Kth shortest path. The proposed algorithm constructs a map structure at each node in the network, using which we can directly find the Kth shortest path without having to enumerate the first K − 1 paths. Since the same map structure is used for different K values, it is not necessary to reconstruct the table for additional paths. Consequently, the algorithm is suitable for directly finding multiple shortest paths in the same network. Furthermore, the algorithm is modified slightly for enumerating the first K shortest paths and is shown to have the lowest possible time complexity under a condition that holds for most practical networks. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost

We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

状态机嵌入DEVS的组合建模方法研究

DEVS提供了模块化、层次化的系统建模和仿真执行框架,但是缺乏对于系统行为的抽象建模能力。状态图扩展了原有的FSM,通过可视化的、灵活的状态迁移图描述系统的复杂行为。提出将状态图嵌入DEVS的组合建模方法,互为补充,以建立复杂的离散控制系统。DEVS作为系统的建模框架并提供执行逻辑支持,状态图扩展DEVS的事件交互机制和时间推进机制,描述系统的行为逻辑。详细介绍了状态图和DEVS的语法语义,重点阐述状态图嵌入DEVS的实现机制。结合一个应用实例,说明嵌入状态图的DEVS用于建立离散控制系统模型的优势。     

基于状态反馈的导弹滚转通道变结构控制

针对导弹滚转通道参数时变性和快速性要求,提出了一种易于实现状态反馈变结构控制器的设计。将系统分为确定部分和不确定部分,然后分别对这两部分进行变结构控制。结果表明,适当的校正规则不仅保证滑模的存在,而且具有对参数扰动和外部扰动的不变性;状态信号的反馈提高了滚转通道的响应能力;伪滑模大大削减了变结构控制的抖动。并通过仿真证明了该方法的正确性和有效性。     

陆军防空导弹装备信息化改造方法

针对我国陆军现有防空导弹装备,提出了一种增加其作战效能的信息化改造方法。阐述了改造思想、改造方案,并简单讨论了改造后的陆军防空导弹构建作战体系的方式。     

陆军诸兵种合同作战兰切斯特方程的弹药消耗预测研究

描述了诸兵种合同作战的兰切斯特方程及其矩阵解,提出了一种通过兵力损耗换算弹药损耗的新思路,分析和确定了用该方法预测弹药消耗的相关参数,最后运用Matlab进行仿真计算,预测出了武器装备战损情况和弹药消耗情况。     

基于LabVIEW的舰炮振动检测系统

舰炮的射击振动严重影响其射击精度、工作寿命和工作可靠性,本文利用LabVIEW开发了振动检测仪,用来检测舰炮身管的振动,具有一定的应用价值.     

改进的GPS弱信号差分捕获方法研究

捕获是GPS接收机信号处理中的关键部分,在微弱信号情况下,传统的弱信号捕获方法不能很好地捕获到卫星信号,采用一种改进的GPS弱信号差分捕获方法来进行捕获研究.并对一组GPS的数据信息,分别采用以上2种方法对其进行捕获仿真.结果显示,新方法可以捕获到较微弱的GPS信号,提高了接收机的灵敏度.     

面向大尺寸滑动窗口应用的并行计算模型

大尺寸滑动窗口的应用在数据输入速度与处理速度之间存在较大差距.为了缩短差距,提出了一种并行计算模型,使用尽可能少的存储资源与尽可能简单的存储器读写控制逻辑实现了尽可能高的数据重用性与并行性.该模型将不同滑动窗口之间的并行处理与单个窗口内不同数据之间的并行处理结合起来:对于不同窗口,按列进行分组并映射到多个处理单元上并行...     

回转体气层减阻降噪模型试验研究

在拖曳水池及大型循环水槽中,分别开展了中尺度及大尺度回转体模型喷气减阻试验研究,初步探讨了喷气方式、气流量、喷孔尺度变化对减阻率、推进性能及辐射噪声的影响规律.结果表明:回转体首部喷气能有效抑制辐射噪声、降低总阻力,但会引起推进性能的下降,推进性能下降率接近于减阻率.首部单独喷气的减阻效果优于首部、中部联合喷气的减阻效...