基于路网二次分层模型的出行路径诱导优化方法

为了提高出行诱导路径搜索的效率和优度,提出了一种基于道路功能以及交通状态划分的路网二次分层模型,模型从道路的功能角度进行路网的初分层,从道路交通状态角度,通过设定的交通状态阂值进行路网的次分层,建立的路网二次分层模型从宏观方面反映路网的结构,从微观方面反映路网运行的交通参数;利用路网二次分层模型所划分的各层路网之间的协同,借助限制区域的A‘算法进行最优路径的“三段巡径”过程。实例表明该算法实用、高效,有助于搜索得到最优出行路径。     

Optimal tank-trailer routing using the ILOG constraint programming – a Taiwan case study

Abstract

This paper investigates the routing of pressurized tank trailers and proposes a scheduling plan which ensures the practical delivery of industrial gases under the objective of reducing transportation costs. Using constraint programming, we solve a combinatorial optimization problem that incorporates both hard and soft constraints for routing and scheduling tank trailers. Hard constraints are resource and safety/regulation constraints, whereas soft constraints are utilization and efficiency constraints. This approach enables tank-trailer routing and scheduling management to consider different combinations of parameters and view the results in ‘real-time.’ The routing and scheduling results based on a case study in Taiwan fulfil the goals of avoiding risks associated with transporting industrial gases, and attaining efficient delivery while conforming to regulations and consistent with good business practice. The results also suggest that significant economies in distribution costs are possible.     

物料配送和废旧产品回收的VRPSDP问题的并行模拟退火算法

为了求解面向制造领域物料配送和废旧产品回收的同时送取货的车辆路径优化问题（VRPSDP）,提出一种主从式并行模拟退火算法代替传统的串行模拟退火算法．算法首先使用剩余承载力和径向附加费（RCRS）算法求得初始解,然后在并行模拟退火算法框架下使用4种邻域搜索方法对初始解进行优化．最后,选取国际上通用的Montane和Galvao测试数据集（18个顾客数为100～400的测试问题）对算法性能进行测试,与文献中其他5种算法的比较显示,提出的并行模拟退火算法总体性能较优．     

基于改进鱼群算法的应急车辆最优路径选择

当突发事件发生后,要求将救援物资在最短的时间内运输到受灾点,而在整个应急救援过程中,应急车辆路径的选择对救援工作起到至关重要的作用,建立应急车辆最优路径选择模型对最优路径选择具有重要作用。介绍基本人工鱼群算法的主要算子并提出一种改进的人工鱼群算法,最后通过算例验证该算法在应急车辆路径选择时具有较好的效果和应用价值。     

基于NSGA-Ⅱ的接运公交线路与时刻表协调优化方法

在公交规划研究中,常将公交网络规划问题分解为公交路线设计和行车时刻表设计,并尝试运用非传统优化方法解决,但对于多种公交模式换乘背景下的公交线路与时刻表协调优化问题的研究较为缺乏.文中以直接服务于轨道交通的接运公交为研究对象,在实现接运公交与轨道交通的有效衔接条件下,构建接运公交的路线选择与时刻表协调优化模型,并设计基于非支配排序遗传算法（NSGA-Ⅱ）的多目标优化算法对模型进行求解,实现接运公交路线与时刻表的协同编制,并通过实例分析检验模型.     

无线传感器网络多路径路由算法的研究

在多路径路由算法的研究中,仍然存在着一定的局限性,如没有充分考虑网络中链路的多重特性.因此,文中在定向扩散路由算法的基础上提出了一种多路径路由算法(EDB-MRA).该算法在源节点和目的节点之间建立多条路径,根据网络链路中的3个特征值--能量消耗、延时和带宽,给每条路径赋予一定的选择概率,使得数据总能在链路性能较优的多路径中传输,从而延长了网络的生存周期,提高了传输的可靠性.     

一种基于主观逻辑的无线传感器网络可信路由算法

无线传感器网络中高敏感度数据传输业务要求路由协议设计时必须考虑能量与安全约束.LEAcH分簇路由算法没有考虑节点与所选路径的安全性,文中提出的基于主观逻辑的可信LEACH路由算法(TLEACH_BSL)充分考虑节点可信度评价,对改进前后路由算法作了理论性分析及仿真实验比较,为可信路由算法体系的研究提供了思路.     

Some remarks on the TKIP key mixing function of IEEE 802.11i

Temporal key integrity protocol (TKIP) is a sub-protocol of IEEE 802.11i. TKIP remedies some security flaws in wired equivalent privacy (WEP) protocol. TKIP adds four new algorithms to WEP: a message integrity code (MIC) called Michael, an initialization vector (IV) sequencing discipline, a key mixing function and a re-keying mechanism. The key mixing function, also called temporal key hash, de-correlates the IVs from weak keys. Some cryptographic properties of the substitution box (S-box) used in the key mixing function are investigated in this paper, such as regularity, avalanche effect, differ uniform and linear structure. Moen et al pointed out that there existed a temporal key recovery attack in TKIP key mixing function. In this paper a method is proposed to defend against the attack, and the resulting effect on performance is discussed.     

Effects of denial of service attack in mobile ad hoc networks

Mobile ad hoc networks are often deployed in environments where the nodes of the networks are unattended and have little or no physical protection against tampering. The nodes of mobile ad hoc networks are thus susceptible to compromise. The networks are particularly vulnerable to denial of service (DoS) attacks launched through compromised nodes or intruders. In this paper, we investigated the effects of flooding attacks in network simulation 2 (NS-2) and measured the packet delivery ratio and packet delay under different flooding frequencies and different numbers of attack nodes. Simulation results show that with the increase the flooding frequencies and the numbers of attack nodes, network performance drops. But when the frequency of flooding attacks is greater than a value, the performance decrease gets smooth. Meanwhile the packet delay firstly increases and then declines to a value of stability at the end.     

��̬���������Ż�������������׶��㷨

研究了动态车辆配送优化调度问题的高效求解算法。在分析配送车辆调度中造成车辆动态性的原因的基础上,提出了一种考虑车辆故障和车辆多次巡回配送的动态车辆配送优化调度问题。在对该问题进行描述的基础上,制定了求解该问题的两阶段策略：第一阶段制定整体优化计划;第二阶段进行实时局部优化调度。设计和实现了求解该问题的两阶段算法：第一阶段采用禁忌搜索算法制定优化的配送计划;第二阶段采用局部搜索算法实时进行优化调度。既充分利用了禁忌搜索算法全局搜索能力强的优势,又充分利用局部搜索算法收敛速度快的优势。最后,通过实验计算验证了算法的良好的性能。