面内阶跃载荷下薄板弹性动力屈曲差分解

根据薄板微元的动力平衡分析导出薄板动力屈曲控制方程,由屈曲瞬间能量转换率守恒条件得出一个压缩波前屈曲变形的附加约束方程,由此得到求解薄板动力屈曲问题的完备定解条件.以受载边夹支的薄板为倒,利用有限差分法得出了薄板前三阶动力屈曲模态和相应的两个特征参数值,并对比分析了薄板静、动力屈曲的差别.分析表明,薄板动力屈曲过程中产生屈曲动能,比静力屈曲要吸收更多的外部能量.     

Optimal capacity in a coordinated supply chain

We consider a supply chain in which a retailer faces a stochastic demand, incurs backorder and inventory holding costs and uses a periodic review system to place orders from a manufacturer. The manufacturer must fill the entire order. The manufacturer incurs costs of overtime and undertime if the order deviates from the planned production capacity. We determine the optimal capacity for the manufacturer in case there is no coordination with the retailer as well as in case there is full coordination with the retailer. When there is no coordination the optimal capacity for the manufacturer is found by solving a newsvendor problem. When there is coordination, we present a dynamic programming formulation and establish that the optimal ordering policy for the retailer is characterized by two parameters. The optimal coordinated capacity for the manufacturer can then be obtained by solving a nonlinear programming problem. We present an efficient exact algorithm and a heuristic algorithm for computing the manufacturer's capacity. We discuss the impact of coordination on the supply chain cost as well as on the manufacturer's capacity. We also identify the situations in which coordination is most beneficial. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

火箭弹防静电短路卡抗静电性能实验研究

通过实验研究了火箭弹系统在安装防静电短路卡前后静态电阻的变化 ,提出了利用脉冲电流发生器测定安装防静电短路卡后系统动态电阻的方法。研究表明 ,安装防静电短路卡后 ,系统动态电阻很小 (小于30mΩ) ,火箭弹抗静电性能明显提高     

行星变速箱换档过程动态仿真研究

从传动系行星排传递单元和构件出发,建立了N自由度行星变速箱运动学数学模型,并运用该模型对三自由度行星变速箱进行了换档过程的动态仿真。     

Strategic capacity decision‐making in a stochastic manufacturing environment using real‐time approximate dynamic programming

In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

侵彻子母弹封锁机场跑道最小升降窗口搜索算法研究

针对侵彻子母弹封锁机场跑道中判断是否存在最小升降窗口的"两点比较"算法,提出更为符合实际毁伤情况的"网格-矩阵"算法。采用随机分布的数学模型和计算机仿真模型,利用Monte Carlo法模拟侵彻子母弹子弹的落点。最后在Matlab7.0环境下对两种算法进行了仿真试验和对比分析,提出两种算法在火力辅助决策中的使用建议。     

基于在线动平衡的磁轴承参数辨识

针对磁悬浮刚性转子系统,提出了一种基于在线动平衡的磁轴承参数辨识方法。采用已知大小和相位的不平衡质量作为激振源,根据动平衡仪测得的转子不平衡响应,求得磁轴承位移刚度和电流刚度。利用某型磁悬浮控制力矩陀螺对该方法进行了试验验证,得到了一定转速范围内的磁轴承位移刚度和电流刚度,证明了该方法的正确性和实用性。试验结果表明外转子型磁轴承位移刚度和电流刚度随转速的增加而下降明显。     

封装对螺旋线圈发射器互感梯度的影响

互感梯度是决定线圈炮加速力的主要因素。本文以螺旋线圈炮为例,建立了计算互感梯度的二维有限元模型,对四种不同属性的封装材料和封装尺寸对互感梯度的影响做出了分析和比较,并给出了不同的封装材料及尺寸下封装的电流密度和磁场分布图。分析表明,互感梯度受到封装材料电导率和磁导率的双重制约。电导率决定了封装中感应涡流的大小;磁导率决定了对磁场的加强程度。减小封装与线圈的间距,导磁材料的磁场加强效果更好,而导电材料的涡流效应也更明显;增加封装的厚度,导磁材料可以更好地增强磁场,但导电材料由于电阻更小涡流效应更明显。为了实现互感梯度的最大化,可以在减小封装与驱动线圈间距并增加封装厚度的情况下使用高磁导率的硅钢片制作封装,硅钢片的厚度应该尽量小从而削弱涡流效应。     

A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

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