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

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

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     

Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraints

In this article, we propose a branch‐and‐price‐and‐cut (BPC) algorithm to exactly solve the manpower routing problem with synchronization constraints (MRPSC). Compared with the classical vehicle routing problems (VRPs), the defining characteristic of the MRPSC is that multiple workers are required to work together and start at the same time to carry out a job, that is, the routes of the scheduling subjects are dependent. The incorporation of the synchronization constraints increases the difficulty of the MRPSC significantly and makes the existing VRP exact algorithm inapplicable. Although there are many types of valid inequalities for the VRP or its variants, so far we can only adapt the infeasible path elimination inequality and the weak clique inequality to handle the synchronization constraints in our BPC algorithm. The experimental results at the root node of the branch‐and‐bound tree show that the employed inequalities can effectively improve the lower bound of the problem. Compared with ILOG CPLEX, our BPC algorithm managed to find optimal solutions for more test instances within 1 hour. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 138–171, 2016     

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

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

基于多QoS约束的启发式路由选择算法设计与实现

针对时延、路由跳数以及网络资源利率3种约束,结合软件路由器项目,对路由选择算法的网络模型进行了描述和定义,并提出了基于多QoS约束的启发式路由选择算法（H_MCP）。通过在软件路由器上实现和测试,表明该算法具有可行性和启发性。     

地空导弹阵地优选的灰色关联模型研究

依据地空导弹阵地优选受多因素制约的特点,运用灰色关联分析建立地空导弹阵地优选的灰色关联模型。通过综合研究地空导弹阵地选择的战术、技术要求及影响因素,提出了阵地选择的指标体系,进而结合使用Delphi法,建立了地空导弹阵地优选的灰色关联模型。经过实例计算证明了该模型具有实用性和推广价值。     

机动作战路线选择辅助决策系统模型研究

为了更好地评价机动作战路线的优劣,运用模糊数学的方法,结合机动路线选择的特点,建立了机动路线选择的指标体系,采用层次分析法(AHP)对指标体系的各个因素的权重进行了确定,并在模型的基础上对机动路线选择辅助决策系统的软件设计进行了构思。利用辅助决策软件对机动作战路线选择,快捷方便,特别是能够在多条路线中选取最优,实现了由定性分析转入定量分析的轨道,有助于提高指挥决策的科学性和客观性。     

目标选择优化模型及算法

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

科技大楼工程中的绿色空调系统设计与选型

绿色建筑中如何实现环保标准,保证所用设备对环境无污染,噪声小,可持续 发展等特点是当前的重要课题。主要针对燃气空调系统的设计与应用进行了探析,阐述了 燃气空调的制冷原理以及单、双效吸收式制冷等技术发展路线;论述了燃气制冷技术与传统 电制冷技术比较的优势及环保特点;结合后勤工程学院科技大楼绿色空调系统设计与选型 的工程实例,从绿色环保、能源、可持续发展、费用估算等方面进行了分析,并对该燃气空调 的实际应用效果进行了总结。