增材制造技术在军事物流中的应用研究

增材制造技术是一种新型的制造技术,现已被应用到了航空航天、汽车工业和军事等诸多行业领域.作为军事领域的重要组成部分,军事物流与增材制造技术通过军用物资这一共同的作用对象为纽带存在着天然的联系.遗憾的是,目前增材制造技术在军事领域的应用范围还比较局限,有关军事物流的应用更是少见.为有效推动增材制造技术在军事物流中的应用实...     

Joint determination of preventive maintenance and safety stocks in an unreliable production environment

In this article we formulate an analytical model of preventive maintenance and safety stock strategies in a production environment subject to random machine breakdowns. Traditionally, preventive maintenance and safety stocks have been independently studied as two separate strategies for coping with machine breakdowns. Our intent is to develop a unified framework so that the two are jointly considered. We illustrate the trade-off between investing in the two options. In addition, we provide optimality conditions under which either one or both strategies should be implemented to minimize the associated cost function. Specifically, cases with deterministic and exponential repair time distributions are analyzed in detail. We include numerical examples to illustrate the determination of optimal strategies for preventive maintenance and safety stocks. © 1997 John Wiley & Sons, Inc.     

Multiple-facility loading under capacity-based economies of scope

Multiple-facility loading (MFL) involves the allocation of products among a set of finite-capacity facilities. Applications of MFL arise naturally in a variety of production scheduling environments. MFL models typically assume that capacity is consumed as a linear function of products assigned to a facility. Product similarities and differences, however, result in capacity-based economies or diseconomies of scope, and thus the effective capacity of the facility is often a (nonlinear) function of the set of tasks assigned to the facility. This article addresses the multiple-facility loading problem under capacity-based economies (and diseconomies) of scope (MFLS). We formulate MFLS as a nonlinear 0–1 mixed-integer programming problem, and we discuss some useful properties. MFLS generalizes many well-known combinatorial optimization problems, such as the capacitated facility location problem and the generalized assignment problem. We also define a tabu-search heuristic and a branch-and-bound algorithm for MFLS. The tabu-search heuristic alternates between two search phases, a regional search and a diversification search, and offers a novel approach to solution diversification. We also report computational experience with the procedures. In addition to demonstrating MFLS problem tractability, the computational results indicate that the heuristic is an effective tool for obtaining high-quality solutions to MFLS. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 229–256, 1997     

The continuous‐time single‐sourcing problem with capacity expansion opportunities

This paper develops a new model for allocating demand from retailers (or customers) to a set of production/storage facilities. A producer manufactures a product in multiple production facilities, and faces demand from a set of retailers. The objective is to decide which of the production facilities should satisfy each retailer's demand, in order minimize total production, inventory holding, and assignment costs (where the latter may include, for instance, variable production costs and transportation costs). Demand occurs continuously in time at a deterministic rate at each retailer, while each production facility faces fixed‐charge production costs and linear holding costs. We first consider an uncapacitated model, which we generalize to allow for production or storage capacities. We then explore situations with capacity expansion opportunities. Our solution approach employs a column generation procedure, as well as greedy and local improvement heuristic approaches. A broad class of randomly generated test problems demonstrates that these heuristics find high quality solutions for this large‐scale cross‐facility planning problem using a modest amount of computation time. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

规则空间下基于MRFC-Vicsek模型的集群控制

针对规则空间下集群运动问题,开展了基于多区域模糊控制(MRFC)-Vicsek模型的集群控制方法的研究.考虑到仿生集群在运动时的行为准则,首先建立了包括避碰层、一致层、内聚层、连通层在内的多区域Vicsek模型.其次,通过模糊规则将不同区域个体数量和集群拥挤程度转化为对中心个体的影响权重,再结合规则空间内边界对个体的影...     

MIMO-OFDM通信系统抗干扰性能分析

在对MIMO-OFDM(Multiple Input Multiple Output-Orthogonal Frequency Division Multiplexing)模型分析的基础上,对MIMO-OFDM系统中常见的干扰信号进行了深入研究。通过仿真分析比较了采用不同空时编码的基础上MIMO-OFDM系统对不同干扰信号的抗干扰性能。仿真结果表明:处于小区边缘的用户受到干扰信号的影响比较严重,并且与实际的MIMO-OFDM应用系统的联系比较紧密;相对于采用BLAST编码方式的MIMO-OFDM系统采用STC编码方式的MIMO-OFDM系统具有更好的抗干扰性能。     

汽车加油机器人关键技术分析

传统加油模式使操作人员易受有毒易燃油气的侵害,而且严冬酷暑时加油站作业环境恶劣,因此在加油站配置机器人实现智能化加油变得十分迫切。介绍了国内外汽车加油机器人的研究进展,指出其作业对象的差异性、环境的多变性以及作业过程的危险性。分析了当前汽车加油机器人所采用的加油机构、加注接口以及识别与定位技术的特点,指出加油机构优化、安全控制、智能识别与定位研究是汽车加油机器人发展的方向。     

基于改进ACO算法的多UAV协同航路规划

针对无人机(Unmanned Aerial Vehicle,UAV)在执行任务过程中遇到的诸如敌方防空火力、地形障碍及恶略天气等各类威胁源,采用威胁源概率分布的方法进行威胁的量化处理,构建任务空间的威胁概率密度分布图,有效消除了威胁源的差异性。根据UAV在任务飞行过程中的性能约束与时、空协同约束,同时考虑任务过程中UAV的损毁概率最小、任务航程最短,构建了相应的综合任务航路代价最优化目标函数。结合传统蚁群优化算法(Ant Colony Optimization,ACO)在解决此类问题中的不足,给出了相应的改进策略,提出采用协同多种群ACO进化策略来实现多UAV在满足时、空协同约束下的协同航路规划。通过相应的仿真计算表明,改进后的ACO协同多种群进化策略算法更适用于多UAV协同任务航路规划问题,具有一定的实用性。从而为多UAV协同任务航路规划问题的求解提供了科学的决策依据。     

预警机生存力评估模型

预警机作为C4ISR的空中情报探测中心及指挥控制中心,在信息化作战中具有十分重要的战略和战术价值。针对预警机执行作战任务的特点,通过对战场环境中影响预警机生存力的因素进行分析,结合预警机的作战模式和流程,定义出预警机的生存概率函数。基于该概率函数,建立了一种预警机战场生存力评估模型,并利用蒙特卡洛方法对4种典型的预警机作战场景进行了仿真评估,验证了模型的有效性。最后,结合该模型提出提高预警机在战场中生存的手段。     

伪卫星辅助北斗定位精度改进方法

由于北斗二号一期系统卫星集中分布在赤道附近,导致国土范围内接收机南北方向定位精度偏低,且由于可视卫星均为正仰角,导致接收机垂直方向定位精度也偏低的问题,提出了利用地面伪卫星改善用户观测几何结构的方法来提高一定区域范围内北斗接收机的定位精度。推导了伪卫星与真实卫星组合的最小二乘定位算法模型,并给出了用于定位精度评估的南北和垂直方向的精度衰减因子值。仿真结果表明:在用户使用范围的北部地区布设伪卫星可有效降低用户南北方向以及垂直方向的精度衰减因子值,从而有效改善定位精度。