基于改进蜂群算法的非均匀阵列综合

针对蜂群算法易陷入局部极值的缺陷,提出一种改进蜂群算法实现非均匀阵列综合。首先,通过引入概率选择机制,以概率因子控制蜂群算法对精英蜂的选择,从而改善蜂群算法的全局优化性能;然后,采用改进蜂群算法优化阵元间距降低最大峰值旁瓣电平并抑制干扰;最后,仿真实验表明该改进算法在非均匀阵列综合中的有效性和稳健性。研究成果可为非均匀阵列综合提供一种新的途径。     

On the polyhedral structure of two‐level lot‐sizing problems with supplier selection

In this article, we study a two‐level lot‐sizing problem with supplier selection (LSS), which is an NP‐hard problem arising in different production planning and supply chain management applications. After presenting various formulations for LSS, and computationally comparing their strengths, we explore the polyhedral structure of one of these formulations. For this formulation, we derive several families of strong valid inequalities, and provide conditions under which they are facet‐defining. We show numerically that incorporating these valid inequalities within a branch‐and‐cut framework leads to significant improvements in computation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 647–666, 2017     

适用于捷联惯性/星光组合导航的导航星表构建方法

构建满足完备性、精简性和查询快速性的导航星表是实现捷联惯性/星光组合导航系统的重要前提和保证。为了达到这一目标,本文选取天文学中的Tycho-2星表作为导航星表的初始星表,它与TRC星表相比具有明显的优势,在实践运用过程中更加完备。在Tycho-2星表基础上,对球矩形分区方法进行了改进,包括明确了分区及子分区的划分方法,提出了备选导航星的选择策略。实验结果表明,采用改进型球矩形分区方法的备选导航星数量最多只占赤纬带法导航星的19.39%,仅占全天遍历法导航星的3.12%。因此,改进型球矩形分区方法更加精准,查询更快捷,更适用于SINS/CNS组合导航系统。     

基于CFP模型的装备系统能力开发方法

基于系统能力的装备系统开发能够使装备发展更好地适应未来战争。首先建立系统能力-功能-性能(简称CFP)概念模型,进一步定性分析系统能力与性能参数之间的映射关系。然后提出了在n维参数空间进行影射关系函数轨迹拟合的方法,定量地描述系统能力与性能参数之间的映射关系,建立CFP模型。最后以简例演示基于CFP模型进行定量系统能力开发的方法。     

A selective newsvendor approach to order management

Consider a supplier offering a product to several potential demand sources, each with a unique revenue, size, and probability that it will materialize. Given a long procurement lead time, the supplier must choose the orders to pursue and the total quantity to procure prior to the selling season. We model this as a selective newsvendor problem of maximizing profits where the total (random) demand is given by the set of pursued orders. Given that the dimensionality of a mixed‐integer linear programming formulation of the problem increases exponentially with the number of potential orders, we develop both a tailored exact algorithm based on the L‐shaped method for two‐stage stochastic programming as well as a heuristic method. We also extend our solution approach to account for piecewise‐linear cost and revenue functions as well as a multiperiod setting. Extensive experimentation indicates that our exact approach rapidly finds optimal solutions with three times as many orders as a state‐of‐the‐art commercial solver. In addition, our heuristic approach provides average gaps of less than 1% for the largest problems that can be solved exactly. Observing that the gaps decrease as problem size grows, we expect the heuristic approach to work well for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

目标选择的一个优化模型

坦克作战过程中 ,经常出现一个坦克群遭遇对方一个坦克群的情况 ,这时每辆坦克往往向威胁自身最大的目标开火 ,但这种选择的整体效果不一定最优。本文提出一种目标选择方法 ,使得最大限度地减轻了对方对己方的威胁 ,大大提高了作战坦克对敌杀伤效果     

Estimating the probability that a simulated system will be the best

Consider a stochastic simulation experiment consisting of v independent vector replications consisting of an observation from each of k independent systems. Typical system comparisons are based on mean (long‐run) performance. However, the probability that a system will actually be the best is sometimes more relevant, and can provide a very different perspective than the systems' means. Empirically, we select one system as the best performer (i.e., it wins) on each replication. Each system has an unknown constant probability of winning on any replication and the numbers of wins for the individual systems follow a multinomial distribution. Procedures exist for selecting the system with the largest probability of being the best. This paper addresses the companion problem of estimating the probability that each system will be the best. The maximum likelihood estimators (MLEs) of the multinomial cell probabilities for a set of v vector replications across k systems are well known. We use these same v vector replications to form v^k unique vectors (termed pseudo‐replications) that contain one observation from each system and develop estimators based on AVC (All Vector Comparisons). In other words, we compare every observation from each system with every combination of observations from the remaining systems and note the best performer in each pseudo‐replication. AVC provides lower variance estimators of the probability that each system will be the best than the MLEs. We also derive confidence intervals for the AVC point estimators, present a portion of an extensive empirical evaluation and provide a realistic example. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 341–358, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10019     

基于改进AHP与集对分析法的防空兵群阵地选择

防空兵群阵地选择是防空兵力部署的前提条件,阵地选择与配置的正确与否是防空兵部队能否有效进行抗击敌空袭兵器的一个重要因素.在分析以往防空阵地优选方法不足的基础上,提出了基于改进的层次分析与集对分析的多因素优选方法,建立了防空兵群配置地域方案优选的模型.通过实例分析了影响防空兵群阵地选择的相关因素,确定了配置地域优选的指标体系,用三标度法确定指标因素的权重,以相对贴近度的大小对待选阵地进行优选和排序.该方法能够定性与定量相结合,模型简单规范,为防空兵群阵地优选提供了一种有效的方法和途径.     

微乳液法在纳米催化剂制备中的应用及研究进展

综述了微乳液法制备纳米催化剂的基本原理和主要方法以及近年来在催化剂制备中的一些应用.对微乳液法制备纳米催化剂的一些影响因素:如水的含量及表面活性剂的结构和种类对微乳液"水池"尺寸的影响以及对最终形成的纳米粒子粒径的影响,反应物浓度对形成的纳米催化剂粒子的粒度大小和分布的影响,负载粒子对催化剂粒子烧结温度及稳定性等多方面的影响进行了探讨与分析,并对该领域的研究发展作了展望.     

目标选择优化模型及算法

提出了可用于大威力武器火力分配的目标选择优化模型及算法。内容包括：问题的数学描述、问题的等价变换与分解、问题求解的动态规划算法和不同算法的计算次数比较。