科学制定发展规划 彰显地方高校职能

地方高校制定发展规划是适应国内外高等教育发展的客观需求，是区域经济社会发展的必要需求，是高校自身发展的迫切需求。地方高校要履行高校职能，更好地为地方经济社会发展服务就必须科学制定规划，特别是要战略规划学校的办学定位、特色和目标。同时，规划的实施要强调监控并要与高校职能协调统一。     

Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems

Design and management of complex systems with both integer and continuous decision variables can be guided using mixed‐integer optimization models and analysis. We propose a new mixed‐integer black‐box optimization (MIBO) method, subspace dynamic‐simplex linear interpolation search (SD‐SLIS), for decision making problems in which system performance can only be evaluated with a computer black‐box model. Through a sequence of gradient‐type local searches in subspaces of solution space, SD‐SLIS is particularly efficient for such MIBO problems with scaling issues. We discuss the convergence conditions and properties of SD‐SLIS algorithms for a class of MIBO problems. Under mild conditions, SD‐SLIS is proved to converge to a stationary solution asymptotically. We apply SD‐SLIS to six example problems including two MIBO problems associated with petroleum field development projects. The algorithm performance of SD‐SLIS is compared with that of a state‐of‐the‐art direct‐search method, NOMAD, and that of a full space simplex interpolation search, Full‐SLIS. The numerical results suggest that SD‐SLIS solves the example problems efficiently and outperforms the compared methods for most of the example cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 305–322, 2017     

(修，2撤3)关键几何参数对超声速膨胀器流场和性能影响的数值研究

为了揭示关键几何参数对超声速膨胀器流动特性影响的规律,对3种隔板安装角和5种出进口面积比超声速膨胀器设计工况下的流场进行了数值研究。结果表明：随隔板安装角增加,斜激波向出口迁移,斜激波强度略有降低,超声速膨胀器膨胀比减小,效率提高;随出进口面积比增加,流道内高速区显著扩大并逐渐靠近压力面,斜激波增强,出口流动损失增加,超声速膨胀器膨胀比增大,效率降低。为获得综合性能较优超声速膨胀器结构,需在较小出进口面积比和较大隔板安装角之间做折衷选择。     

基于效用函数的随伴支援炮兵弹药选择模型

随着火炮武器系统的发展,火炮所配属的弹药类型越来越多,针对不同目标选择合适的弹药以达到最佳作战效能具有重要意义。首先,按照"最大化对敌火力效果、最小化附带损伤,最小化费用"的原则,分析了随伴支援炮兵弹药选择模型要考虑的决策指标,包括毁伤比、压制比、非敌伤亡率、安全距离、费用。建立了决策指标的效用函数,在此基础上建立了整体的决策指标,对决策指标的权重系数进行了分析探讨。最后用实例证明该方法是一种有效综合各类因素的弹药选择方法,能够很好地解决弹药选择问题。     

应用新型Lanchester方程的非对称空战进程预测

针对未来空战中可能出现的非对称空战问题进行研究,在设定的非对称空战背景下构建新型Lanchester方程对问题进行建模分析,得到单一机种和多兵种非对称空战模型,并通过仿真试验验证了模型的有效性,对非对称空战指挥决策提供了一定的帮助。     

INS辅助的PMF-FFT快速捕获算法

为了快速地捕获卫星信号,研究了部分匹配滤波(Partial Matched Filter,PMF)算法及其参数选择依据。采用惯性导航系统(INS)辅助的PMF-FFT捕获算法,该算法首先利用惯性导航系统信息缩小信号捕获的2维搜索范围;同时,为改善PMF-FFT捕获算法的性能,在PMF过程中采用窗函数加权积分。结果表明,该捕获算法能够大幅减小平均捕获时间;且加窗后的PMF-FFT算法捕获性能更优。     

SVM在空中目标威胁值评估中的应用

构建了基于回归型支持向量机的空中目标威胁值评估模型,确定了基于粗糙集理论的空中目标威胁因素,并建立了数据离散化、归一化的标准。将常用的4种核函数应用于对空中目标威胁值的估计,并通过基于网格法和遗传算法的搜索方法找到模型的最优参数。最后通过Matlab对算例进行了仿真验证。     

求解CVRP问题的一种改进启发式蚁群算法

针对蚁群算法求解CVRP问题时收敛速度慢、求解质量不高的缺点,提出了一种改进启发式蚁群算法。该算法借鉴蚁群系统和基于排列的蚂蚁系统的优点设计信息素更新策略,既加强了对每次迭代最好解的利用,又避免了陷入局部最优;按一定比例使用基本方法和基于PFIH方法构造路径,扩大了算法的搜索空间;采用一种混合局部搜索算子,增强了算法局部寻优能力。实验结果表明,改进启发式蚁群算法可以大幅度减少车辆运行成本,具有较快的收敛速度。     

后勤物资消耗测算系统设计需求分析

针对当前后勤物资消耗测算方法过于简单粗略的问题,以构建有效的后勤物资消耗测算系统为目的,对系统的设计进行了需求分析。介绍了后勤物资消耗测算的基本流程以及关键理论,研究了后勤物资消耗测算系统的用户特点以及应用流程,着重对系统的功能需求进行了分析,确定了系统各主要功能的相关内容,并按照功能需求确定了系统的组成结构和接口关系,为系统的设计和实现奠定了基础。     

A learning tabu search for a truck allocation problem with linear and nonlinear cost components

The two‐level problem studied in this article consists of optimizing the refueling costs of a fleet of locomotives over a railway network. The goal consists of determining: (1) the number of refueling trucks contracted for each yard (truck assignment problem denoted TAP) and (2) the refueling plan of each locomotive (fuel distribution problem denoted FDP). As the FDP can be solved efficiently with existing methods, the focus is put on the TAP only. In a first version of the problem (denoted (P1)), various linear costs (e.g., fuel, fixed cost associated with each refueling, weekly operating costs of trucks) have to be minimized while satisfying a set of constraints (e.g., limited capacities of the locomotives and the trucks). In contrast with the existing literature on this problem, two types of nonlinear cost components will also be considered, based on the following ideas: (1) if several trucks from the same fuel supplier are contracted for the same yard, the supplier is likely to propose discounted prices for that yard (Problem (P2)); (2) if a train stops too often on its route, a penalty is incurred, which represents the dissatisfaction of the clients (Problem (P3)). Even if exact methods based on a mixed integer linear program formulation are available for (P1), they are not appropriate anymore to tackle (P2) and (P3). Various methods are proposed for the TAP: a descent local search, a tabu search, and a learning tabu search (LTS). The latter is a new type of local search algorithm. It involves a learning process relying on a trail system, and it can be applied to any combinatorial optimization problem. Results are reported and discussed for a large set of instances (for (P1), (P2), and (P3)), and show the good performance of LTS. © 2014 Wiley Periodicals, Inc. 62:32–45, 2015