An adaptive large neighborhood search heuristic for the Pollution-Routing Problem

The Pollution-Routing Problem (PRP) is a recently introduced extension of the classical Vehicle Routing Problem with Time Windows which consists of routing a number of vehicles to serve a set of customers, and determining their speed on each route segment so as to minimize a function comprising fuel, emission and driver costs. This paper presents an adaptive large neighborhood search for the PRP. Results of extensive computational experimentation confirm the efficiency of the algorithm.     

Adaptive local routing strategy on a scale-free network

Due to the heterogeneity of the structure on a scale-free network, making the betweennesses of all nodes become homogeneous by reassigning the weights of nodes or edges is very difficult. In order to take advantage of the important effect of high degree nodes on the shortest path communication and preferentially deliver packets by them to increase the probability to destination, an adaptive local routing strategy on a scale-free network is proposed, in which the node adjusts the forwarding probability with the dynamical traffic load (packet queue length) and the degree distribution of neighbouring nodes. The critical queue length of a node is set to be proportional to its degree, and the node with high degree has a larger critical queue length to store and forward more packets. When the queue length of a high degree node is shorter than its critical queue length, it has a higher probability to forward packets. After higher degree nodes are saturated (whose queue lengths are longer than their critical queue lengths), more packets will be delivered by the lower degree nodes around them. The adaptive local routing strategy increases the probability of a packet finding its destination quickly, and improves the transmission capacity on the scale-free network by reducing routing hops. The simulation results show that the transmission capacity of the adaptive local routing strategy is larger than that of three previous local routing strategies.     

WDM光网络呼叫阻塞性能分析

基于波长路由的WDM光网络L跳路径独立模型,研究节点无波长转换功能的光通路呼叫请求过程,提出了阻塞性能的数学分析方法．模型中引入了光网络资源所应该考虑的光节点接收器的配置情况．数值分析表明：光纤中复用的波长数越多以及网络通信负载量较小时,配置光节点接收器能明显改善光网络的阻塞性能．     

一种高生存性的车载自组网可信路由协议

针对目前车载自组网中路由安全问题,提出一种基于经验信任的可信路由模型.该模型从客观信任的角度引入经验信任的概念作为可信度量的标准,并给出了计算节点经验信任值和信誉度的推荐方法,根据节点的经验信任值设计一种新的动态包转发规则,从而实现车载自组网的可信路由.实验结果表明,该模型较贪婪周边无状态路由(greedy perimeter stateless routing,GPSR)协议具有较高的抵抗自私节点的能力.     

Heuristic Procedures for the Capacitated Vehicle Routing Problem

In this paper we present two new heuristic procedures for the Capacitated Vehicle Routing Problem (CVRP). The first one solves the problem from scratch, while the second one uses the information provided by a strong linear relaxation of the original problem. This second algorithm is designed to be used in a branch and cut approach to solve to optimality CVRP instances. In both heuristics, the initial solution is improved using tabu search techniques. Computational results over a set of known instances, most of them with a proved optimal solution, are given.     

State-Dependent Coupling in General Networks

In this paper we extend a result which holds for the class of networks of quasireversible nodes to a class of networks constructed by coupling Markov chains. We begin with a network in which the transition rates governing the stochastic behaviour of the individual nodes depend only on the state of the node. Assuming that the network has an invariant measure, we construct another network with transition rates at each node depending on the state of the entire network, and obtain its invariant measure.     

基于马赫-曾德尔干涉仪的单个光子操控

分别利用空间和光纤马赫—曾德尔干涉仪对空间和光纤传输中的单个光子的干涉现象进行了研究,干涉对比度可达到90％以上,实现了空间和光纤中的单个光子的路由操控。实验采用脉冲调制加衰减的方法产生单个光子,获得了每个脉冲中只包含0．1个光子的准单光子源。通过改变压电换能器的电压控制马赫—曾德尔干涉仪的单个光子在两个输出端的选择,实现了光子在节点上的路由。采用同步符合检测技术,利用重复频率为1kHz,脉冲宽度为100ns的同步信号对输出信号进行符合,实现了量子效率高于70％,暗计数小于0．2s^-1的单光子高灵敏度检测,观测到了单个光子在相位操控下出射到两个输出端的有序分配现象。验证了基于马赫—曾德尔干涉仪的单个光子路由操控实现的可能性。     

基于改进模拟退火算法的推动式生产-配送协调优化

为减小物资生产与配送不协调造成的成本及生产资源浪费,建立了考虑推动式生产调度的物资配送优化模型,并针对标准模拟退火算法受随机因素影响易陷入局部最优的缺点,设计带有回火与缓冷操作的改进模拟退火算法对模型求解,确定了优化的车辆配送路线以及物资生产计划。对比实验结果表明：相对于单纯的物资配送优化模型,考虑推动式生产调度的配送优化模型,能够有效减小物资滞留时间以及配送延误成本;相较于标准模拟退火算法,改进算法搜索到了更优解,且计算结果的标准差减小了93.42%,稳定性更好;同时,改进模拟退火算法具有较低的偏差率,在中小规模算例中求解质量较高,平均偏差率在0.5%以内。     

WDM网状网中动态域间流量疏导策略

对波分复用(Wavelength Division Multiplexing,WDM)网状网中的动态域间流量疏导问题进行了深入研究.在源路由模式下,提出了一种基于固定备选路由方式的动态域间流量疏导算法,并在其基础上提出了只考虑波长均衡和同时考虑波长均衡与业务均衡的改进方法.该算法可以有效地避免路由环,得到较低的阻塞率,节省全网的收发器数目和波长资源.仿真结果表明,这种算法可以有效地改善网络性能.     

APR-QKDN: A Quantum Key Distribution Network Routing Scheme Based on Application Priority Ranking

As the foundation of quantum secure communication, the quantum key distribution (QKD) network is impossible to construct by using the operation mechanism of traditional networks. In the meantime, most of the existing QKD network routing schemes do not fit some specific quantum key practicality scenarios. Aiming at the special scenario of high concurrency and large differences in application requirements, we propose a new quantum key distribution network routing scheme based on application priority ranking (APR-QKDN). Firstly, the proposed APR-QKDN scheme comprehensively uses the application’s priority, the total amount of key requirements, and the key update rate for prioritizing a large number of concurrent requests. The resource utilization and service efficiency of the network are improved by adjusting the processing order of requests. Secondly, the queuing strategy of the request comprehensively considers the current network resource situation. This means the same key request may adopt different evaluation strategies based on different network resource environments. Finally, the performance of the APR-QKDN routing scheme is compared with the existing schemes through simulation experiments. The results show that the success rate of application key requests of the APR-QKDN routing scheme is improved by at least 5% in the scenario of high concurrency.