基于能量分级和位置预测的高效路由算法

针对车载传感器网络节点移动速度快、网络拓扑结构不稳定、终端传感器节点能量不确定性等特点,提出了一种能量分级和位置预测的高效路由算法ERLP(Energy Rank and Location Prediction based routing)。该算法根据具有不同能量等级的节点将消息传递距离的不同选择那些能量高的节点作为中转节点,并结合节点的分布区域和当前速度,尽量将多个消息副本传递给覆盖不同方向的节点,避免消息传递的局部性。仿真结果表明,与当前典型延迟容忍网络的路由算法相比,ERLP算法在传输成功率、平均延迟时间上具有较大提升。     

基于遗传算法的MIL-STD-188-220c标准最佳转发树的构造

针对MIL-STD-188-220C标准的路由协议多目的地址最佳转发树问题,提出一种基于遗传算法的优化算法,仿真结果表明,该算法具有收敛快,寻路成功率高的优点。     

Flexibility and complexity in periodic distribution problems

In this paper, we explore trade‐offs between operational flexibility and operational complexity in periodic distribution problems. We consider the gains from operational flexibility in terms of vehicle routing costs and customer service benefits, as well as the costs of operational complexity in terms of modeling, solution methods, and implementation challenges for drivers and customers. The period vehicle routing problem (PVRP) is a variation of the classic vehicle routing problem in which delivery routes are constructed for a period of time; the PVRP with service choice (PVRP‐SC) extends the PVRP to allow service (visit) frequency to become a decision of the model. For the periodic distribution problems represented by PVRP and PVRP‐SC, we introduce operational flexibility levers and a set of quantitative measures to evaluate the trade‐offs between flexibility and complexity. We develop a Tabu Search heuristic to incorporate a range of operational flexibility options. We analyze the potential value and the increased operational complexity of the flexibility levers. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

编码感知的机会路由算法研究

提出一种编码感知的机会路由算法——CAR.它利用机会传输增加编码机会,并通过引入一系列参数衡量"机会"好坏,创造性地解决了交叉数据流下机会路由转发节点的选取问题,解决了流间网络编码和机会路由算法结合时数据包上下跳节点"已知"与"未知"的矛盾.CAR算法能够最大化每次编码传输中原始数据包的个数,仿真表明,它能够显著提高可靠传输协议以及整个网络的传输性能.通过机会传输实现多用户分集,可显著增加流间网络编码机会,引入的转发延时也可增加流间网络编码机会.     

一种基于Dijkstra算法的航空平台组网技术

针对航空平台在超低空和超视距飞行过程中,传统单一的TDMA网络难以满足无盲区通信需求,提出一种基于Dijkstra算法的AdHoc组网技术。通过建立实时邻居信息表、网络拓扑表和动态路由,在工程应用中实现了具有中继功能的地空-空空高速实时无线传输网络,满足了部队通信网络大范围覆盖和实时性需求。     

片上网络中一种单周期2GHz无缓冲路由器

近年来,无缓冲路由器由于不需要缓冲器而成为片上网络低开销的解决方案。为了提高无缓冲路由器的性能,提出一种单周期高性能无缓冲片上网络路由器。该路由器使用一个简单的置换网络替换串行化的交换分配器与交叉开关以实现高性能。虚通道路由器与基准无缓冲路由器相比,该路由器在TSMC65nm工艺下可以以较小的面积开销达到2GHz的时钟频率。在合成通信负载与真实应用负载下的模拟结果表明,该路由器的包平均延迟远小于虚通道路由器和其他无缓冲路由器。     

基于遗传算法的无线传感器网络路由研究

无线传感器网络路由算法面临着节省能量、延长网络寿命、提高可靠性等方面的挑战。提出了一种基于遗传的无线传感器网络路由算法。对算法中的算子编码、适应度函数设计、编码方式及参数选取进行了细致研究。仿真结果表明,本算法减少了能耗、延长了网络生存时间并提高了网络的可靠性。     

A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

需求可拆分的应急物资调度问题的蚁群算法

应急物资调度问题是个典型的需求可拆分的车辆路径问题,区别于传统的车辆路径问题,将每个需求节点只能由一辆车访问的约束去除,允许需求节点由多辆车进行访问。针对应急物资调度问题的特点,建立相应的多目标车辆路径数学规划模型(SDVRP),并根据模型特点设计改进蚁群优化算法。最后,进行相应的算例分析,验证了该模型和算法的有效性。     

Vehicle routing problems with regular objective functions on a path

We investigate the problem of scheduling a fleet of vehicles to visit the customers located on a path to minimize some regular function of the visiting times of the customers. For the single‐vehicle problem, we prove that it is pseudopolynomially solvable for any minsum objective and polynomially solvable for any minmax objective. Also, we establish the NP‐hardness of minimizing the weighted number of tardy customers and the total weighted tardiness, and present polynomial algorithms for their special cases with a common due date. For the multivehicle problem involving n customers, we show that an optimal solution can be found by solving or O(n) single‐vehicle problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 34–43, 2014