基于规则评价的武器目标分配方法

遗传算法、蚁群算法、粒子群优化算法等解决武器目标分配问题的典型方法尚不能满足工程应用的要求,为了提高舰艇对反舰导弹防御过程中的武器目标分配问题的工程化水平,采用系统分析的方法,提出一组适应舰艇火力通道组织的火力分配规则,设计了基于规则评价的武器目标分配方法,建立了评价函数及求解过程,并分析了算法的复杂度,该方法可以使目标分配结果与规则的符合度直观明确,更符合指挥员的自然决策思维过程,具有很好的工程实用价值。     

自校正极点配置解耦控制器

本文提出的多变量自校正控制器，完成了对控制系统的闭环及极点配置和动态解耦，且能使系统对阶跃给定值实现稳态无差跟踪。本算法适用于最小相位系统、非最小相位系统以及各道时延不等的系统。数字仿睦证实了本算法的良好性能。     

IEEE802．16d无线MESH网络路由协议研究

无线Mesh网络是一种新型的无线通信网络,具有自组织、自管理和自愈的特点,是一种多跳的宽带无线接入网络结构,也是一种高容量、高速率的分布式网络。在介绍WMN基本概念的基础上,针对制约MESH网络发展的路由技术问题,在传统AODV路由协议的基础上提出了新的路由协议OLRP,并给出仿真结果。     

发射型钹式换能器的研究

为分析低频钹式换能器的发射电压响应、辐射声功率、发射效率等性能参数,通过ANSYS有限元软件建立了发射换能器的轴对称模型,设计了不同结构参数的共振频率为2kHz左右发射型钹式换能器,从结构阻尼入手,通过仿真分析计算,得到换能器的带宽、品质因数等,比较了不同结构参数的换能器的各项性能,绘制了不同结构参数的发射电压响应曲线,为分析设计钹式换能器提供了理论依据。     

Application of genetic algorithms for joint optimization of signal setting parameters and dynamic traffic assignment for the real network data

This paper presents the joint optimization of signal setting parameters and dynamic user equilibrium (DUE) traffic assignment for the congested urban road network. The simulation-based approach is employed to obtain the DUE condition for the case of multiple-origin multiple-destination traffic flows. The dynamic traffic assignment simulation program (DTASP), developed in C language is used to assign the traffic dynamically on the road network, whereas method of successive averages (MSA) is modified and used to arrive at the DUE condition. The artificial intelligence technique of genetic algorithms (GAs) is applied to obtain the optimal signal setting parameters and path flow distribution factor for DUE condition. The methodology developed in such a way that joint optimization of signal setting parameters with DUE is obtained. The proposed method is applied to the real network data of Fort Area of Mumbai city comprising of 17 nodes and 56 unidirectional links with 72 Origin–Destination pairs, where all the 17 nodes are signalized intersections. The traffic flow condition for the optimized signal setting parameters is considerably improved compared to the existing signal settings. The results prove that the GA is an effective technique to solve the joint optimization problem for the real network data.     

基于综合运输网络的客流分配优化模型与算法

以综合运输网络条件下的客流分配为研究对象,提出更适合表现旅客出行需求和各种运输方式相互竞争关系的运输细分方式,采用可量化表征综合运输网络当前客流状态的区间饱和度和径路饱和熵,并结合旅客出行广义费用函数,构造旅客出行阻抗函数,给出以综合运输网络中旅客出行总阻抗最小为目标的客流分配优化模型.基于k条最短路算法和混沌优化算法,在径路选择时考虑当前综合运输网络的旅客出行阻抗因素,设计客流分配迭代优化的动态求解算法.算例表明,利用给出的模型和算法能够得到可行和更为细分的综合运输网络客流分配方案.     

高速铁路防灾安全监控系统通信组网方案探讨

介绍高速铁路防灾安全监控系统3个主要通信组网方案,并对3个方案的组网原理、保护倒换原理、业务处理流程等进行深入分析。从网络可靠性、传输时延、传输带宽、工程投资、工程实施难度等方面对方案进行分析比较,通过全面的分析比较提出树型组网方案是防灾安全监控系统最佳通信组网方案,对后续工程的设计有一定的参考意义。     

随机交通分配中有效路径的定向树搜索算法

交通路网中有效路径的确定方法是进行各类随机交通流量分配的关键技术.文章将交通路网中节点位置的确定性与交通出行中路径选取的有向性相结合,模拟树的生长,提出了一种有效路径的定向树搜索算法.通过将该方法应用于随机用户均衡分配模型,说明了该方法的有效性.     

A generic class of first order node models for dynamic macroscopic simulation of traffic flows

Node models for macroscopic simulation have attracted relatively little attention in the literature. Nevertheless, in dynamic network loading (DNL) models for congested road networks, node models are as important as the extensively studied link models. This paper provides an overview of macroscopic node models found in the literature, explaining both their contributions and shortcomings. A formulation defining a generic class of first order macroscopic node models is presented, satisfying a list of requirements necessary to produce node models with realistic, consistent results. Defining a specific node model instance of this class requires the specification of a supply constraint interaction rule and (optionally) node supply constraints. Following this theoretical discussion, specific macroscopic node model instances for unsignalized and signalized intersections are proposed. These models apply an oriented capacity proportional distribution of the available supply over the incoming links of a node. A computationally efficient algorithm to solve the node models exactly is included.     

A link-node complementarity model and solution algorithm for dynamic user equilibria with exact flow propagations

In this paper, we propose a link-node complementarity model for the basic deterministic dynamic user equilibrium (DUE) problem with single-user-class and fixed demands. The model complements link-path formulations that have been widely studied for dynamic user equilibria. Under various dynamic network constraints, especially the exact flow propagation constraints, we show that the continuous-time dynamic user equilibrium problem can be formulated as an infinite dimensional mixed complementarity model. The continuous-time model can be further discretized as a finite dimensional non-linear complementarity problem (NCP). The proposed discrete-time model captures the exact flow propagation constraints that were usually approximated in previous studies. By associating link inflow at the beginning of a time interval to travel times at the end of the interval, the resulting discrete-time model is predictive rather than reactive. The solution existence and compactness condition for the proposed model is established under mild assumptions. The model is solved by an iterative algorithm with a relaxed NCP solved at each iteration. Numerical examples are provided to illustrate the proposed model and solution approach. We particularly show why predictive DUE is preferable to reactive DUE from an algorithmic perspective.