移动自组网路由协议AODV的性能研究

AODV协议是DSDV协议的一种改进。利用Manet工作小组推荐的NS2仿真软件对AODV进行模拟，从最大连接度、移动速度、移动范围、节点个数、分组发送频率5个方面分析AODV的性能。根据不同仿真场景计算出各种情况下AODV协议的分组平均递交率、端到端的平均延迟和路由开销，并根据仿真结果分析了以上5个方面对AODV协议的影响，最后得出AODV的最佳工作环境。     

遗传算法在选播路由中的应用

选播是一种新型的网络服务，它使用户通过选播地址就能访问到该地址所表示的一组服务器，而传输的实时性要求传输时延尽可能的小。文章针对这种有时延约束的选播QoS路由问题，提出了一种改进的遗传算法以求解该问题。仿真实验表明，该算法是可行且有效的。     

多目标多重运输调度问题的混合算法

本文研究了多目标多重运输调度问题．建立了该问题的目标规划模型，提出了该问题基于分校定界和割平面技术的混合算法。     

Intelligent Iterated Local Search Methods for Solving Vehicle Routing Problem with Different Fleets

Introduction Vehicle routing problem (VRP) with differentfleets is an important investment decision in reality. Itconsists of two decision-making processes: selectingvehicles of available types and routing the selectedfleet. A desirable fleet has more than one type of ve-hicles. Typically, the fixed cost of vehicles accountsfor approximately 80% of the total cost associatedwith vehicles[1]. The fixed cost is a major factor todetermine vehicle combination in a fleet.A few models were develope…     

多出口路由策略实现及相关问题研究

研究了校园网多出口的需求产生及面临的问题，对比了三种可能的方法，提出了较合理的配置方案，该方案利用了静态路由优先级、网络地址转换、基于策略的路由、VLAN及访问控制列表等多种技术，实现了路由链路备份、访问速度提升，降低国际流量计费．     

Overview of Stochastic Vehicle Routing Problems

Stochastic vehicle routing problems (VRPs) play important roles in logistics, though they have not been studied systematically yet. The paper summaries the definition, properties and classification of stochastic VRPs, makes further discussion about two strategies in stochastic VRPs, and at last overviews dynamic and stochastic VRPs.     

FAST UPDATE ALGORITHM FOR TCAM-BASED ROUTING LOOKUPS

Introduction　　 The higher bandwidth need requires fastercommunication links and faster network router.The central bottlenecks in router are link speeds,switching and routing lookups. Readily availablesolutions exist for the first two factors:for exam-ple,fiber- optic cables can provide faster links.Switching was well studied and the good solutionslike fast busses and crossbar switches were devel-oped[1,2 ] .Thus the major remaining bottleneck isfast routing lookups. Fast forwarding engines,…     

铁路应急通信网络组呼的组播路由算法分析

从建立GSM-R铁路应急通信网络的需要出发,在组播路由算法ODMRP的基础上通过改进,提出1种支持GSM-R铁路应急通信网络组呼的组播路由新算法(REGCA)及其算法流程。在该算法中加入了抑制听者发言、限制洪泛区域以及允许自动加入临时组播等控制策略。使用NS2仿真工具建立武广高铁应急通信系统自组网仿真模型,然后根据模型建立相应的仿真场景,对REGCA算法进行仿真分析。仿真结果表明,采用REGCA算法能够大大减轻网络负载、提高分组投递率、降低端到端传输时延和路由开销;采用REGCA算法在各种仿真场景中的分组投递率均达80%以上,端到端传输平均时延均在0.4s以下,能够满足GSM-R铁路应急通信环境下的组呼要求。     

通信网簇间的自适应路由算法

船舶航行条件比较复杂,导致通信网络运行的功率消耗巨大,而且经常会发生通信中断的情况。针对船舶网络簇之间的通信特点,提出一种自适应的路由优化算法,可保证源节点和基站进行通信时能够选择最佳路由或次佳路由,有效减少由于网络没有覆盖到导致通信突然中断的情况。实际应用显示,文中所提的算法与其他算法相比,当吞吐量和误码率都相同时,经过一轮所消耗的能量更少,而且当节点密度不相同时,网络的生命周期以及网络的工作持续时间都被大大延长。     

Optimal solution to the vehicle routing problem by adopting a meta-heuristic algorithm

The delivery service provided by large-scale retailers continues to grow as online sales occupy an increasingly large share of the market. This study aims to tease out efficient vehicle scheduling times as well as optimal delivery routes by applying meta-heuristic algorithms. Monthly data on existing routes were obtained from a branch of Korea’s leading large-scale online retailer. The first task was to examine the status of existing routes by comparing delivery routes created using Dijkstra’s algorithm with existing delivery routes and their vehicle scheduling. The second task was to identify optimal delivery routes through a comparative analysis of the genetic algorithm and Tabu search algorithm, known for its superior applicability amongst other meta-heuristic algorithms. These findings demonstrate that the optimal vehicle routing problem not only has the potential to reduce distribution costs for operators and expedite delivery for consumers, but also the added social benefit of reduced carbon emissions.