A bidirectional heuristic for maximizing the net present value of large‐scale projects subject to limited resources

We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

C3I系统中的态势关联技术

态势关联是在态势估计前必须解决的一个问题,即要将不同时刻的态势数据进行关联,得到各个时刻态势数据中描述的目标间的关系。对时间间隔比较长的态势数据的关联,研究了一种基于模糊推理的态势关联方法,综合考虑了目标属性信息和状态信息、战场环境信息、指挥人员的态势预估计知识,通过推理得到关联的结果。     

蒸汽动力装置分布式控制系统可靠性设计准则

讨论了为保证蒸汽动力装置分布式控制系统的可靠性所采取的一般技术 ,详细分析了提高蒸汽动力装置分布式控制系统可靠性的一般设计准则 ,包括系统设计的一般要求、计算机的选型、元器件的选择与使用以及抗干扰措施     

部队网络信息管理规律及策略研究

网络信息管理是新形势下部队管理工作的一项重要内容,对于促进官兵全面发展、加强部队行政管理、提升信息化建设具有重要意义,加强部队网络信息管理必须遵循共享与防范相结合、标本兼治和网络信息技术与官兵素质同步提高规律,从组织领导、官兵思想、安全防护、制度落实和网管人员建设五个方面构筑部队网络信息管理有效策略.     

空时频方位关联算法

针对跳频组网通信中不同信号间的时频分隔特点,利用时频重心进行目标方位数据关联,提出了空时频方位关联算法。根据提取的时频特征设计空时频测向的核函数,实现了简化的空时频测向算法。根据时频距离设计代价函数,基于匈牙利算法实现了方位关联结果的最优化二维分配。根据时频距离选择窗函数的类型和长度,有效避免了信号旁瓣泄露对测向精度的影响,显著提高了密集目标条件下的关联正确概率。数值仿真验证了上述观点。     

基于粒子群优化的模糊交通控制器设计

城市中存在着一些关键路口,其交通通畅与否会对周围路网的交通流起着很大的影响,这些路口需要优先保持通畅.针对此情况,设计了基于上下游交通信息的二级模糊交通控制器来对路网进行协调控制.在此基础上,提出了针对交通特性改进的粒子群优化算法（TIPSO）,并采用TIPSO对第一级模糊规则进行优化,实验结果表明TIPSO对模糊规则具有较好的优化效果,能够离线训练,获取到比人工设定的更优的模糊规则.     

The graph association problem: Mathematical models and a lagrangian heuristic

Graph association is the problem of merging many graphs that collectively describe a set of possibly repetitive entities and relationships into a single graph that contains unique entities and relationships. As a form of data association, graph association can be used to identify when two sensors are observing the same object so information from both sensors can be combined and analyzed in a meaningful and consistent way. Graph association between two graphs is related to the problem of graph matching, and between multiple graphs it is related to the common labeling of a graph set (also known as multiple graph matching) problem. This article contribution is to formulate graph association as a binary linear program and introduce a heuristic for solving multiple graph association using a Lagrangian relaxation approach to address issues with between‐graph transitivity requirements. The algorithms are tested on a representative dataset. The developed model formulation was found to accurately solve the graph association problem. Furthermore, the Lagrangian heuristic was found to solve the developed model within 3% of optimal on many problem instances, and found better solutions to large problems than is possible by directly using CPLEX. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

多目标数据关联的多维Lagrangian松驰法

将多目标跟踪中的数据关联问题提成为一个离散最优化问题 ,并采用 L agrangian松驰算法来克服该问题面临的计算困难 ,这是目前多祯多目标测量数据关联研究发展的重要方向。首先将多祯多目标数据关联问题建立为一个带约束的多维分配问题 ;并在维数大于 2时 ,采用 L agrangian松驰算法来松驰约束条件 ,使问题降维为计算上可接受的二维分配问题。     

一种有源无源联合定位系统的航迹起始方法

为了解决雷达面临的四大威胁和无源定位系统定位精度偏低及被动工作的问题,多站有源无源联合定位系统正在成为研究热点。航迹起始是该系统对目标进行跟踪的首要问题。在航迹起始过程中,系统需要将有源观测点迹和无源观测点迹进行融合,其本质是异类源数据融合问题。分析了有源无源联合定位系统的航迹起始问题的特点,提出了一种针对有源无源联合定位系统的航迹起始方法。仿真实验结果表明了该算法的有效性。     

基于EKF算法的弹道导弹助推段跟踪建模与仿真

围绕弹道导弹助推段跟踪问题,分析了助推段反弹道导弹的基本作战过程,建立了弹道导弹助推段动力学模型,分别就单传感器/单弹道导弹和多传感器/多弹道导弹两种情况建立了基于EKF算法的弹道导弹助推段跟踪模型,并通过算例验证了模型和算法的有效性,可为助推段反弹道导弹建模与仿真提供一定的参考。