用于时空综合被动定位的种子分裂算法

针对传统TMA方法的局限性,运用时空综合被动定位(STI)理论,探索如何利用拖线阵列声纳的基阵探测信息估算目标运动要素。采用种子分裂算法(SDA)原理,通过选取合适的初始种子,进行高效率的穷举,从而得出最优解。经过仿真计算及分析发现,与遗传算法相比较,计算量大大缩小;本艇不机动时,即使在低信噪比的情况下,该算法既满足了可靠性的要求,又缩短搜索迭代过程。     

雷达辐射源识别的算法研究

针对现有雷达辐射源识别算法的不足,探索雷达辐射源数据库识别的新算法。运用属性测度理论建立了雷达辐射源属性识别模型,结合距离算法、灰关联算法和神经网络样本训练思想,设计出基于属性测度模型的雷达辐射源属性识别算法。通过仿真验证,该算法兼具识别准确度高和识别速度快优点,实用性较强。     

采用局域像素匹配的随机抽样一致改进算法

为提高图像拼接的配准精度和稳健性,提出基于局域像素匹配的随机抽样一致改进算法.在完成尺度不变特征变换算子或其他算子图像特征提取、特征匹配之后,利用独立于特征匹配点的局域像素,通过参考图像局域像素与映射的待拼接图像局域像素匹配,优选4对最佳特征匹配点,确定最佳单应矩阵.实验结果表明:与随机抽样一致经典算法相比,该方法未明...     

兵力展开问题研究

如何将基地的兵力以最短时间展开到多个阵地中,是运输问题中的一种。为解决此问题对著名的兵力展开问题进行了研究。建立了兵力展开问题的数学模型,此模型是一个混合整数规划模型。提出了一种求解方法,该方法可解决类似的混合整数规划问题。最后给出了一个实例。     

基于蚁群算法的防空兵兵力机动线路优化

根据防空兵对机动线路的要求以及战时的安全性特点,得出影响防空兵兵力机动线路选择的因素,引入里程指数的概念,将线路的长度进行修正赋权,给出兵力机动线路的等效线路长度。把这一等效线路长度结合到蚁群算法中,能够较好地模拟现代战场的复杂环境对防空兵兵力机动路线的影响,并能科学、合理地选择路线,为指挥员的决策提供帮助。     

基于改进核极限学习机和集成学习理论的目标机动轨迹预测

为了提高目标轨迹预测的精度以及预测模型的泛化能力,提出基于改进蝙蝠算法优化的核极限学习机(Kernel Extreme Learning Machine,KELM)和集成学习理论目标机动轨迹预测模型.构建KELM模型,并采用改进的蝙蝠算法对KELM的参数进行优化;以优化后的KELM神经网络为弱预测器,结合集成学习算法生...     

Two-agent scheduling with linear resource-dependent processing times

This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms.     

如何改善路径测试用例生成的搜索算法

软件结构测试数据生成一直是软件测试领域一个较为复杂的问题,方法和手段尚未成熟。基于程序直接执行的测试数据生成方法因其动态性,显示出一定的优越性,本文主要针对该方法的核心部分——搜索算法进行讨论,探讨了有助于改善其功能的若干手段,目的在于提高算法效率,提高其实用化程度,显示出较好的实验效果。     

Algorithms for the multi‐item multi‐vehicles dynamic lot sizing problem

We consider a two‐stage supply chain, in which multi‐items are shipped from a manufacturing facility or a central warehouse to a downstream retailer that faces deterministic external demand for each of the items over a finite planning horizon. The items are shipped through identical capacitated vehicles, each incurring a fixed cost per trip. In addition, there exist item‐dependent variable shipping costs and inventory holding costs at the retailer for items stored at the end of the period; these costs are constant over time. The sum of all costs must be minimized while satisfying the external demand without backlogging. In this paper we develop a search algorithm to solve the problem optimally. Our search algorithm, although exponential in the worst case, is very efficient empirically due to new properties of the optimal solution that we found, which allow us to restrict the number of solutions examined. Second, we perform a computational study that compares the empirical running time of our search methods to other available exact solution methods to the problem. Finally, we characterize the conditions under which each of the solution methods is likely to be faster than the others and suggest efficient heuristic solutions that we recommend using when the problem is large in all dimensions. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006.     

基于改进卡尔曼滤波方法的机动目标跟踪研究

针对在机动目标跟踪中当目标作高度机动飞行时卡尔曼滤波可能会出现严重发散的情况,提出利用BP神经网络校正其滤波结果,并将遗传算法应用于BP网络的训练过程,以解决BP网络训练速度慢的缺陷,提高算法的实时性。仿真表明该方法是可行的、有效的。