二元探测传感器网络的递推加权质心目标定位算法

为进一步降低二元探测传感器网络质心定位算法的计算复杂度和通信量、提高定位精度,推导出一种质心算法的递推公式,使用该递推公式可以大大减少定位的计算、存储和通信量;在递推质心公式的基础上,提出了一种基于节点探测到目标的次数的递推加权质心定位算法,从而提高了定位精度.对递推公式和加权质心算法进行了模拟仿真,结果验证了递推公式和加权递推质心算法的有效性.     

基于均分簇算法的战争Ad Hoc网络广播风暴抑制

网络广播是维持网络正常运作的基本手段,但Ad Hoc网络拓朴的频繁变化,将使网络广播无法进行收敛,形成广播最终会使本来就受限的资源趋于濒绝,网络无法通信而瘫痪.为此,提出了一种自适应均分簇理论SACA,通过分层虚拟子网的过滤与阻隔算法,有效地抑制网络广播风暴.     

装备维修管理系统的设计与实现

装备维修管理系统是一种新型维修管理模式,为解决现代装备协同维修过程中资源优化调度和分配的各类问题,从装备维修保障系统的需求分析入手,讨论了基于改进遗传算法的维修资源配置算法,并采用建模与仿真技术,设计实现了装备维修管理系统。     

基于遗传算法反舰导弹航路规划研究

航路规划作为提高反舰导弹作战能力的重要措施,目前正逐渐被反舰导弹所应用。结合反舰导弹自控飞行特点,系统分析航路规划过程中各个航路点的约束条件,并运用遗传算法进行数学建模和计算机编程,顺利实施了导弹航路的最优求解和航路的自动标绘,为指挥员实施导弹攻击提供辅助决策。     

四种智能算法的比较研究

随着智能算法的研究深入,一些新的智能优化算法不断被提出,包括从遗传算法、蚁群算法、粒子群算法、人工鱼群算法等。这些算法都是从自然界的自然生物的特性启发而研究出来的,由于这些算法在求解时不依赖于梯度信息,因而特别适用于传统方法解决不了的大规模复杂问题。通过这些算法的介绍和分析,并通过测试函数测试了四种算法的收敛性、收敛速度和精度,评价了这些智能算法在求解函数优化问题的能力。最后对优化算法今后的发展方向进行了评述与展望。     

一种基于神经网络的彩色图像分割方法

提出了适于彩色图像分割的加强型径向基函数网络方法,采用在线自适应聚类学习算法确定隐层节点的数目、激活函数中心值;通过Hebb学习算法迅速将隐层节点中心值分为目标颜色聚类中心和背景颜色聚类中心两类;输出层用竞争规则将目标与背景分开。通过对多幅彩色图像进行分割处理验证了该方法的有效性。     

针对旋转和平移的一种电子稳像算法

提出了一种新的基于Fourier-Mellin的电子稳像算法,用于消除由于推扫平台系统姿态不稳所造成的图像抖动。采用Fourier-Mellin算法和相位相关算法求取待稳定图像帧与参考图像帧之间的旋转角度和缩放及平移参数,并通过校正一组抖动的图像帧来验证所提出的算法。实验结果表明算法很好地估计并补偿了旋转和平移运动,能够满足一般要求。     

Network design for time‐constrained delivery

To meet customer demand, delivery companies are offering an increasing number of time‐definite services. In this article, we examine the strategic design of delivery networks which can efficiently provide these services. Because of the high cost of direct connections, we focus on tree‐structured networks. As it may not be possible to identify a tree‐structured network that satisfies all of the delivery guarantees, we allow these guarantees to be violated but seek to minimize the sum of the violations. We establish the complexity of the problem and exploit an empirically identified solution structure to create new neighborhoods which improve solution values over more general neighborhood structures. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Scheduling parallel machines with inclusive processing set restrictions

We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

On the hierarchy of γ‐valid cuts in global optimization

Concavity Cuts play an important role in concave minimization. In Porembski, J Global Optim 15 ( 17 ), 371–404 we extended the concept underlying concavity cuts which led to the development of decomposition cuts. In numerical experiments with pure cutting plane algorithms for concave minimization, decomposition cuts have been shown to be superior to concavity cuts. However, three points remained open. First, how to derive decomposition cuts in the degenerate case. Second, how to ensure dominance of decomposition cuts over concavity cuts. Third, how to ensure the finite convergence of a pure cutting plane algorithm solely by decomposition cuts. These points will be addressed in this paper. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008