电磁主动悬架的建模及仿真研究

根据电磁学原理,利用电磁铁作为主动悬架的作动器,构造出电磁作动器的一般结构.在1/4汽车悬架基础上,建立了电磁主动悬架的非线性模型,应用现代控制理论设计了该模型的次优控制器,对模型进行分析、仿真.结果表明,电磁悬架能够实现一般主动悬架的功能,满足车辆平顺性的要求,可以应用于汽车的悬架系统.     

Newsvendor problems with sequentially revealed demand information

This article analyzes a capacity/inventory planning problem with a one‐time uncertain demand. There is a long procurement leadtime, but as some partial demand information is revealed, the firm is allowed to cancel some of the original capacity reservation at a certain fee or sell off some inventory at a lower price. The problem can be viewed as a generalization of the classic newsvendor problem and can be found in many applications. One key observation of the analysis is that the dynamic programming formulation of the problem is closely related to a recursion that arises in the study of a far more complex system, a series inventory system with stochastic demand over an infinite horizon. Using this equivalence, we characterize the optimal policy and assess the value of the additional demand information. We also extend the analysis to a richer model of information. Here, demand is driven by an underlying Markov process, representing economic conditions, weather, market competition, and other environmental factors. Interestingly, under this more general model, the connection to the series inventory system is different. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 2012     

Models and algorithms for shuffling problems in steel plants

In this article, we study item shuffling (IS) problems arising in the logistics system of steel production. An IS problem here is to optimize shuffling operations needed in retrieving a sequence of steel items from a warehouse served by a crane. There are two types of such problems, plate shuffling problems (PSP) and coil shuffling problems (CSP), considering the item shapes. The PSP is modeled as a container storage location assignment problem. For CSP, a novel linear integer programming model is formulated considering the practical stacking and shuffling features. Several valid inequalities are constructed to accelerate the solving of the models. Some properties of optimal solutions of PSP and CSP are also derived. Because of the strong NP‐hardness of the problems, we consider some special cases of them and propose polynomial time algorithms to obtain optimal solutions for these cases. A greedy heuristic is proposed to solve the general problems and its worst‐case performances on both PSP and CSP are analyzed. A tabu search (TS) method with a tabu list of variable length is proposed to further improve the heuristic solutions. Without considering the crane traveling distance, we then construct a rolling variable horizon heuristic for the problems. Numerical experiments show that the proposed heuristic algorithms and the TS method are effective. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

An efficient metaheuristic for integrated scheduling and staffing IT projects based on a generalized minimum cost flow network

Scheduling IT projects and assigning the project work to human resources are an important and common tasks in almost any IT service company. It is particularly complex because human resources usually have multiple skills. Up to now only little work has considered IT‐specific properties of the project structure and human resources. In this article, we present an optimization model that simultaneously schedules the activities of multiple IT projects with serial network structures and assigns the project work to multiskilled internal and external human resources with different efficiencies. The goal is to minimize costs. We introduce a metaheuristic that decomposes the problem into a binary scheduling problem and a continuous staffing problem where the latter is solved efficiently by exploiting its underlying network structure. For comparison, we solve the mixed–binary linear program with a state–of–the–art commercial solver. The impacts of problem parameters on computation time and solution gaps between the metaheuristic and the solver are assessed in an experimental study. Our results show that the metaheuristic provides very favorable results in considerable less time than the solver for midsize problems. For larger problems, it shows a similar performance while the solver fails to return feasible solutions. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 111–127, 2012     

双站无源定位最佳配置分析

为了提高双站无源定位精度,在全局坐标系下分析了双站纯方位定位系统的最佳配置形式。首先研究了最小GDOP(Geometric Dilution of Precision)意义下的方位角约束关系及最优夹角,得到双站的最佳配置形式是目标与两传感器间呈一确定夹角的等腰三角形;在此基础上,讨论了夹角对GDOP的影响进而提出有效定位区域的概念,指出只有当目标位于该区域内时双站才能获得较好的定位精度。仿真结果验证了上述关于最佳配置形式及有效定位区域的分析,指出该结论可以应用到基于传感器管理的多站无源定位算法中。     

基于效费比的武器目标分配

有效武器目标分配(WTA)是防空阵地的核心。分析了目标毁伤收益、武器损伤关键战术指标因素,提出基于效费比的WTA评价标准,建立了针对多目标的WTA模型,并研究了用遗传算法求解模型的方法。该遗传算法通过设计一种武器目标分配的染色体编码,利用最优保存策略选择运算、均匀交叉运算、非均匀变异运算来求解。仿真结果验证了模型的合理性和算法的有效性。     

灵巧噪声干扰本质及相关基本问题探讨

为正确理解和实施灵巧噪声干扰,基于匹配滤波器理论对灵巧噪声干扰的本质含义进行了分析。指出,灵巧噪声干扰的本质含义是使干扰由多个分量组成,并且使干扰中的每一个分量的频谱都与雷达发射信号的频谱相同,从而使干扰中的每一个分量的功率利用效率都达到最大。最后,从理论和实践2个角度,阐述了与灵巧噪声干扰相关的基本问题,并进行了相应的分析。     

基于组合牛顿迭代法的改进IEKF及其在UNGM中的应用

从高斯-牛顿迭代的角度对迭代扩展卡尔曼滤波(IEKF)进行分析,提出了一种基于组合牛顿迭代法的改进IEKF算法。该算法通过实时判断每次迭代对状态的逼近程度,采用加权平均的方法确定新的迭代值,继而采用卡尔曼滤波框架对状态进行量测更新。新算法较传统的IEKF具有精度高以及对初值不敏感的优点。实例仿真验证了该算法的有效性。     

一类非线性脉冲时滞抛物型偏微分方程组解的振动性

讨论了一类含脉冲的时滞抛物型方程组非零解的振动性,利用了Green定理以及Jensen不等式,得出了该方程在Robin边界条件下非零解振动的若干准则。     

A critical look at the U.S. deceased‐donor organ procurement and utilization system

The U.S. system for procuring and utilizing deceased‐donor organs for transplantation has been studied and written about in many articles. The purpose of this paper is to examine the interactions between the elements that comprise this system, and point out improvement opportunities that may be affected through operations research/management techniques. The authors demonstrate the need for developing data‐driven and analytic tools. In fact, data is used to generate hypotheses and support claims throughout the paper. The paper also points out the need to fully leverage data that is available to researchers, and to seek data that is currently not deposited in a centralized archive.