Optimal sensor placement for underwater threat detection

The optimization framework for optimal sensor placement for underwater threat detection has been developed. It considers single‐period and multiperiod detection models, each of which includes two components: detection algorithm and optimization problem for sensor placement. The detection algorithms for single‐period and multiperiod models are based on likelihood ratio and sequential testing, respectively. For the both models, the optimization problems use the principle of superadditive coverage, which is closely related to energy‐based and information‐based approaches. An algorithm for quasi‐regular sensor placement approximating solutions to the optimization problems has been developed based on corresponding continuous relaxations and a criterion for its applicability has been obtained. Numerical experiments have demonstrated that the algorithm consistently outperforms existing optimization techniques for optimal sensor placement.© 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

频率匹配准则的某型机枪自动机结构参数优化

首先分析了影响某型重机枪射击精度的影响因素,并以武器频率匹配准则为依据,以建立的机枪动力学虚拟样机模型为平台,通过灵敏度分析,找出导气孔横截面积、活塞的有效横截面积、枪机框质量、枪机质量和枪机框缓冲簧刚度等参数是影响武器射击频率的主要因素;利用序列二次规划优化方法对自动机结构参数进行优化,优化仿真结果表明,武器的射向一致性得到明显提高,这对于武器结构方案优化设计,提高武器射击精度是至关重要的。     

装甲装备使用可用度与维修保障费用的优化模型

维修保障费用是影响装甲装备使用可用度的重要因素之一。要在有限的保障经费下实现高可用度要求,就必须建立装甲装备的使用可用度与维修保障费用的优化模型。根据装甲装备实际维修特点,在分析装甲装备预防性维修过程中故障类型多样的基础上,构建了装甲装备在给定维修周期内的使用可用度模型和维修保障费用模型,进而建立了使用可用度与维修保障费用的优化模型,提出了模型的解法和模型的改进建议。     

Quantifying optimal mesh and ring design costs

During the last decade telecommunication operators have been deploying WDM (Wavelength Division Multiplexing) technology to satisfy the exponential growth in global communication. While facilitating the advanced information society of today, this has also led to a higher dependency on the networks, and furthermore the high capacity utilization of optical fibers means that a single link failure will influence many users and enterprises. For these reasons, protection of network connections has become a major competitive parameter for the operators. Currently, the most popular protection method is ring protection, due to its simplicity, requiring only basic management functionality and operating with local restoration control. While many optical rings have been deployed, little work has been published on exactly what the cost of ring networks are, compared to general mesh networks. In this article we perform a quantitative comparison between ring protection and mesh protection, using real world network data and realistic prices for network components. Extending classic LP flow models to take rings and node costs into account, and using a link‐path based mesh network LP model, we are able to perform a total cost comparison of the two architectures, and of manual ring network design. The results suggest that the price of mesh network components must be reduced significantly to be competitive with ring based networks, and also that manual network design does not necessarily lead to the most cost‐efficient designs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

攻击机靶场效能优化:概念、方法与基本问题

系统阐述了攻击机靶场攻击、靶场效能以及靶场效能优化等基本概念,在此基础上,分析了攻击机靶场效能优化的基本任务和基本问题,并给出了形式化描述。     

A stochastic gradual cover location problem

Covering models assume that a point is covered if it is within a certain distance from a facility and not covered beyond that distance. In gradual cover models it is assumed that a point is fully covered within a given distance from a facility, then cover gradually declines, and the point is not covered beyond a larger distance. Gradual cover models address the discontinuity in cover which may not be the correct approach in many situations. In the stochastic gradual cover model presented in this article it is assumed that the short and long distances employed in gradual cover models are random variables. This refinement of gradual cover models provides yet a more realistic depiction of actual behavior in many situations. The maximal cover model based on the new concept is analyzed and the single facility location cover problem in the plane is solved. Computational results illustrating the effectiveness of the solution procedures are presented. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

炮兵作战决策方案优选的方法

炮兵作战方案的选择,是炮兵作战指挥决策的关键环节,其合理与否,直接关系到炮兵作战效能的发挥和作战的成败.根据炮兵作战的实际,阐述了炮兵作战方案优选的依据,给出了运用层次分析法确定影响作战方案选择的各因素权重的方法步骤,在对优选依据的建模要素进行分析的基础上,构建了每个要素的效用函数计算模型,并给出了评估方案的计算方法,提供了模型应用的一般步骤.     

串联系统预防维修周期优化策略研究(英文)

针对串联系统建立了基于可靠性约束的预防性维修优化模型,该模型充分考虑到预防维修可以提高系统可靠性的同时,其故障率会随着维修次数的增加而上升,引入役龄回退因子对预防维修活动前后系统性能的动态变化进行了描述.通过实例验证了该优化模型的正确性与可用性,对模型作进一步的扩展,还可用于更一般复杂的串并联系统.     

Balancing a one‐way corridor capacity and safety‐oriented reliability: A stochastic optimization approach for metro train timetabling

In urban rail transit systems of large cities, the headway and following distance of successive trains have been compressed as much as possible to enhance the corridor capacity to satisfy extremely high passenger demand during peak hours. To prevent train collisions and ensure the safety of trains, a safe following distance of trains must be maintained. However, this requirement is subject to a series of complex factors, such as the uncertain train braking performance, train communication delay, and driver reaction time. In this paper, we propose a unified mathematical framework to analyze the safety‐oriented reliability of metro train timetables with different corridor capacities, that is, the train traffic density, and determine the most reliable train timetable for metro lines in an uncertain environment. By employing a space‐time network representation in the formulations, the reliability‐based train timetabling problem is formulated as a nonlinear stochastic programming model, in which we use 0‐1 variables to denote the time‐dependent velocity and position of all involved trains. Several reformulation techniques are developed to obtain an equivalent mixed integer programming model with quadratic constraints (MIQCP) that can be solved to optimality by some commercial solvers. To improve the computational efficiency of the MIQCP model, we develop a dual decomposition solution framework that decomposes the primal problem into several sets of subproblems by dualizing the coupling constraints across different samples. An exact dynamic programming combined with search space reduction strategies is also developed to solve the exact optimal solutions of these subproblems. Two sets of numerical experiments, which involve a relatively small‐scale case and a real‐world instance based on the operation data of the Beijing subway Changping Line are implemented to verify the effectiveness of the proposed approaches.